A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming
From MaRDI portal
Publication:3989817
DOI10.1287/moor.16.4.775zbMath0747.90094OpenAlexW2153740610MaRDI QIDQ3989817
Robert M. Freund, Kok Choon Tan
Publication date: 28 June 1992
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5247
Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem ⋮ A cutting plane algorithm for convex programming that uses analytic centers ⋮ A scaling technique for finding the weighted analytic center of a polytope ⋮ Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
This page was built for publication: A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming
