Properties of the central points in linear programming problems

DOI10.1023/B:NUMA.0000021776.38092.F6MaRDI QIDQ596665zbMATH OpenFDO

Authors Marli Cardia, C. C. Gonzaga

Publication date 10 August 2004

Published in Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

central pathanalytic centerpath following algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Recommendations

• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• On the complexity of following the central path of linear programs by linear extrapolation. II
• General central path and the largest step general central path following algorithm for linear programming
• scientific article; zbMATH DE number 434731
• Analytical properties of the central path at boundary point in linear programming

Cited in

(4)

• On the volumetric path
• Analytic centers and repelling inequalities
• On central-path proximity measures in interior-point methods
• Generalization: One technique of computational and applied mathematical methodology

Describes a project that uses

Uses Software

• ACCPM

This page was built for publication: Properties of the central points in linear programming problems

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