<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Ever since the onset of algorithms for determining the optimal solution or solutions for a linear programming problem (LPP), the question of the possibility of occurrence of cycling when one or other of these algorithms are applied was born. Thus, the fundamental question regarding this issue is under what conditions the cyclic phenomenon appears for a problem of linear programming and how to construct examples in which to do so, and as a continuation of it, which methods can be developed to avoid this phenomenon. In this study we will present some aspects regarding this issue starting from the primal simplex algorithm, by highlighting some general aspects that occur when this phenomenon happens</p></abstract>

Ever since the onset of algorithms for determining the optimal solution or solutions for a linear programming problem (LPP), the question of the possibility of occurrence of cycling when one or other of these algorithms are applied was born. Thus, the fundamental question regarding this issue is under what conditions the cyclic phenomenon appears for a problem of linear programming and how to construct examples in which to do so, and as a continuation of it, which methods can be developed to avoid this phenomenon. In this study we will present some aspects regarding this issue starting from the primal simplex algorithm, by highlighting some general aspects that occur when this phenomenon happens

Considerations on Cycling in the Case of Linear Programming Problem (Lpp)

International conference KNOWLEDGE-BASED ORGANIZATION

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

{"article-title":"Considerations on Cycling in the Case of Linear Programming Problem (Lpp)"}

Ever since the onset of algorithms for determining the optimal solution or solutions for a linear programming problem (LPP), the question of the possibility of...

Considerations on Cycling in the Case of Linear Programming Problem (Lpp)

Online veröffentlicht: 26. Juli 2018

Seitenbereich: 14 - 19

DOI: https://doi.org/10.1515/kbo-2018-0130

Schlüsselwörter
linear programming problem (LPP), simplex algorithm, cycling, basic solution, degenerated base solution

© 2018 Vasile Carutasu, published by Sciendo

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

Considerations on Cycling in the Case of Linear Programming Problem (Lpp)

Online veröffentlicht: 26. Juli 2018

Seitenbereich: 14 - 19

DOI: https://doi.org/10.1515/kbo-2018-0130

Schlüsselwörterlinear programming problem (LPP), simplex algorithm, cycling, basic solution, degenerated base solution

© 2018 Vasile Carutasu, published by Sciendo

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

Schlüsselwörter
linear programming problem (LPP), simplex algorithm, cycling, basic solution, degenerated base solution