Letter to the Editor---Examples Relating to the Simplex Method

A. J. Goldman and Daniel Kleinman
Additional contact information
A. J. Goldman: National Bureau of Standards
Daniel Kleinman: National Bureau of Standards

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

Abstract: An example is given showing that the most common variant of the simplex algorithm does not satisfy a condition conjectured by Saaty in an analysis of the maximum possible number of iterations. Situations are exhibited in which the simplex method encounters all vertices of the constraint polyhedron.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.1.159 (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:159-161

Access Statistics for this article

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