Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems

DOI10.1287/MOOR.7.2.245MaRDI QIDQ4739663zbMATH OpenOpenAlexFDO

Authors Philip C. Jones, Earl S. Marwil

Publication date 1982

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.7.2.245

zbMATH Keywords

binding constraintcomplementary slacknessdimensional reduction procedureellipsoid algorithmlinear complementarity problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cited in

(2)

• The ellipsoid method in linear programming
• The ellipsoid method and its implications

This page was built for publication: Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems

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