A polynomial projection algorithm for linear feasibility problems
- 548 Downloads
We propose a polynomial algorithm for linear feasibility problems. The algorithm represents a linear problem in the form of a system of linear equations and non-negativity constraints. Then it uses a procedure which either finds a solution for the respective homogeneous system or provides the information based on which the algorithm rescales the homogeneous system so that its feasible solutions in the unit cube get closer to the vector of all ones. In a polynomial number of calls to the procedure the algorithm either proves that the original system is infeasible or finds a solution in the relative interior of the feasible set.
KeywordsLinear programming Systems of linear inequalities Polynomial algorithm
Mathematics Subject Classification90C05 Linear programming
I wish to thank two anonymous referees and Kees Roos (the Delft University of Technology) for their detailed comments and for suggesting several important improvements. This work is supported by the DFG (Deutsche Forschungsgemeinschaft) research grant CH 1133/1-1.
- 1.Agmon, Sh.: The relaxation method for linear inequalities. Can. J. Math. 6, 382–392 (1954)Google Scholar
- 3.Dantzig, G.: An \(\varepsilon \)-precise feasible solution to a linear program with a convexity constraint in \(1/\varepsilon ^2\) iterations independent of problem size. Tech. rep. SOL 92–5 (1992)Google Scholar
- 9.Khachiyan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244 (English translation: Soviet Math. Dokl. 20, 191–194) (1979)Google Scholar
- 11.Motzkin, Th., Schoenberg, I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393–404 (1954)Google Scholar
- 13.Roos, C.: Speeding up Chubanov’s method for solving a homogeneous inequality system. Optimization Online, Report 2013–100, TU Delft, NL, September (2013)Google Scholar
- 16.Zhang, Y.: Solving Large-Scale Linear Programs by Interior-point Methods Under the MATLAB Environment. Technical Report TR96-01, Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore, MD (1995)Google Scholar