Skip to main content

Advertisement

Log in

On the Curvature of the Central Path of Linear Programming Theory

  • Published:
Foundations of Computational Mathematics Aims and scope Submit manuscript

Abstract

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.

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

Access this article

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.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Jean-Pierre Dedieu, Gregorio Malajovich or Mike Shub.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dedieu, JP., Malajovich, G. & Shub, M. On the Curvature of the Central Path of Linear Programming Theory. Found Comput Math 5, 145–171 (2005). https://doi.org/10.1007/s10208-003-0116-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10208-003-0116-8