Unformatted text preview: Hint: Modify the algorithm that constructs a basic feasible solution from a feasible solution. Remark: Question 3 can be used to prove the Fundamental Theorem of Linear Programming (that is, if ( P ) is feasible and bounded, then ( P ) has an optimal solution). Note that there are only ±nitely many basic feasible solutions to ( P ). So, if ( P ) is feasible, we can choose a basic feasible solution x ∗ maximizing c T x ∗ . If ( P ) is bounded, then, by Question 3, x ∗ is an optimal solution to (P)....
View
Full Document
 Spring '07
 S.Furino,B.Guenin
 Operations Research, Linear Programming, Optimization, Simplex algorithm, linear program

Click to edit the document details