On Finite Termination in the Primal-Dual Method for Linear Programming
Yugoslav journal of operations research, Tome 11 (2001) no. 1, p. 31
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper we propose a modification of the finite termination algorithm
which reduces the dimension of the primal-dual linear programming problem. We note
that the similar approach is possible in any primal-dual algorithm for linear
programming.
Keywords:
Linear programming, interior-point methods, finite termination algorithm.
Nebojša V. Stojković. On Finite Termination in the Primal-Dual Method for Linear Programming. Yugoslav journal of operations research, Tome 11 (2001) no. 1, p. 31 . http://geodesic.mathdoc.fr/item/YJOR_2001_11_1_a2/
@article{YJOR_2001_11_1_a2,
author = {Neboj\v{s}a V. Stojkovi\'c},
title = {On {Finite} {Termination} in the {Primal-Dual} {Method} for {Linear} {Programming}},
journal = {Yugoslav journal of operations research},
pages = {31 },
year = {2001},
volume = {11},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2001_11_1_a2/}
}