Using the facts given in Prob. 4.5-5, show that the following statements must be true for any

Question:

Using the facts given in Prob. 4.5-5, show that the following statements must be true for any linear programming problem that has a bounded feasible region and multiple optimal solutions:
(a) Every convex combination of the optimal BF solutions must be optimal.
(b) No other feasible solution can be optimal.