Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems

Philip C. Jones
Philip C. Jones
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60201
Search for more papers by this author
,
Earl S. Marwil
Earl S. Marwil
EG&G Idaho, Inc., P.O. Box 1625, Idaho Falls, Idaho 83415
Search for more papers by this author

Philip C. Jones

Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60201

Search for more papers by this author

Earl S. Marwil

EG&G Idaho, Inc., P.O. Box 1625, Idaho Falls, Idaho 83415

Search for more papers by this author

Published Online:1 May 1982https://doi.org/10.1287/moor.7.2.245

Abstract

A technique for dimensional reduction is combined with the ellipsoid algorithm and another acceleration technique lo solve linear programming problems. The new method yields exact rather than approximate solutions and provides a natural procedure for determining infeasibility.

cover image Mathematics of Operations Research

Volume 7, Issue 2

May 1982

Pages 159-318

Article Information

Metrics

Information

Published Online:May 01, 1982

Cite as

Philip C. Jones, Earl S. Marwil, (1982) Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems. Mathematics of Operations Research 7(2):245-252.

https://doi.org/10.1287/moor.7.2.245

Keywords

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems

Abstract

Volume 7, Issue 2

Article Information

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News