Technical Note—Constraint Qualifications for Inexact Linear Programs

J. Ch. Pomerol
Additional contact information
J. Ch. Pomerol: Université P. et M. Curie, Paris France

Operations Research, 1979, vol. 27, issue 4, 843-847

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.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.4.843 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:4:p:843-847

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().