In any graphically solvable linear program, if two points are feasible, then any weighted average of the two points (where weights are non-negative and add up to 1.0) will also be feasible.

Question

Quizplus · Accepted Answer

This statement is true due to the convexity property of the feasible region in linear programming. The feasible region of a linear program is always a convex set, meaning that if two points are feasible, any convex combination (or weighted average where weights are non-negative and sum up to 1) of these points will also be within the feasible region, thus also being feasible.

In Any Graphically Solvable Linear Program, If Two Points Are