A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems

@article{MuellerGritschneder2009ASA,
  title={A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems},
  author={Daniel Mueller-Gritschneder and Helmut E. Graeb and Ulf Schlichtmann},
  journal={SIAM Journal on Optimization},
  year={2009},
  volume={20},
  pages={915-934}
}
This work focuses on the generation of the Pareto front for practical applications such as analog circuit sizing. The Pareto front is the solution to a multiobjective optimization problem. It shows all possible optimal compromises between conflicting design objectives (performances). In technical applications, the Pareto front is usually bounded. It is shown in this work that the boundary of the Pareto front consists of so-called trade-off limits if certain criteria are fulfilled. These… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Nickel , On the number of criteria needed to decide Pareto optimality

  • M. Ehrgott, S.
  • Math . Methods Oper . Res .
  • 2005

Normal constraint method with guarantee of even representation of complete Pareto frontier

  • A. Messac, C. A. Mattson
  • AIAA J., 42
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…