Minimization of a quasi-concave function over an efficient set

DOI10.1007/BF01582141zbMath0799.90100MaRDI QIDQ689154

S. Bolintineanu

Publication date: 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

cutting plane algorithmlinear vector minimization

Mathematics Subject Classification ID

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

Related Items (33)

Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Semivectorial bilevel optimization problem: penalty approach ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Optimization over the efficient set of multi-objective convex optimal control problems ⋮ Semivectorial bilevel optimization on Riemannian manifolds ⋮ Linear multicriteria sensitivity and shadow costs ⋮ Optimization over the Pareto front of nonconvex multi-objective optimal control problems ⋮ Simplicially-constrained DC optimization over efficient and weakly efficient sets ⋮ Optimization over equilibrium sets^∗ ⋮ Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem ⋮ A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem ⋮ A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem ⋮ On optimization over the efficient set of a multiple objective linear programming problem ⋮ On optimization over the efficient set in linear multicriteria programming ⋮ Optimization over the efficient set ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ 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 ⋮ Static vector optimization in welfare economics ⋮ Technical efficiency and distance to a reverse convex set ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Solving Optimization Problems over the Weakly Efficient Set ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Maximizing a concave function over the efficient or weakly-efficient set ⋮ Combination between global and local methods for solving an optimization problem over the efficient set ⋮ New closedness results for efficient sets in multiple objective mathematical programming ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Computing the nadir point for multiobjective discrete optimization problems ⋮ Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case ⋮ Necessary conditions for nonlinear suboptimization over the weakly- efficient set

Uses Software

• ADBASE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for optimizing over the weakly-efficient set
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
• 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
• Necessary conditions for nonlinear suboptimization over the weakly- efficient set
• Optimality conditions for minimization over the (weakly or properly) efficient set
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Optimization over the efficient set using an active constraint approach
• Global Maximization of a Convex Function with Linear Inequality Constraints
• A Successive Underestimation Method for Concave Minimization Problems
• Finding all efficient extreme points for multiple objective linear programs
• Algorithms for the vector maximization problem
• Convex Analysis
• Optimization over the efficient set

This page was built for publication: Minimization of a quasi-concave function over an efficient set