<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>The paper proposes a method for solving systems of linear inequalities. This method determines in a finite number of iterations whether the given system of linear ineqalities has a solution. If it does, the solution for the given system of linear inequalities is provided. The computational complexity of the proposed method is locally polynomial.</p>
</abstract>

The paper proposes a method for solving systems of linear inequalities. This method determines in a finite number of iterations whether the given system of linear ineqalities has a solution. If it does, the solution for the given system of linear inequalities is provided. The computational complexity of the proposed method is locally polynomial.

A locally polynomial method for solving a system of linear inequalities

Siedlce University of Natural Sciences and Humanities

Control and Cybernetics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"A locally polynomial method for solving a system of linear inequalities"}

The paper proposes a method for solving systems of linear inequalities. This method determines in a finite number of iterations whether the given system of...

A locally polynomial method for solving a system of linear inequalities

Publié en ligne: 28 juin 2022

Pages: 301 - 314

Reçu: 01 avr. 2021

Accepté: 01 juin 2021

DOI: https://doi.org/10.2478/candc-2021-0015

Mots clés
linear programming, system of linear inequalities, computational complexity, locally-polynomial algorithm, convergence rate

© 2021 Yuri Evtushenko et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

A locally polynomial method for solving a system of linear inequalities

Publié en ligne: 28 juin 2022

Pages: 301 - 314

Reçu: 01 avr. 2021

Accepté: 01 juin 2021

DOI: https://doi.org/10.2478/candc-2021-0015

Mots cléslinear programming, system of linear inequalities, computational complexity, locally-polynomial algorithm, convergence rate

© 2021 Yuri Evtushenko et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
linear programming, system of linear inequalities, computational complexity, locally-polynomial algorithm, convergence rate