Geodesic
Bounds on the suboptimalization of aggregation in convex programming
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 8, pp. 1145-1154 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1993_33_8_a2,
     author = {I. S. Litvinchev},
     title = {Bounds on the suboptimalization of aggregation in convex programming},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1145--1154},
     year = {1993},
     volume = {33},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_8_a2/}
}
TY  - JOUR
AU  - I. S. Litvinchev
TI  - Bounds on the suboptimalization of aggregation in convex programming
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1993
SP  - 1145
EP  - 1154
VL  - 33
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_8_a2/
LA  - ru
ID  - ZVMMF_1993_33_8_a2
ER  - 
%0 Journal Article
%A I. S. Litvinchev
%T Bounds on the suboptimalization of aggregation in convex programming
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1993
%P 1145-1154
%V 33
%N 8
%U http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_8_a2/
%G ru
%F ZVMMF_1993_33_8_a2
I. S. Litvinchev. Bounds on the suboptimalization of aggregation in convex programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 8, pp. 1145-1154. http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_8_a2/

[1] Rogers D. F., Plante R. D., Wong R. T., Evans J. R., “Aggregation and disaggregation techniques and methodology in optimization”, Operat. Res., 39:4 (1991), 553–582 | DOI | MR

[2] Zipkin P. H., “Bounds on the effect of aggregating variables in linear programs”, Operat. Res., 28:3 (1980), 403–418 | DOI | MR | Zbl

[3] Litvinchev I. S., “Dekompozitsiya v ekstremalnykh zadachakh so spetsialnoi strukturoi”, Zh. vychisl. matem. i matem. fiz., 30:7 (1990), 1008–1016 | MR

[4] Evans J. R., “Aggregation in generalized transportation problem”, Comput. and Operat. Res., 6:4 (1979), 199–204 | DOI