Perold, André. "Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming." SIAM Journal on Control and Optimization 19, no. 1 (1981): 52–63.

So for the XYZ problem, the initial basic feasible solution is (0,0,4,12,18). This gives us an objective function of zero, which is not very optimal, but at least it's a start.

This technique is useful for differentiating among alternate optimal solutions to a linear program. It also fits into the formal paradigm presented in goal programming. In goal programming, the ...

Traditional sensitivity analysis in linear programming usually focuses on variations of one coefficient or term at a time. The tolerance approach was proposed to provide a decision maker with an ...