A triangulafuzation method for computations in linear programming

G. G. Alway

Naval Research Logistics Quarterly, 1962, vol. 9, issue 3‐4, 163-180

Abstract: This paper describes a method for computations in linear programming which is midway between methods such as the “stepping stone” procedure for the distribution model in which no inverses of bases are kept, and the modified simplex method in which one carries along the complete inverse of the basis at each stage. It is designed to avoid division by pivots until the optimum basis has been obtained. Thus a small pivot will not affect adversely all subsequent steps.

Date: 1962
References: Add references at CitEc
Citations:

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

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:9:y:1962:i:3-4:p:163-180

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 ().