Skip to main content
SpringerLink
Log in

Computational complexity of parametric linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

We establish that in the worst case, the computational effort required for solving a parametric linear program is not bounded above by a polynomial in the size of the problem.

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. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).

    Google Scholar 

  2. S.I. Gass,Linear programming: Methods and applications, 4th Edition (McGraw-Hill, New York, 1975).

    Google Scholar 

  3. K.G. Murty,Linear and combinatorial programming (Wiley, New York, 1976).

    Google Scholar 

  4. K.G. Murty, “Computational complexity of complementary pivot methods”,Mathematical Programming Study 7 (1978) 61–73.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Michigan, Ann Arbor, MI, USA

    Katta G. Murty

Authors
  1. Katta G. Murty
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is partially supported by Air Force Office of Scientific Research, Air Force Number AFOSR-78-3646.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Murty, K.G. Computational complexity of parametric linear programming. Mathematical Programming 19, 213–219 (1980). https://doi.org/10.1007/BF01581642

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation