Mathematical Programming

, Volume 153, Issue 2, pp 687–713

# A polynomial projection algorithm for linear feasibility problems

Full Length Paper Series A

## Abstract

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.

## Keywords

Linear programming Systems of linear inequalities Polynomial algorithm

## Mathematics Subject Classification

90C05 Linear programming

## Notes

### Acknowledgments

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.

## References

1. 1.
Agmon, Sh.: The relaxation method for linear inequalities. Can. J. Math. 6, 382–392 (1954)Google Scholar
2. 2.
Chubanov, S.: A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134, 533–570 (2012)
3. 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
4. 4.
Edmonds, J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Stand. 71 B, 241–245 (1967)
5. 5.
Goffin, J.L.: The relaxation method for solving systems of linear inequalities. Math. Oper. Res. 5, 388–414 (1980)
6. 6.
Goffin, J.L.: On the non-polynomiality of the relaxation method for systems of linear inequalities. Math. Program. 22, 93–103 (1982)
7. 7.
Hager, W.W.: Updating the inverse of a matrix. SIAM Rev. 31, 221–239 (1989)
8. 8.
Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 353–395 (1984)
9. 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
10. 10.
Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575–601 (1992)
11. 11.
Motzkin, Th., Schoenberg, I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393–404 (1954)Google Scholar
12. 12.
Renegar, J.: A polynomial-time algorithm, based on Newton’s method, for linear programming. Math. Program. 40, 59–93 (1988)
13. 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
14. 14.
Stiemke, E.: Über positive Lösungen homogener linearer Gleichungen. Math. Ann. 76, 340–342 (1915)
15. 15.
Todd, M.: The many facets of linear programming. Math. Program. 91, 417–436 (2002)
16. 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