Overview 1The plan of this section
LP optima are at vertices; simplex walks downhill along edges; every LP has a dual with the same optimal value.
Needs: Theorem 5.4, Theorem 3.7
Leads to: Definition 1.1
Free chapterTry everything here: cards, proofs and practice. Sign up free to save your progress and unlock all 4 chapters.Sign up free
OPTIM · 1
Linear programming
12 concepts · 16 questions
1 / 12
Quick check
Can a linear objective have a local minimum on a polyhedron that is not global?
← → move · space statement · f focus