Cycling in the dual simplex algorithm

E. M. L. Beale

Naval Research Logistics Quarterly, 1955, vol. 2, issue 4, 269-275

Abstract: This note describes the construction of an example in which the usual iterative method for linear programming may fail unless special techniques for overcoming degeneracy are used.

Date: 1955
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800020406

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:wly:navlog:v:2:y:1955:i:4:p:269-275

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().