On the optimal value function for certain linear programs with unbounded optimal solution sets
Often, the coefficients of a linear programming problem represent estimates of true values of data or are subject to systematic variation. In such cases, it is useful to perturb the original data and to either compute, estimate, or otherwise describe the values of the function f which gives the optimal value of the linear program for each perturbation. If the right-hand derivative of f at a chosen point exists and is calculated, then the values of f in a neighborhood of that point can be estimated. However, if the optimal solution set of either the primal problem or the dual problem is unbounded, then this derivative may not exist. In this note, we show that, frequently, even if the primal problem or the dual problem has an unbounded optimal solution set, the nature of the values of f at points near a given point can be investigated. To illustrate the potential utility of our results, their application to two types of problems is also explained.
- On the optimal value function of a linearly perturbed quadratic program
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
- The optimal value bounds of the objective function in the Interval Linear Programming Problem
- On solutions of set-valued optimization problems
- On the differentiability of optimal values for bounded nonlinear programs with equality constraints
- scientific article; zbMATH DE number 915667
- Optimality for nonlinear programs containingn-set functions
- Optimal value function in semi-infinite programming
- On optimization problems with set-valued objective maps: existence and optimality
- On the continuity of the value of a linear program and of related polyhedral-valued multifunctions
- Algorithms for the vector maximization problem
- Evolution of linear programming computing techniques
- scientific article; zbMATH DE number 3121288 (Why is no real title available?)
- Linear Multiple Objective Problems with Interval Coefficients
- Marginal Values in Linear Programming
- New Methods in Mathematical Programming—On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem
- Note—Sensitivity Analysis in Leontief Substitution Systems
- On Parametric Linear Programming
- On the continuity of the maximum in parametric linear programming
- On the continuity of the minimum set of a continuous function
- Point-to-Set Maps in Mathematical Programming
- Rim Multiparametric Linear Programming
- La valeur optimale des programmes entiers. (The optimal value of integer programs)
- Generalized derivatives of the optimal value of a linear program with respect to matrix coefficients
- LP-related representations of Cesàro and Abel limits of optimal value functions
- Some comments on a linear programming problem
This page was built for publication: On the optimal value function for certain linear programs with unbounded optimal solution sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795745)