Technical Note—Generalized Upper Bounds and Triangular Decomposition in the Simplex Method

J. A. Tomlin
Additional contact information
J. A. Tomlin: Stanford University, Stanford, California

Operations Research, 1974, vol. 22, issue 3, 664-668

Abstract: This note shows how the new updating techniques for triangular factors of the basis can be modified for the generalized upper-bounding algorithm.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.3.664 (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:22:y:1974:i:3:p:664-668

Access Statistics for this article

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