Skip to main content
SpringerLink
Log in

Determining GUB sets via an invert agenda algorithm

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  7. W. Orchard-Hays,Advanced linear programming computing techniques (McGraw-Hill, New York, 1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Science Systems, Rockville, Md., USA

    Harvey J. Greenberg & Dennis C. Rarick

Authors
  1. Harvey J. Greenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dennis C. Rarick
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Greenberg, H.J., Rarick, D.C. Determining GUB sets via an invert agenda algorithm. Mathematical Programming 7, 240–244 (1974). https://doi.org/10.1007/BF01585520

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585520

Keywords

Search

Navigation