Tradeoff directions in multiobjective optimization problems
Henig, Mordechai I.
Buchanan, John T.

Data: 1997
Resum: 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. .
Drets: Tots els drets reservats.
Llengua: Anglès
Document: Article ; recerca ; Versió publicada
Matèria: Multiple objective programming ; Tradeoff directions ; Pareto optimal
Publicat a: Mathematical Programming, vol. 78 n. 3 (1997) p. 357-374, ISSN 0025-5610

18 p, 716.2 KB
 Accés restringit a la UAB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2006-03-13, darrera modificació el 2023-06-03

   Favorit i Compartir