|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 2, 2001, Volume 8, Issue 2, Pages 17–26
(Mi da242)
|
|
|
|
Oblique path algorithms for solving linear programming problems
O. N. Voitov, V. I. Zorkal'tsev, A. Yu. Filatov L. A. Melentiev Energy Systems Institute, Siberian Branch of the Russian Academy of Sciences
Abstract:
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.
Received: 17.11.2000
Citation:
O. N. Voitov, V. I. Zorkal'tsev, A. Yu. Filatov, “Oblique path algorithms for solving linear programming problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 8:2 (2001), 17–26
Linking options:
https://www.mathnet.ru/eng/da242 https://www.mathnet.ru/eng/da/v8/s2/i2/p17
|
Statistics & downloads: |
Abstract page: | 308 | Full-text PDF : | 191 |
|