×

Determining GUB sets via an invert agenda algorithm. (English) Zbl 0295.90027


MSC:

90C05 Linear programming
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] A.L. Brealey, G. Mitra and H.P. Williams, ”Analysis of mathematical programming problems prior to applying the simplex algorithm”, Paper presented at the Eighth International Mathematical Programming Symposium, Stanford University, August 1973.
[2] E. Hellerman and D. Rarick, ”Reinversion with the preassigned pivot procedure”,Mathematical Programming 1 (2) (1971) 195–216. · Zbl 0246.65022 · doi:10.1007/BF01584086
[3] E. Hellerman and D. Rarick, ”The partitioned preassigned pivot procedure (P4)”, in:Sparse matrices and their applications, Eds. D.J. Rose and P.A. Willoughby (Plenum Press, New York, 1972) pp. 67–76.
[4] D.S. Hirshfeld, ”Generalized upper bounding (GUB) theory, applications and performance”, Presentation to Share XXXV, Mathematical Programming Project, August 1970.
[5] J.E. Kalan, ”Aspects of large-scale in-core linear programming”,Proceedings of ACM (1971) 304–313.
[6] H.M. Markowitz, ”The elimination form of the inverse and its application to linear programming”,Management Science 3 (3) (1957) 255–269. · Zbl 0995.90592 · doi:10.1287/mnsc.3.3.255
[7] W. Orchard-Hays,Advanced linear programming computing techniques (McGraw-Hill, New York, 1968). · Zbl 0995.90595
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.