Article ID: | iaor2014899 |
Volume: | 22 |
Issue: | 3 |
Start Page Number: | 208 |
End Page Number: | 218 |
Publication Date: | Oct 2001 |
Journal: | Structural and Multidisciplinary Optimization |
Authors: | Kasprzak E M, Lewis K E |
Keywords: | programming: multiple criteria |
This paper presents a method to predict the relative objective weighting scheme necessary to cause arbitrary members of a Pareto solution set to become optimal. First, a polynomial description of the Pareto set is constructed utilizing simulation and high performance computing. Then, using geometric relationships between the member of the Pareto set in question, the location of the utopia point and the polynomial coefficients, the weighting of the performance metrics which causes a particular member of the Pareto set to become optimal is determined. The use of this technique, termed the scaling method, is examined via using a sample problem from the field of vehicle dynamics optimization. The scaling method is based on the collinearity theorem which is also presented in the paper.