Geodesic
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. 
@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 },
     publisher = {mathdoc},
     volume = {11},
     number = {1},
     year = {2001},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2001_11_1_a2/}
}
TY  - JOUR
AU  - Nebojša V. Stojković
TI  - On Finite Termination in the Primal-Dual Method for Linear Programming
JO  - Yugoslav journal of operations research
PY  - 2001
SP  - 31 
VL  - 11
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2001_11_1_a2/
LA  - en
ID  - YJOR_2001_11_1_a2
ER  - 
%0 Journal Article
%A Nebojša V. Stojković
%T On Finite Termination in the Primal-Dual Method for Linear Programming
%J Yugoslav journal of operations research
%D 2001
%P 31 
%V 11
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2001_11_1_a2/
%G en
%F YJOR_2001_11_1_a2
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/