Tradeoff directions in multiobjective optimization problems |
| |
Authors: | Mordechai I Henig John T Buchanan |
| |
Institution: | (1) Faculty of Management, Tel Aviv University, Tel Aviv, Israel;(2) Department of Management Systems, University of Waikato, Hamilton, New Zealand |
| |
Abstract: | Multiobjective optimization problems (MOP) typically have conflicting objectives wherein a gain in one objective is at the
expense of another. Tradeoff directions, which measure the change in some objectives relative to changes in others, provide
important information as to the best direction of improvement from the current solution. In this paper we present a general
definition of tradeoffs as a cone of directions and provide a general method of calculating tradeoffs at every Pareto optimal
point of a convex MOP. This extends current definitions of tradeoffs which assume certain conditions on the feasible set and
the objective functions. Two comprehensive numerical examples are provided to illustrate the tradeoff directions and the methods
used to calculate them. |
| |
Keywords: | Multiple objective programming Tradeoff directions Pareto optimal |
本文献已被 SpringerLink 等数据库收录! |