Abstract
One common characteristic of many methods for solving multiobjective linear programming problems (particularly the methods for generating the nondominated set and the interactive methods) is that they require the solution of a sequence of single objective linear programming problems. In large scale problems (i.e. problems with many objectives, constraints or variables) this can result in a significant computational burden. This chapter will discuss ways in which the structure of the problem can be used to reduce this computational burden.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barr, R., F. Glover and D. Klingman, “An improved Version of the Out-of-Kilter Method and a Comparative Study of Computer Codes,” Mathematical Programming, 7 (1974), 60–87.
Dial, R., F. Glover, D. Karney and D. Klingman, “A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees,” Networks, 9 (1979), 215–248.
Diaz, J. A., “Solving Multiobjective Transportation Problems,” Ekonomicko-Matematicky Obzor, 14 (1978), 267–274.
Edwards, W., “How to Use Multiattribute Utility Measurement for Social Decision Making,” IEEE Transactions on Systems, Man, and Cybernetics, 7 (1977), 326–340.
Einhorn, H. J. and W. McCoach, “A Simple Multiattribute Utility Procedure for Evaluation,” Behavioral Science, 22 (1977), 270–282.
Glover, F., D. Klingman and A. Napier, “An Effident Dual Approach to Network Problems,” OPSEARCH, 9 (1972), 1–19.
Glover, F., D. Karney and D. Klingman, “Implementation and Computational Comparisons of Primal, Dual, and Primal-Dual Computer Codes for Minimum Cost Network Flow Problems,” Networks, 4 (1974), 191–212.
Glover, F., D. Klingman, J. Mote and D. Whitman, “Comprehensive Computer Evaluation and Enhancement of Maximum Flow Algorithms,” Research Report CCS 360, Center for Cybernetic Studies, The University of Texas at Austin, 1979.
Heller, I. and C. Tompkins, “An Extension of a Theorem of Dantzig’s,” in A. W. Tucker (ed.), Linear Inequalities and Related Systems, Princeton University Press, Princeton, New Jersey, 1956.
Klingman, D. and J. Mote, “Solution Approaches for Network Flow Problems with Multiple Criteria,” Advances in Management Studies, 1 (1982), 1–30.
Reeves, G. R. and L. S. Franz, “A Simplified Interactive Multiple Objective Linear Programming Procedure,” Computers and Operations Research, 12 (1985), 589–601.
Ringuest, J. L. and D. B. Rinks, “Interactive Solutions for the Linear Multiobjective Transportation Problem,” European Journal of Operational Research, 32 (1987), 96–106.
Yu, P. L. and M. Zeleny, “The Set of All Nondominated Solutions in Linear Cases and a Multicriteria Simplex Method,” Journal of Mathematical Analysis and Applications, 49 (1975), 430–468.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ringuest, J.L. (1992). Computational Efficiency and Problems with Special Structure. In: Multiobjective Optimization: Behavioral and Computational Considerations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3612-3_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3612-3_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6605-8
Online ISBN: 978-1-4615-3612-3
eBook Packages: Springer Book Archive