Geodesic
New algorithms for solving linear programming problems with a special structure
Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 1, pp. 78-98.

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

@article{DA_2002_9_1_a4,
     author = {M. V. Pudova},
     title = {New algorithms for solving linear programming problems with a special structure},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {78--98},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2002_9_1_a4/}
}
TY  - JOUR
AU  - M. V. Pudova
TI  - New algorithms for solving linear programming problems with a special structure
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2002
SP  - 78
EP  - 98
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2002_9_1_a4/
LA  - ru
ID  - DA_2002_9_1_a4
ER  - 
%0 Journal Article
%A M. V. Pudova
%T New algorithms for solving linear programming problems with a special structure
%J Diskretnyj analiz i issledovanie operacij
%D 2002
%P 78-98
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2002_9_1_a4/
%G ru
%F DA_2002_9_1_a4
M. V. Pudova. New algorithms for solving linear programming problems with a special structure. Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 1, pp. 78-98. http://geodesic.mathdoc.fr/item/DA_2002_9_1_a4/

[1] Antsyz S. M., Pudova M. V., Metody vnutrennei tochki dlya resheniya zadach so spetsialnoi strukturoi, Novosibirsk, 1997, 27 pp.; | Zbl

[2] Ashepkov L. T., Belov B. I., Bulatov V. P., Metody resheniya zadach matematicheskogo programmirovaniya i optimalnogo upravleniya, Nauka, Novosibirsk, 1984

[3] Voevodin V. V., Chislennye metody algebry: Teoriya i algorifmy, Nauka, M., 1966 | MR | Zbl

[4] Dantsig Dzh., Lineinoe programmirovanie, ego primenenie i obobscheniya, Progress, M., 1966

[5] Dikin I. I., Zorkaltsev V. I., Iterativnoe reshenie zadach matematicheskogo programmirovaniya, Nauka, Novosibirsk, 1980 | MR | Zbl

[6] Dikin I. I., Popova O. M., Issledovanie i uskorenie skhodimosti algoritmov metoda vnutrennikh tochek, Nauka, Novosibirsk, 1997

[7] Zvyagina R. A., “Programma realizatsii na M-20 modifitsirovannogo simpleks-metoda s uzkoblochnoi matritsei”, Optimalnoe planirovanie, Sb. nauch. tr., no. 4, In-t matematiki SO AN SSSR, Novosibirsk, 1966, 63–124

[8] Kornai I., Liptak T., “Planirovanie na dvukh urovnyakh”, Primenenie matematiki v ekonomicheskikh issledovaniyakh, 3, Mysl, M., 1965 | MR

[9] Lesdon L. S., Optimizatsiya bolshikh sistem, Nauka, M., 1975 | MR

[10] Rubinshtein G. Sh., “O reshenii zadach lineinogo programmirovaniya bolshogo ob'ema”, Optimalnoe planirovanie, Sb. nauch. tr., no. 2, In-t matematiki SO AN SSSR, Novosibirsk, 1964, 3–22 | MR

[11] Tsurkov V. I., Dekompozitsiya v zadachakh bolshoi razmernosti, Nauka, M., 1981 | MR

[12] Shmyrev V. I., “Kontrol iskhodnykh dannykh dlya programmy, realizuyuschei modifitsirovannyi simpleks-metod s uzkoblochnoi matritsei”, Optimalnoe planirovanie, Sb. nauch. tr., no. 4, In-t matematiki SO AN SSSR, Novosibirsk, 1966, 125–136

[13] Adler I., Resende M. G., Veiga G., Karmarkar N., “An implementation of Karmarkar's algorithm for linear programming”, Math. Program., 44:3 (1984), 297–337 | DOI

[14] Bernes E. K., “A variation on Karmarkar's algorithm for solving programming problems”, Math. Program., 36:2 (1986), 174–182 | DOI | MR

[15] Choi I. C., Goldfarb D., “Exploiting special structure in a primal-dual pathfollowing algorithm”, Math. Program., 58:2 (1993), 33–53 | DOI | MR

[16] Karmarkar N., “A new polynomial-time algorithm for linear programming”, Combinatorica, 4:4 (1984), 373–395 | DOI | MR | Zbl

[17] Rinaldi G., “A projective method for linear programming with box-type constrains”, Algorithmica, 1:4 (1986), 517–527 | DOI | MR | Zbl

[18] Todd M. J., “Exploiting special structure in Karmarkar's linear programming algorithm”, Math. Program., 41:1 (1988), 97–113 | DOI | MR | Zbl

[19] Vanderbei R. J., Carpenter I. J., “Symmetric indefinite systems for interior point methods”, Math. Program., 58:1 (1993), 1–33 | DOI | MR