The Convexity of the Feasible Region of a Linear Program
Students sometimes confuse convexity with simple connectedness or the absence of 'holes'. They might fail to grasp that convexity is a stricter property: it's not just that the region is one piece, but that *every* straight path between *any* two points within it remains entirely inside, a property foundational for optimization algorithms.
Institutional Reference: Linear and Integer Programming
View Full Proof →