A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems
From MaRDI portal
Publication:2901064
DOI10.1287/ijoc.1080.0290zbMath1243.90198OpenAlexW2162994510MaRDI QIDQ2901064
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1080.0290
Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (7)
Multiple reduced gradient method for multiobjective optimization problems ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach ⋮ Generating equidistant representations in biobjective programming ⋮ Engine calibration: multi-objective constrained optimization of engine maps ⋮ Equispaced Pareto front construction for constrained bi-objective optimization ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
Uses Software
This page was built for publication: A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems
