A complementarity constraint formulation of convex multiobjective optimization problems.
We propose a new approach to convex nonlinear multiobjective optimization that captures the geometry of the Pareto set by generating a discrete set of Pareto points optimally. We show that the problem of finding a maximally uniform representation of the Pareto surface can be formulated as a mathematical program with complementarity constraints. The complementarity constraints arise from modeling the set of Pareto points, and the objective maximizes some quality measure of this discrete set. We present encouraging numerical experience on a range of test problems collected from the literature.
- Research Organization:
- Argonne National Laboratory (ANL)
- Sponsoring Organization:
- SC
- DOE Contract Number:
- AC02-06CH11357
- OSTI ID:
- 952918
- Report Number(s):
- ANL/MCS/JA-54898
- Journal Information:
- Inform J. Computing, Journal Name: Inform J. Computing Journal Issue: 2 ; Spring, 2009 Vol. 21
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
On optimal control of hybrid dynamical systems using complementarity constraints
Approximating convex Pareto surfaces in multiobjective radiotherapy planning
Convex Relaxation of Grid-Connected Energy Storage System Models With Complementarity Constraints in DC OPF
Journal Article
·
Tue Jul 08 00:00:00 EDT 2025
· Journal of Process Control
·
OSTI ID:2572556
Approximating convex Pareto surfaces in multiobjective radiotherapy planning
Journal Article
·
Fri Sep 15 00:00:00 EDT 2006
· Medical Physics
·
OSTI ID:20853459
Convex Relaxation of Grid-Connected Energy Storage System Models With Complementarity Constraints in DC OPF
Journal Article
·
Thu Apr 30 00:00:00 EDT 2020
· IEEE Transactions on Smart Grid
·
OSTI ID:1660118