Add to ORKGIncludes bibliographical references (p. 16-17).Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by Draper Laboratory.Dimitris Bertsimas and Xiaodong Luo
SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(CU-DAMTP-NA--12/1991) / BL...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
AbstractIn this note we show that a simple modification of Ye's “affinely scaled potential reduction...
There are several classes of interior point algorithms that solve linear programming problems in O(V...
Potential reduction algorithms have a distinguished role in the area of in-terior point methods for ...
An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear Programmin
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programmin
This paper develops a potential reduction algorithm for solving a linear-programming problem directl...
We describe a steepest-descent potential reduction method for linear and convex minimization over a ...
Combining phase I and phase II in a potential reduction algorithm for linear programmin
A potential reduction algorithm with user specified Phase I - Phase II balance for solving a linear ...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
We propose a polynomial time primaldual potential reduction algorithm for linear pro gramming The a...
We provide a survey of interior-point methods for linear programming and its extensions that are bas...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(CU-DAMTP-NA--12/1991) / BL...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
AbstractIn this note we show that a simple modification of Ye's “affinely scaled potential reduction...
There are several classes of interior point algorithms that solve linear programming problems in O(V...
Potential reduction algorithms have a distinguished role in the area of in-terior point methods for ...
An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear Programmin
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programmin
This paper develops a potential reduction algorithm for solving a linear-programming problem directl...
We describe a steepest-descent potential reduction method for linear and convex minimization over a ...
Combining phase I and phase II in a potential reduction algorithm for linear programmin
A potential reduction algorithm with user specified Phase I - Phase II balance for solving a linear ...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
We propose a polynomial time primaldual potential reduction algorithm for linear pro gramming The a...
We provide a survey of interior-point methods for linear programming and its extensions that are bas...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(CU-DAMTP-NA--12/1991) / BL...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
AbstractIn this note we show that a simple modification of Ye's “affinely scaled potential reduction...