Technical Note—Dynamic Generalized Upper Bounding

Richard D. McBride
Additional contact information
Richard D. McBride: University of Southern California, Los Angeles, California

Operations Research, 1978, vol. 26, issue 2, 365-369

Abstract: We develop a factored basis inverse for linear programming problems with generalized upper bound (GUB) constraints. The method allows both +1's and −1's in inequality GUB constraints. We then present a dynamic factorization GUB algorithm that seeks to reduce the size of the working inverse. Finally, a comparison of algorithms used to locate GUB structures is mentioned.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.2.365 (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:26:y:1978:i:2:p:365-369

Access Statistics for this article

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