Geodesic
Matrix correction of a dual pair of improper linear programming problems with a block structure
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 1, pp. 80-89 
V. I. Erokhin; A. S. Krasnikov. Matrix correction of a dual pair of improper linear programming problems with a block structure. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 1, pp. 80-89. http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a5/
@article{ZVMMF_2008_48_1_a5,
     author = {V. I. Erokhin and A. S. Krasnikov},
     title = {Matrix correction of a~dual pair of improper linear programming problems with a~block structure},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {80--89},
     year = {2008},
     volume = {48},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a5/}
}
TY  - JOUR
AU  - V. I. Erokhin
AU  - A. S. Krasnikov
TI  - Matrix correction of a dual pair of improper linear programming problems with a block structure
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2008
SP  - 80
EP  - 89
VL  - 48
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a5/
LA  - ru
ID  - ZVMMF_2008_48_1_a5
ER  - 
%0 Journal Article
%A V. I. Erokhin
%A A. S. Krasnikov
%T Matrix correction of a dual pair of improper linear programming problems with a block structure
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2008
%P 80-89
%V 48
%N 1
%U http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_1_a5/
%G ru
%F ZVMMF_2008_48_1_a5

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

The following problem is considered: how to modify the coefficient matrix of a dual pair of improper linear programs with a block structure so as to make these problems proper and minimize the sum of the squares of the Euclidean norms of the blocks in the correction matrix? Two variants of this problem are examined: (1) all the blocks in the coefficient matrix are modified, and (2) the upper block, which constraints all the primal variables, is left unchanged. Methods are presented for reducing these problems to minimizing quadratic fractional functions subject to linear equality and inequality constraints. The latter problem allows the use of conventional methods for constrained minimization. A numerical example is given.

[1] Eremin I. I., Mazurov V. D., Astafev H. H., Nesobstvennye zadachi lineinogo i vypuklogo programmirovaniya, Nauka, M., 1983 | MR

[2] Vasilev F. P., Ivanitskii A. Yu., Lineinoe programmirovanie, Faktorial Press, M., 2003 | MR

[3] Gorelik V. A., “Matrichnaya korrektsiya zadachi lineinogo programmirovaniya s nesovmestnoi sistemoi ogranichenii”, Zh. vychisl. matem. i matem. fiz., 41:11 (2001), 1697–1705 | MR | Zbl

[4] Gorelik V. I., Erokhin V. I., Pechenkin R. V., “Optimalnaya matrichnaya korrektsiya nesovmestnykh sistem lineinykh algebraicheskikh uravnenii s blochnymi matritsami koeffitsientov”, Diskretnyi analiz i issl. operatsii. Ser. 2, 12:2 (2005), 3–23 | MR

[5] Gorelik V. I., Erokhin V. I., Pechenkin R. V., “Minimaksnaya matrichnaya korrektsiya nesovmestimykh sistem lineinykh algebraicheskikh uravnenii s blochnymi matritsami koeffitsientov”, Izv. RAN. Teoriya i sistemy upravleniya, 2006, no. 5, 52–62 | MR

[6] Erokhin V. I., “Matrichnaya korrektsiya dvoistvennoi pary nesobstvennykh zadach lineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 47:4 (2007), 587–601 | MR | Zbl