Abstract
Chapters 1 and 3 presented multiobjective models for the project selection problem. In multiobjective problems it is not uncommon that solution methodologies produce a large number of nondominated alternatives. The decision maker is then left with the difficult task of choosing from this set. In the prior chapters we noted that methods are available to aid the decision maker with this task. In this chapter we return to this issue and present a detailed technical discussion of five methods for assisting the decision maker in this choice by reducing the set of all nondominated solutions to a manageable number. The last method we present uses stochastic techniques to eliminate solutions which exhibit too much risk, leaving only a potentially small number of solutions with acceptable risk characteristics. In project selection problems risk is often a primary concern. We will return to the discussion of risk in later chapters.
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
Bard, J. F. & Wambsganss, M. (1990). A Matching-based interactive method for MCDM. Proceedings of the International Conference on Multiple Criteria Decision Making, Bangkok, Thailand, 963–978.
Bard, J. F. & Wambsganss, M. (1991) An interactive MCDM procedure using clustering and value function assessment. Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin, Texas.
Friedman, M. & Savage, L.S. (1947). Planning experiments seeking maxima. In C. Wisenhart, M W. Hastay and W. A. Wallis (Ed.) Selected Techniques of Statistical Analysis. New York: Mcgraw-Hill, New York.
Goicoechea, A., Hansen, D. R., & Duckstein, L. (1982). Multiobjective decision analysis with engineering and business applications. New York: John Wiley and Sons.
Keeney, R. L. (1977) The art of assessing multiattribute utility functions. Organizational Behavior and Human Performance, 19, 267–310.
Korhonen, P., Wallenius, J., & Zionts, S. (1984) Solving the discrete multiple criteria problem using convex cones. Management Science, 30, 1336–1345.
Morse, J. N. (1980). Reducing the size of the nondominated set: Pruning by clustering. Computers and Operations Research, 7, 55–66.
Steuer, R. E. (1983). Operating Manual for ADBASE Multiple Objective Linear Programming Computer Package Release 2/83, Athens, Georgia: College of Business Administration, University of Georgia.
Steuer, R. E. & Harris, F. W. (1980). Intra-set point generation and filtering in decision and criterion space. Computers and Operations Research, 7, 41–53.
Torn, A. A. (1980). A sampling-search-clustering approach for exploring the feasible/efficient solutions of MCDM problems. Computers and Operations Research, 7, 67–79.
Ward, J. E. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 59, 236–244.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Graves, S.B., Ringuest, J.L., Medaglia, A.L. (2003). Choosing the Best Solution in a Project Selection Problem with Multiple Objectives. In: Models & Methods for Project Selection. International Series in Operations Research & Management Science, vol 58. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0280-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0280-7_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5001-9
Online ISBN: 978-1-4615-0280-7
eBook Packages: Springer Book Archive