Opposite problems and dual regularization in linear programming
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 14 (2008) no. 2, pp. 16-22
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
For problems of linear programming, matrix games, and Chebyshev's measures of systems of affine functions, we set opposite problems (in the same classes). We propose to analyze them jointly, using the duality.
[1] Eremin I. I., Teoriya lineinoi optimizatsii, Izd-vo “Ekaterinburg”, Ekaterinburg, 1999
[2] G. Kun, A. Takker (red.), Lineinye neravenstva i smezhnye voprosy, IL, M., 1959
[3] Chernikov S. N., Lineinye neravenstva, Nauka, M., 1968 | MR | Zbl
[4] Rokafellar R., Vypuklyi analiz, Mir, M., 1973
[5] Khorn R., Matrichnyi analiz, Mir, M., 1989 | MR
[6] Astafev N. N., Lineinye neravenstva i vypuklost, Nauka, M., 1982 | MR