A complementarity constraint formulation of convex multiobjective optimization problems

DOI10.1287/IJOC.1080.0290MaRDI QIDQ2901064zbMATH OpenOpenAlexFDO

Authors Sven Leyffer

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

zbMATH Keywords

nonlinear programmingmultiobjective optimizationcomplementarity constraints

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Conjugate duality for multiobjective composed optimization problems
• Convex composite multi-objective nonsmooth programming
• New constrained optimization reformulation of complementarity problems
• Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
• On generalized-convex constrained multi-objective optimization
• Multiobjective programming problems under generalized convexity
• A constraint method in nonlinear multi-objective optimization
• An approximation algorithm for convex multi-objective programming problems
• scientific article; zbMATH DE number 778346
• Publication:4733689

Cited in

(7)

• Multiple reduced gradient method for multiobjective optimization problems
• On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
• Equispaced Pareto front construction for constrained bi-objective optimization
• Generating equidistant representations in biobjective programming
• Bilevel programming for generating discrete representations in multiobjective optimization
• Engine calibration: multi-objective constrained optimization of engine maps
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs

Describes a project that uses

Uses Software

• NIMBUS
• PATH Solver
• MacMPEC

This page was built for publication: A complementarity constraint formulation of convex multiobjective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901064)