A posteriori error bounds in linear programming aggregation

Computers and Operations Research

Volumn 24, Issue 1, 1997, Pages 1-16

  Leisten, Rainer ^a  

^a UNIVERSITY OF GREIFSWALD   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ERRORS; ESTIMATION; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

AGGREGATION ERROR; DEGREE OF SUBOPTIMALITY; LARGE SCALE PLANNING PROBLEMS; LINEAR PROGRAMMING AGGREGATION; VARIABLE AGGREGATED LINEAR PROGRAMS;

LINEAR PROGRAMMING;

EID: 0030782883     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00034-2     Document Type: Article

References (21)

1. Rogers, D. F., Plante, R. D., Wong, R. T. and Evans, J. R., Aggregation and disaggregation techniques and methodology in optimization. Ops Res., 1991, 39, 553-582.
2. Zipkin, P. H., Aggregation in linear programming. Ph.D. thesis, Yale, 1977.
3. Zipkin, P. H., Bounds on the effect of aggregating variables in linear programs. Ops Res, 1980, 28, 403-418.
4. Fisher, W. D., Clustering and Aggregation in Economics. The John Hopkins Press, Baltimore, 1969.
5. Vakhutinsky, I. Y., Dudkin, L. M. and Ryvkin, A. A., Iterative aggregation - a new approach to the solution of large-scale problems. Econometrica, 1979, 47, 821-841.
6. Liesegang, D. G., Aggregation bei linearen Optimierungsmodellen. Habilitationsschrift, Universität zu Köln, Cologne, 1980.
7. Dudkin, L. M., Rabinovich, I. and Vakhutinsky, I., Iterative Aggregation Theory. Marcel Dekker, New York-Basel, 1987.
8. Zipkin, P. H., Bounds for row-aggregation in linear programming. Ops Res., 1980, 28, 903-916.
9. Mendelssohn, R., Improved Bounds for Aggregated Linear Programs. Ops Res., 1980, 28, 1450-1453.
10. Taylor, R. W., Aggregate programming in large scale linear systems. Ph.D. Dissertation, Georgia Institute of Technology, Atlanta, 1983.
11. Knolmayer, G., Computing a Tight A Posteriori Bound for Column Aggregated Linear Programs. Methods Ops Res. , 1986, 53, 103-114.
12. Stuhr, K.-P., Experimentelle Untersuchungen zur Abschätzung des maximalen Aggregationsfehlers in linearen Programmen. VVF, München, 1987.
13. Knolmayer, G. and Stuhr, K.-P., Bounds on the aggregation error in case of primal degeneracy. In Ops Res. Proc. 1989. Springer, Berlin - Heidelberg, 1990.
14. Vlach, M., On Aggregation of Variables in Linear Programming. In Advances in Mathematical Optimization eds J. Guddat et al. Akademie-Verlag, Berlin, 1988, pp. 227-232.
15. Litvinchev, I. S., Bounds on the suboptimalization of aggregation in convex programming. Comp. Maths Math. Phys., 1993, 33, 1007-1015.
16. R. Leisten, Iterative Aggregation und mehrstufige Entscheidungsmodelle, Physica-Verlag, Heidelberg (1995).
17. Kallio, M., Computing Bounds for the optimal value in linear programming. Nov. Res. Logist. Q., 1977, 24, 301-308.
18. Shetty, C. M. and Taylor, R. W., Solving large-scale linear programs by aggregation. Comp. Ops Res., 1987, 14, 385-393.
19. Crowder, H., Computational Improvements for Subgradient Optimization. Symp. Math., 1976, 19, 357-372.
20. S. Storøy, Optimal weights and degeneracy in variable aggregated linear programs, unpublished paper, Department of Informatics, University of Bergen, Norway (1994).
21. Jörnsten, K., Leisten, R. and Storøy, S., Gradient schemes in iterative aggregation procedures for variable-aggregated LP-problems. Optimization, 1994, 30, 251-268.