Prikl. Diskr. Mat., 2018, Number 41, Pages 110–125
Computational Methods in Discrete Mathematics
Method for sequential activation of limitations in linear programming
V. S. Kolosov
In this paper, we present an algorithm for solving a problem in linear programming by means of procedure of sequential activation of limitations (inclusions in calculation are made one after another) with retention of the optimality status in the generated sequence of nested polyhedrons. Due to compression of the admissible solutions area, the objective function decreases on each step at the “max” criterion of an optimality (the movement to a maximum “from above”) contrary to its growth in other methods (“from below”). Geometrically, the motion to the maximum starts from the trivially determined starting point and continues along the broken line outside of the polytope of admissible solutions. In the theoretical justification of the algorithm, the signs for the incompatibility of the system of conditions in the problem, for the uniqueness and nonuniqueness of the solution, and for its unboundedness are formulated and proved. Computer experiments demonstrate the advantages of the program implementation of this algorithm in speed and completeness of the output information over the simplex-method option of the MATLAB's library linprog program.
linear programming, activation of limitation, MATLAB, computer experiment.
PDF file (727 kB)
V. S. Kolosov, “Method for sequential activation of limitations in linear programming”, Prikl. Diskr. Mat., 2018, no. 41, 110–125
Citation in format AMSBIB
\paper Method for sequential activation of limitations in~linear programming
\jour Prikl. Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|