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.
Similar content being viewed by others
References
H.P. Benson, An improved definition of proper efficiency for vector maximization with respect to cones,Journal of Mathematical Analysis and Applications 71 (1979) 232–241.
J. Borwein, Proper efficient points for maximization with respect to cones,SIAM Journal on Control and Optimization 15 (1977) 57–63.
J. Buchanan, Solution methods for multiple objective decision models, Ph.D. Thesis, University of Canterbury, New Zealand, 1985.
V. Chankong and Y.Y. Haimes, The interactive surrogate worth tradeoff (ISWT) method for multiobjective decision making, in: S. Zionts, ed.,Multiple Criteria Problem Solving, Lecture Notes in Economics and Mathematical Systems, Vol. 155 (Springer, New York, 1977) 42–67.
A.M. Geoffrion, Proper efficiency and the theory of vector maximization,Journal of Mathematical Analysis and Applications 22 (1968) 613–630.
A.M. Geoffrion, J.S. Dyer and A. Feinberg, An interactive approach for multicriterion optimization with application to the operation of an academic department,Management Science 19 (1972) 357–368.
Y.Y. Haimes, L. Lasdon and D. Wismer, On a bicriterion formulation of the problems of integrated systems identification and system optimization,IEEE Transactions on Systems Man and Cybernetics 1 (1971) 296–297.
Y.Y. Haimes and V. Chankong, Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis,Automatica 15 (1979) 59–72.
M. Halme, Local characterization of efficient solutions in interactive multiple objective linear programming, Helsinki School of Economics and Business Administration, Helsinki, 1992.
M.I. Henig, A generalized method of approximating the set of efficient points with respect to a convex cone, in: J. Morse, ed.,Organizations: Multiple Agents with Multiple Criteria, Lecture Notes in Economics and Mathematical Systems (Springer, Berlin, 1981) 140–144.
M.I. Henig, Proper efficiency with respect to cones,Journal of Optimization Theory and Applications 36 (1982) 387–407.
H. Isermann, Proper efficiency and the linear vector maximization problem,Operations Research 22 (1974) 189–191.
I. Kaliszewski,Qualitative Pareto Analysis by Cone Separation Technique (Kluwer Academic Publishers, Boston, MA, 1994).
H.W. Kuhn and A.W. Tucker, Nonlinear programming, in:Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley, CA, 1951) 481–492.
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1972).
M. Sakawa and H. Yano, Trade-off rates in the hyperplane method for multi-objective optimization,European Journal of Operational Research 44 (1990) 105–118.
W.S. Shin and A. Ravindran, Interactive multiple objective optimization: Survey I — Continuous case,Computers and Operations Research 18 (1991) 97–114.
P.-L. Yu, Cone convexity, cone extreme points, and nondominated solutions, in decision problems with multiobjectives,Journal of Optimization Theory and Applications 14 (1974) 319–377.
S. Zionts and J. Wallenius, An interactive programming method for solving the multiple criteria problem,Management Science 29 (1976) 519–529.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Henig, M.I., Buchanan, J.T. Tradeoff directions in multiobjective optimization problems. Mathematical Programming 78, 357–374 (1997). https://doi.org/10.1007/BF02614361
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02614361