Article ID: | iaor200947183 |
Country: | Poland |
Volume: | 36 |
Issue: | 2 |
Start Page Number: | 347 |
End Page Number: | 355 |
Publication Date: | Apr 2007 |
Journal: | Control & Cybernetics |
Authors: | Podkopaev Dmitry |
Keywords: | optimization |
The paper addresses the problem of deriving Pareto optimal solutions of multiple objective optimization problems with predetermined upper bounds on trade–offs. As shown, this can be achieved by a linear transformation of objective functions. Each non–diagonal element of the transformation matrix is related to a bound on the trade–off between a pair of the objective functions.