Geodesic
A New Exterior Point Algorithm for Linear Programming Problems
Yugoslav journal of operations research, Tome 4 (1994) no. 2, p. 137 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

We present a simplex type algorithm for the linear programming problem min ${ c^T : A \cdot x = b, x \geq 0 }$. It solves a sequence of problems of increasing dimension. The path generated by the algorithm contains basic solutions that are neither primal nor dual feasible. Results from an elementary computational study are also presented.
Keywords: Simplex method, linear programming, pivoting, exterior point algorithms 
@article{YJOR_1994_4_2_a0,
     author = {Konstantinos Dosios and Konstantinos Paparrizos},
     title = {A {New} {Exterior} {Point} {Algorithm} for {Linear} {Programming} {Problems}},
     journal = {Yugoslav journal of operations research},
     pages = {137 },
     year = {1994},
     volume = {4},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_1994_4_2_a0/}
}
TY  - JOUR
AU  - Konstantinos Dosios
AU  - Konstantinos Paparrizos
TI  - A New Exterior Point Algorithm for Linear Programming Problems
JO  - Yugoslav journal of operations research
PY  - 1994
SP  - 137 
VL  - 4
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/YJOR_1994_4_2_a0/
LA  - en
ID  - YJOR_1994_4_2_a0
ER  - 
%0 Journal Article
%A Konstantinos Dosios
%A Konstantinos Paparrizos
%T A New Exterior Point Algorithm for Linear Programming Problems
%J Yugoslav journal of operations research
%D 1994
%P 137 
%V 4
%N 2
%U http://geodesic.mathdoc.fr/item/YJOR_1994_4_2_a0/
%G en
%F YJOR_1994_4_2_a0
Konstantinos Dosios; Konstantinos Paparrizos. A New Exterior Point Algorithm for Linear Programming Problems. Yugoslav journal of operations research, Tome 4 (1994) no. 2, p. 137 . http://geodesic.mathdoc.fr/item/YJOR_1994_4_2_a0/