Geodesic
Oblique path algorithms for solving linear programming problems
Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 2, pp. 17-26

Voir la notice de l'article provenant de la source Math-Net.Ru

We present polynomial optimization algorithms in an oblique path cone to solve a linear programming problem. The oblique path that we introduce in this paper is an extension of the concept of the path of analytic centers. We consider prospects for using the algorithms proposed to solve the practical problem of determining admissible modes of operation of electrical power systems. 
@article{DA_2001_8_2_a1,
     author = {O. N. Voitov and V. I. Zorkal'tsev and A. Yu. Filatov},
     title = {Oblique path algorithms for solving linear programming problems},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {17--26},
     publisher = {mathdoc},
     volume = {8},
     number = {2},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2001_8_2_a1/}
}
TY  - JOUR
AU  - O. N. Voitov
AU  - V. I. Zorkal'tsev
AU  - A. Yu. Filatov
TI  - Oblique path algorithms for solving linear programming problems
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2001
SP  - 17
EP  - 26
VL  - 8
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2001_8_2_a1/
LA  - ru
ID  - DA_2001_8_2_a1
ER  - 
%0 Journal Article
%A O. N. Voitov
%A V. I. Zorkal'tsev
%A A. Yu. Filatov
%T Oblique path algorithms for solving linear programming problems
%J Diskretnyj analiz i issledovanie operacij
%D 2001
%P 17-26
%V 8
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2001_8_2_a1/
%G ru
%F DA_2001_8_2_a1
O. N. Voitov; V. I. Zorkal'tsev; A. Yu. Filatov. Oblique path algorithms for solving linear programming problems. Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 2, pp. 17-26. http://geodesic.mathdoc.fr/item/DA_2001_8_2_a1/