Skip to main content
Springer Nature Link
Log in

Some perturbation theory for linear programming

  • 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. E.J. Anderson and P. Nash,Linear Programming in Infinite Dimensional Spaces: Theory and Applications (Wiley, Chichester, 1987).

    Google Scholar 

  2. R.J. Duffin, “Infinite programs,” in: H.W. Kuhn and A.W. Tucker, eds.,Linear Equalities and Related Systems (Princeton University Press, Princeton, 1956) 157–170.

    Google Scholar 

  3. A.V. Fiacco and K.O. Kortanek, eds.,Semi-Infinite Programming and Applications, Lecture Notes in Economics and Mathematical Systems 215 (Springer-Verlag, New York, 1983).

    Google Scholar 

  4. A.J. Hoffman, “On approximate solutions of systems of linear inequalities,”Journal of Research of the National Bureau of Standards 49 (1952) 263–265.

    Google Scholar 

  5. C. Kallina and A.C. Williams, “Linear programming in reflexive spaces,”SIAM Review 13 (1971) 350–376.

    Google Scholar 

  6. O.L. Mangasarian, “A condition number for linear inequalities and linear programs,” in:Methods of Operations Research (43), Proceedings of the 6th Symposium on Operations Research, Universität Augsburg, G. Bamberg and O. Opitz, eds. (Verlagsgruppe Athenäum/Hain/Scriptor/Hanstein, Konigstein, 1981) 3–15.

    Google Scholar 

  7. O.L. Mangasarian and T.-H. Shiau, “Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems,”SIAM Journal on Control and Optimization 25 (3) (May 1987) 583–595.

    Google Scholar 

  8. J. Renegar, “Incorporating condition measures into the complexity theory of linear programming,” to appear inSIAM Journal on Optimization.

  9. S.M. Robinson, “Bounds for error in the solution set of a perturbed linear program,”Linear Algebra and Its Applications 6 (1973) 69–81.

    Google Scholar 

  10. W. Rudin,Functional Analysis (McGraw-Hill, New York, 1973).

    Google Scholar 

  11. G.W. Stewart and J. Sun,Matrix Perturbation Theory (Academic Press, Boston, 1990).

    Google Scholar 

  12. J. Vera, “Ill-posedness and the computation of solutions to linear programs with approximate data,” preprint, Dept. Ingenieria Industrial, Universidad de Chile, Republica 701, Casilla 2777, Santiago, Chile.

  13. J. Vera, “Ill-posedness and the complexity of deciding existence of solutions to linear programs,” preprint, Dept. Ingenieria Industrial, Universidad de Chile, Republica 701, Casilla 2777, Santiago, Chile.

  14. K. Yosida,Functional Analysis (Springer-Verlag, New York, 1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Operations Research and Industrial Engineering, Cornell University, 14853, Ithaca, New York, USA

    James Renegar

Authors
  1. James Renegar
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research was supported by NSF Grant CCR-9103285 and IBM.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Renegar, J. Some perturbation theory for linear programming. Mathematical Programming 65, 73–91 (1994). https://doi.org/10.1007/BF01581690

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation