Skip to main content
SpringerLink
Log in

Advanced basis construction in linear programming

  • II. Mathematical Programming
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers basis construction in a linear program when the number of activities with basic status is not equal to the number of rows in the particular scenario. This arises when starting with an ‘advanced basis’, obtained from a solution to another scenario. The goal here is to provide a triangular-seeking algorithm that takes advantage of structural properties during the construction of a basis agenda. For completeness, some facts, which are known but have not been published, are given about choosing an advanced basis and about spikes.

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

Similar content being viewed by others

References

  1. K. Darby-Dowman and G. Mitra, An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion, 10th Int. Symp. on Mathematical Programming, Montreal, Canada (1979).

  2. I.S. Duff, On permutations to block triangular form, J. Inst. Maths. Applics. 19(1977)339.

    Article  Google Scholar 

  3. J.J.H. Forrest and J.A. Tomlin, Updating triangular factors of the basis to maintain sparsity in the product form simplex method, Math. Progr. 2(1972)263.

    Article  Google Scholar 

  4. H.J. Greenberg and D.C. Rarick, Determining GUB sets via an invert agenda algorithm, Math. Progr. 7(1977)240.

    Article  Google Scholar 

  5. E. Hellerman and D.C. Rarick, Reinversion with the pre-assigned pivot procedure, Math. Progr. 1(1971)195.

    Article  Google Scholar 

  6. E. Hellerman and D.C. Rarick, The partitioned pre-assigned pivot procedure (P4), in:Sparse Matrices and Their Applications, ed. D.J. Rose and R.A. Willoughby (Plenum Press, New York, 1972) p. 65.

    Google Scholar 

  7. J.E. Hopcroft and R.M. Karp, An n5/2 algorithm for maximum matchings in bipartite graphs, Siam J. Comput. 2(1973)225.

    Article  Google Scholar 

  8. J.E. Kalen, Aspects of large-scale in-core linear programming,Proc. 1971 Ann. Conf. (ACM, New York, 1971) p. 304.

    Chapter  Google Scholar 

  9. R.D. McBride, A spike collective dynamic factorization algorithm for the simplex method, Mgt. Sci. 24(1978)1031.

    Article  Google Scholar 

  10. R.D. McBride, A bump triangular dynamic factorization algorithm for the simplex method, USC Working Paper No. 19, Los Angeles, California (1977).

  11. W. Orchard-Hays,Advanced Computing Techniques in Linear Programming (McGraw-Hill, New York, 1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, University of Colorado at Denver, Campus Box 170, 80202, Denver, Colorado, USA

    H. J. Greenberg

Authors
  1. H. J. Greenberg
    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. Advanced basis construction in linear programming. Ann Oper Res 5, 413–424 (1986). https://doi.org/10.1007/BF02739231

Download citation

  • Issue Date:

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

Keywords and phrases

Search

Navigation