Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm
Includes bibliographical references.
Other Authors: | Freund, Robert Michael. |
---|---|
Language: | eng |
Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992.
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2428 |
Similar Items
-
Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables
Published: (2003) -
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
Published: (2003) -
Implementation and combined empirical study of combined Phase I-Phase II potential reduction algorithm for linear programming
Published: (2003) -
A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"
Published: (2003) -
Diagnosing infeasibilities in network flow problems
Published: (2003)