Considerations on Cycling in the Case of Linear Programming Problem (Lpp)-Reference-Cited by-同舟云学术

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

Published:2018-06-01 Issue:3 Volume:24 Page:14-19
ISSN:2451-3113
Container-title:International conference KNOWLEDGE-BASED ORGANIZATION
language:en
Short-container-title:

Author:

Carutasu Vasile¹

Affiliation:

1. ”Nicolae Bălcescu” Land Forces Academy, Sibiu , Romania

Abstract

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

Publisher

Walter de Gruyter GmbH

Subject

General Medicine

Reference7 articles.

1. [1] Dantzig GB., Maximization of a linear function of variables subject to linear inequalities. In: Koopmans TC, editor. Activity analysis of production and allocation, New York, 1951.

2. [2] Gass SI., Comments on the possibility of cycling with the simplex method. Operations Research 1979; 27:848-52.

3. [3] Gass SI, Vinjamuri S., Cycling in linear programming problems. Computers & Operations Research 2004; 31:303-11.

4. [4] Hall JAJ, McKinnon KIM., The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling. Mathematical Programming 2004; 100(1):133-50.

5. [5] Hoffman AJ., Cycling in the simplex algorithm. Report 2974, Washington, DC: National Bureau of Standards: 1953.