Minimization of a quasi-concave function over an efficient set

DOI10.1007/BF01582141zbMATH Open0799.90100MaRDI QIDQ689154FDOQ689154

Authors: S. Bolintineanu 

Publication date: 1993

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

Recommendations

• On the minimization of a quasi-concave function subject to linear constraints
• Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
• Publication:4349640
• scientific article; zbMATH DE number 592648
• Optimizing a linear function over an efficient set

zbMATH Keywords

cutting plane algorithmlinear vector minimization

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (38)

• Quasiconvex minimization on a locally finite union of convex sets
• New closedness results for efficient sets in multiple objective mathematical programming
• Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems
• Maximizing a linear fractional function on a Pareto efficient frontier
• Solving Optimization Problems over the Weakly Efficient Set
• Static vector optimization in welfare economics
• A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
• Optimization over the efficient set of multi-objective convex optimal control problems
• Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Technical efficiency and distance to a reverse convex set
• Simplicially-constrained DC optimization over efficient and weakly efficient sets
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• Semivectorial bilevel optimization problem: penalty approach
• Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
• Optimization over the Pareto front of nonconvex multi-objective optimal control problems
• Title not available (Why is that?)
• Optimization over the efficient set
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem
• Title not available (Why is that?)
• A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
• Semivectorial bilevel optimization on Riemannian manifolds
• Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
• Optimization over equilibrium sets^∗
• On optimization over the efficient set in linear multicriteria programming
• Necessary conditions for nonlinear suboptimization over the weakly- efficient set
• Combination between global and local methods for solving an optimization problem over the efficient set
• Maximizing a concave function over the efficient or weakly-efficient set
• Linear multicriteria sensitivity and shadow costs
• On optimization over the efficient set of a multiple objective linear programming problem
• 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
• Optimization over the efficient set of a parametric multiple objective linear programming problem
• Minimizing a convex combination of the overshoot and undershoot
• Optimizing over the properly efficient set of convex multi-objective optimization problems
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS

Uses Software

• ADBASE

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

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