A Dual Generalized Upper Bounding Technique

Michael D. Grigoriadis
Additional contact information
Michael D. Grigoriadis: IBM Corporation, New York Scientific Center

Management Science, 1971, vol. 17, issue 5, 269-284

Abstract: A Generalized Upper Bounding technique, similar to that introduced by Dantzig and Van Slyke [Dantzig, G. B., Van Slyke, R. M., 1967. Generalized upper bounding techniques. Journal of Computer and System Sciences. Vol. 1 pp. 213-226.], for solving large linear programs "with m + L equations (m \ll L), L of which have the property that each variable has at most one nonzero coefficient in them" is offered. The algorithm is a variant of the dual simplex method, uses a working basis of order m and allows implementation of various pivoting strategies. The necessary modifications to the algorithm for handling bounded variables are also described.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.5.269 (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:ormnsc:v:17:y:1971:i:5:p:269-284

Access Statistics for this article

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