Technical Note—Constraint Qualifications for Inexact Linear Programs
- 1 August 1979
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 27 (4) , 843-847
- https://doi.org/10.1287/opre.27.4.843
Abstract
By means of a new constraint qualification, we establish a duality theorem for inexact linear programs, complementing the results stated by Soyster, which, as shown by two examples, are not generally true without further assumptions. Qualifications are then discussed in this context.Keywords
This publication has 0 references indexed in Scilit: