An Algorithm for Solving Interval Linear Programming Problems

A. Charnes, Frieda Granot and F. Phillips
Additional contact information
A. Charnes: University of Texas, Austin, Texas
Frieda Granot: University of British Columbia, Vancouver, British Columbia
F. Phillips: University of Texas, Austin, Texas

Operations Research, 1977, vol. 25, issue 4, 688-695

Abstract: This paper presents an algorithm for solving interval linear programming (IP) problems. The algorithm is a finite iterative method. At each iteration it solves a full row rank, (IP) problem with only one additional constraint.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.4.688 (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:25:y:1977:i:4:p:688-695

Access Statistics for this article

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