Technical Note—Explicit Solutions of Interval Linear Programs

S. Zlobec and A. Ben-Israel
Additional contact information
S. Zlobec: McGill University, Montreal, Quebec, Canada
A. Ben-Israel: Technion—Israel Institute of Technology, Haifa, Israel

Operations Research, 1973, vol. 21, issue 1, 390-393

Abstract: This note gives conditions for an explicit (noniterative) representation of the set of optimal solutions of interval programming problems: maximize {( c , x ): a ≦ Ax ≦ b } and standard programming problems: maximize {( c , x ): Ax = b, 0 ≦ x ≦ u }.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.390 (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:21:y:1973:i:1:p:390-393

Access Statistics for this article

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