Some generalization of inexact linear programming
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 23 (1) , 1-6
- https://doi.org/10.1080/02331939208843740
Abstract
In this paper the generalization of the inexact programming is introduced and next its properties are investigated. The special case of the inexact linear programming is the well known linear programmingKeywords
This publication has 5 references indexed in Scilit:
- Technical Note—Constraint Qualifications for Inexact Linear ProgramsOperations Research, 1979
- Technical Note—Exact Solutions of Inexact Linear ProgramsOperations Research, 1976
- ErratumOperations Research, 1974
- 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