Page 1 of 1
INDR 262 Introduction to Optimization Methods Spring 2012 Question 3 (30 points) A basic property of any linear programm
Posted: Thu Apr 28, 2022 2:38 pm
by answerhappygod
- Indr 262 Introduction To Optimization Methods Spring 2012 Question 3 30 Points A Basic Property Of Any Linear Programm 1 (77.43 KiB) Viewed 40 times
INDR 262 Introduction to Optimization Methods Spring 2012 Question 3 (30 points) A basic property of any linear programming problem with a bounded feasible region is that every feasible solution can be expressed as a convex combination of the CPF solutions. Similarly, for the augmented form of the problem, every feasible solution can be expressed as a convex combination of the BF solutions. If there is only one CPF solution with the optimal objective function value for the linear programming problem, show that the objective function value for every convex combination of BF solutions must be worse than the optimal solution.