Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
From MaRDI portal
Publication:4018156
DOI10.1287/ijoc.1.3.159zbMath0753.90040OpenAlexW2083214473MaRDI QIDQ4018156
Janet R. Donaldson, Christoph Witzgall, Paul D. Domich, Paul T. Boggs
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1.3.159
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, An interior point method for general large-scale quadratic programming problems, On the complexity of following the central path of linear programs by linear extrapolation. II, Euclidean centers: Computation, properties and a MOLP application, Interval judgments and Euclidean centers, Weighted Euclidean centers, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, Solving symmetric indefinite systems in an interior-point method for linear programming
