Geodesic
Search for normal solutions in linear programming problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 12, pp. 1766-1786 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2000_40_12_a1,
     author = {A. I. Golikov and Yu. G. Evtushenko},
     title = {Search for normal solutions in linear programming problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1766--1786},
     year = {2000},
     volume = {40},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_12_a1/}
}
TY  - JOUR
AU  - A. I. Golikov
AU  - Yu. G. Evtushenko
TI  - Search for normal solutions in linear programming problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2000
SP  - 1766
EP  - 1786
VL  - 40
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_12_a1/
LA  - ru
ID  - ZVMMF_2000_40_12_a1
ER  - 
%0 Journal Article
%A A. I. Golikov
%A Yu. G. Evtushenko
%T Search for normal solutions in linear programming problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2000
%P 1766-1786
%V 40
%N 12
%U http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_12_a1/
%G ru
%F ZVMMF_2000_40_12_a1
A. I. Golikov; Yu. G. Evtushenko. Search for normal solutions in linear programming problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 12, pp. 1766-1786. http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_12_a1/

[1] Vasilev F. P., Ivanitskii A. Yu., Lineinoe programmirovanie, Faktorial, M., 1998 | MR

[2] Eremin I. I., Teoriya lineinoi optimizatsii, UrO RAN, Ekaterinburg, 1998

[3] Dikin I. I., “Iterativnoe reshenie zadach lineinogo i kvadratichnogo programmirovaniya”, Dokl. AN SSSR, 174:4 (1967), 745–747 | MR

[4] Evtushenko Yu. G., Zhadan V. G., “Chislennye metody resheniya nekotorykh zadach issledovaniya operatsii”, Zh. vychisl. matem. i matem. fiz., 13:3 (1973), 583–597

[5] Evtushenko Yu. G., “Dva chislennykh metoda resheniya zadach nelineinogo programmirovaniya”, Dokl. AN SSSR, 215:1 (1974), 38–40 | MR | Zbl

[6] Evtushenko Yu. G., Zhadan V. G., “Relaksatsionnyi metod resheniya zadach nelineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 17:4 (1977), 890–904 | MR | Zbl

[7] Karmarcar N., “A new polinomial-time algorithm for linear programming”, Combinatorica, 4 (1984), 373–395 | DOI | MR

[8] Roos C., Terlaky T., Vial J.-Ph., Theory and algorithms for linear optimization. An interior point approach, John Wiley Sons, Chichester, 1997 | MR

[9] Evtushenko Yu. G., Zhadan V. G., Barerno-proektivnye i barerno-nyutonovskie chislennye metody optimizatsii (sluchai lineinogo programmirovaniya), VTs RAN, M., 1992

[10] Evtushenko Yu. G., Moretti A., Zhadan V. G., “Newton's steepest descent for linear programming”, Dynamics Non-Homogeneous Systems, Proc. ISA RAS, v. 2, Editorial URSS, ML, 1999, 86–108

[11] “Special issue on interior point methods”, Optimizat. Methods and Software, 11:1–4 (1999) | MR

[12] Evtushenko Yu. G., Zhadan V. G., “Space-transformation technique: the state of the art”, Nonlinear Optimizat. and Applic., Plenum Press, New York–London, 1996, 101–123 | Zbl

[13] Vilchevskii N. O., “O vybore koeffitsienta shtrafa v zadachakh lineinogo programmirovaniya”, Avtomat. i telemekhan., 1970, no. 4, 121–126 | MR

[14] Kutanov A. T., “Ob utochnenii resheniya zadachi lineinogo programmirovaniya v metode shtrafnykh funktsii”, Avtomat. i telemekhan., 1970, no. 4, 127–132

[15] Propoi A. I., Yadykin A. B., “Parametricheskoe kvadratichnoe programmirovanie i lineinoe programmirovanie. I”, Avtomat. i telemekhan., 1978, no. 2, 102–112 ; II No 4, 135–143 | MR

[16] Razumikhin B. C., Fizicheskie modeli i metody teorii ravnovesiya v programmirovanii i ekonomike, Nauka, M., 1975 | MR

[17] Razumikhin B. C., “O dvukh metodakh uslovnoi optimizatsii. II. Metod godografa dlya zadach lineinogo programmirovaniya”, Modeli i metody optimizatsii, Tr. VNIISI, 3, M., 1980, 37–53

[18] Rapoport L. B., “Modifitsirovannyi metod godografa dlya zadach lineinogo programmirovaniya”, Modeli i metody optimizatsii, Tr. VNIISI, 3, M., 1980, 82–93

[19] Chebotarev S. P., “Ob izmenenii koeffitsienta shtrafa v zadachakh lineinogo programmirovaniya”, Avtomat. i telemekhan., 1974, no. 3, 102–107

[20] Yadykin A. B., “O parametrizatsii v vyrozhdennykh zadachakh kvadratichnogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 17:3 (1977), 634–648 | MR | Zbl

[21] Mangasarian O. L., Meyer R. R., “Nonlinear perturbation of linear programs”, SIAM J. Control and Optimizat., 17:6 (1979), 745–752 | DOI | MR | Zbl

[22] Mangasarian O. L., “Normal solutions of linear programs”, Math. Program. Study, 22 (1984), 206–216 | MR | Zbl

[23] Mangasarian O. L., “Least-norm linear programming solution as an unconstrained minimization problem”, J. Math. Analysis and Applic., 92 (1983), 240–251 | DOI | MR | Zbl

[24] Tikhonov A. N., Arsenin V. Ya., Metody resheniya nekorrektnykh zadach, Nauka, M., 1979 | MR

[25] Polyak B. T., Vvedenie v optimizatsiyu, Nauka, M., 1983 | MR

[26] Fiakko A., Mak-Kormik G., Nelineinoe programmirovanie. Metody posledovatelnoi bezuslovnoi minimizatsii, Mir, M., 1972 | MR | Zbl

[27] Errou K. Dzh., Gurvits L., Udzava X., “Iteratsionnye metody vognutogo programmirovaniya”, Issledovaniya po lineinomu i nelineinomu programmirovaniyu, Izd-vo inostr. lit., M., 1962, 228–245

[28] Eremin I. I., Astafev N. N., Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya, Nauka, M., 1976 | MR

[29] Mangasarian O. L., Nonlinear programming, McCrow-Hill, New York, 1969 | MR