A note on the structure of the central path in linear programming

MaRDI QIDQ3009582zbMATH OpenFDO

Authors J. N. Singh, Prabhat Kumar

Publication date 24 June 2011

Full work available at URL http://www.m-hikari.com/ams/ams-2010/ams-45-48-2010/index.html

zbMATH Keywords

layerscrossover events

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the curvature of the central path of linear programming theory
• A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
• scientific article; zbMATH DE number 4199964
• Two simple proofs for analyticity of the central path in linear programming.
• scientific article; zbMATH DE number 409894

Cited in

(1)

• Two simple proofs for analyticity of the central path in linear programming.

This page was built for publication: A note on the structure of the central path in linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009582)