Solving LP Problems via Weighted Centers

Abstract

The feasibility problem for a system of linear inequalities can be converted into an unconstrained optimization problem using ideas from the ellipsoid method, which can be viewed as a very simple minimization technique for the resulting nonlinear function. Using more sophisticated algorithms, we develop and investigate more eecient methods, which lead to two kinds of weighted centers for the feasible set. With these centers, we develop new algorithms for solving linear programming problems.

DOI: 10.1137/S1052623493254273
Showing 1-10 of 26 references

Algorithms for Linear Programming via Weighted Centers

  • A Liao
  • 1992

Pricing criteria in linear programming

  • J L Nazareth
  • 1989

Handbook for Matrix Computations, SIAM

  • T F Coleman, C V Loan
  • 1988

The method of inscribed ellipsoids

  • S P Tarasov, L G Khachiyan, I I Erlich
  • 1988