Letter to the Editor---On Upper Bounds for the Number of Iterations in Solving Linear Programs

Richard E. Quandt and Harold W. Kuhn
Additional contact information
Richard E. Quandt: Princeton University, Princeton, New Jersey
Harold W. Kuhn: Princeton University, Princeton, New Jersey

Operations Research, 1964, vol. 12, issue 1, 161-165

Abstract: Comments on a note by T. L. Saaty (“A Conjecture Concerning the Smallest Bound on the Iterations in Linear Programming,” Opns. Res. , 11 , 151--153 (1963).

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.1.161 (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:12:y:1964:i:1:p:161-165

Access Statistics for this article

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