Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm

Gelijkaardige items

• Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables
  Gepubliceerd in: (2003)
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
  Gepubliceerd in: (2003)
• Implementation and combined empirical study of combined Phase I-Phase II potential reduction algorithm for linear programming
  Gepubliceerd in: (2003)
• Diagnosing infeasibilities in network flow problems
  Gepubliceerd in: (2003)
• A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"
  Gepubliceerd in: (2003)