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
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
[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