Abstract:
A numerical method combining a gradient technique with the projection onto a linear manifold is proposed for solving systems of linear inequalities. It is shown that the method converges in a finite number of iterations and its running time is estimated as a polynomial in the space dimension and the number of inequalities in the system.
Key words:system of linear inequalities, locally polynomial-time complexity, convergence, convex function.
References