Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Compounding problem in an interactive multiple objective optimization method
- Authors
- Park, K. Sam; Lee, Pyoungsoo
- Issue Date
- 1-2월-2016
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Multi-objective programming; Interactive method; Compounding problem
- Citation
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.248, no.3, pp.1132 - 1135
- Indexed
- SCIE
SCOPUS
- Journal Title
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Volume
- 248
- Number
- 3
- Start Page
- 1132
- End Page
- 1135
- ISSN
- 0377-2217
- Abstract
- This note finds and resolves a compounding problem in the interactive multi-objective optimization method developed by Park and Shin (2012). The compounding problem means that the algorithm generates a solution unexpected by the decision maker. A concrete example of the compounding problem is demonstrated and, to remove the problem, an improved algorithm is then developed. We also show that the improved algorithm converges to the known optimal solutions faster than the earlier algorithm. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.