Duality for inexact linear programming problems∗
- 1 January 1997
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 39 (2) , 137-150
- https://doi.org/10.1080/02331939708844278
Abstract
We propose a notion of dual problem for the inexact linear programming problem in general form. Weak and strong duality relations are discussedKeywords
This publication has 6 references indexed in Scilit:
- Stability of the optimal basis of a linear program under uncertaintyOperations Research Letters, 1993
- Some generalization of inexact linear programmingOptimization, 1992
- Technical Note—Constraint Qualifications for Inexact Linear ProgramsOperations Research, 1979
- Technical Note—Exact Solutions of Inexact Linear ProgramsOperations Research, 1976
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive ConstraintsOperations Research, 1974
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear ProgrammingOperations Research, 1973