A convex-concave programming method for optimizing over the efficient set.

zbMath1112.90373MaRDI QIDQ1577612

Le Dung Muu

Publication date: 2000

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (4)

Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem ⋮ Problems with resource allocation constraints and optimization over the efficient set ⋮ Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection

This page was built for publication: A convex-concave programming method for optimizing over the efficient set.