Proof that All Optimal Solutions to a Linear Program Form a Convex Set
Students often struggle to distinguish between the 'convexity of the feasible region' and the 'convexity of the optimal set.' Remember: the feasible region is convex because linear inequalities define half-spaces, and the optimal set is a specific level-set slice of that region.
Institutional Reference: Linear and Integer Programming
View Full Proof →