A polynomial projection algorithm for linear feasibility problems

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.

[1]  James Renegar,et al.  A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[2]  Sergei Chubanov.  A strongly polynomial algorithm for linear systems having a binary solution , 2012, Math. Program..

[3]  Michael J. Todd,et al.  The many facets of linear programming , 2002, Math. Program..

[4]  Jean-Louis Goffin,et al.  The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..

[5]  J. Edmonds.  Systems of distinct representatives and linear algebra , 1967 .

[6]  Erich Stiemke.  Über positive Lösungen homogener linearer Gleichungen , 1915 .

[7]  Jean-Louis Goffin,et al.  On the non-polynomiality of the relaxation method for systems of linear inequalities , 1982, Math. Program..

[8]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[9]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[10]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[11]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[12]  Kees Roos.  Speeding up Chubanov ’ s method for solving a homogeneous inequality system , 2013 .

[13]  William W. Hager,et al.  Updating the Inverse of a Matrix , 1989, SIAM Rev..

[14]  Yin Zhang,et al.  Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment † , 1998 .

[15]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[16]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..