A Strongly Polynomial Algorithm for a Special Class of Linear Programs

I. Adler and S. Cosares
Additional contact information
I. Adler: University of California, Berkeley, California
S. Cosares: Bell Communications Research, Piscataway, New Jersey

Operations Research, 1991, vol. 39, issue 6, 955-960

Abstract: We extend the list of linear programming problems that are known to be solvable in strongly polynomial time to include a class of LPs which contains special cases of the generalized transshipment problem. The result is facilitated by exploiting some special properties associated with Leontief substitution systems and observing that a feasible solution to the system, Ax = b , x ≥ 0, in which no variable appears in more than two equations, can be found in strongly polynomial time for b belonging to some set Ω.

Keywords: programming; linear: strong polynomality; exploiting special structure (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.6.955 (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:39:y:1991:i:6:p:955-960

Access Statistics for this article

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