Compounding problem in an interactive multiple objective optimization method

K. Sam Park and Pyoungsoo Lee

European Journal of Operational Research, 2016, vol. 248, issue 3, 1132-1135

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.

Keywords: Multi-objective programming; Interactive method; Compounding problem (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171500805X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:248:y:2016:i:3:p:1132-1135

DOI: 10.1016/j.ejor.2015.08.049

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().