Minimum values over the efficient set in multiple objective decision making
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This study explores the differences between the subset of the set of efficient solutions to a MODM problem bounded by its ideal solutions and the complete efficient set.
Abstract
In multiple objective decision making (MODM), it is often helpful to provide the decision maker (DM) with bounds on the values of each of the objectives. Ideal solutions are relatively easy to calculate and provide upper bounds on the value of each objective over the set of efficient solutions. Ideal solutions also provide lower bounds on the value of each objective over the ideal set. However, the lower bounds over the set of efficient solutions can be strictly less than the ideal lower bounds, but are, in general, more difficult to determine. Thus MODM procedures which utilize the ideal lower bound may overlook elements of the set of efficient solutions. This study explores the differences between the subset of the set of efficient solutions to a MODM problem bounded by its ideal solutions and the complete efficient set.
