We recall that in linear programming small continuous changes of data can cause discontinuities, such as a sudden collapse or an explosion of the feasible set. This typically results in jumps of optimal solutions and the optimal value. The main objective of the report is to suggest a method for stable planning using linear and convex models. We show how to change data in the model so that a prescribed demand be satisfied and that, in the process of satisfying the demand, discontinuities do not occur.
No takes yet. Share an insight, caveat, or question.
S. Zlobec (1983) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: