On the curvature of the central path of linear programming theory

In this paper we study the curvature of the central path of linear programming
theory. Our ultimate goal is to show that the total curvature of the path is poly-nomial
in m and n the numbers of linear constraints and variables respectively.

By: Jean-Pierre Dedieu, Michael Shub

Published in: RC22772 in 2003


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .