JavaScript is disabled for your browser. Some features of this site may not work without it.
Solving LP Problems Via Weighted Centers

Author
Liao, Aiping; Todd, Michael J.
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 efficient 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.
Date Issued
2003-11-11Publisher
Cornell University
Subject
theory center
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/2003-290
Type
technical report