Maximizing a concave function over the efficient or weakly-efficient set

DOI10.1016/S0377-2217(98)00230-6zbMath0998.90074OpenAlexW1989822484MaRDI QIDQ1847166

Reiner Horst, Nguyen Van Thoai

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00230-6

zbMATH Keywords

global optimizationnonconvex programmingbranch and boundmultiple criteria analysisoptimization over efficient/weakly-efficient sets

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (25)

Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Semivectorial bilevel optimization problem: penalty approach ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Optimization over the efficient set of multi-objective convex optimal control problems ⋮ Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets ⋮ Semivectorial bilevel optimization on Riemannian manifolds ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ Optimization over the Pareto front of nonconvex multi-objective optimal control problems ⋮ An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem ⋮ Criteria and dimension reduction of linear multiple criteria optimization problems ⋮ Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem ⋮ DC programming: overview. ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem ⋮ A hybrid method for solving multi-objective global optimization problems ⋮ On optimization over the efficient set of a multiple objective linear programming problem ⋮ On optimization over the efficient set in linear multicriteria programming ⋮ Convergence and application of a decomposition method using duality bounds for nonconvex global optimization ⋮ Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems ⋮ Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net ⋮ Semivectorial bilevel programming versus scalar bilevel programming ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Combination between global and local methods for solving an optimization problem over the efficient set ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case

Cites Work

• Unnamed Item
• Unnamed Item
• Minimization of a quasi-concave function over an efficient set
• Concave minimization via conical partitions and polyhedral outer approximation
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
• Utility function programs and optimization over the efficient set in multiple-objective decision making
• A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
• Introduction to global optimization
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Algorithms for the vector maximization problem
• Optimization over the efficient set
• Optimization over the efficient set

This page was built for publication: Maximizing a concave function over the efficient or weakly-efficient set