Optimization over the efficient set

DOI10.1007/BF01279451zbMath0841.90107MaRDI QIDQ5917733

Jerald P. Dauer, Timothy A. Fosnaugh

Publication date: 7 January 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

penalty functionbiobjective programefficient set of a linear multiple objective program

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (37)

On high-order model regularization for multiobjective optimization ⋮ Semivectorial bilevel optimization problem: penalty approach ⋮ An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ 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 ⋮ Existence results and optimization over the set of efficient solutions in vector-valued approximation theory ⋮ Semivectorial bilevel optimization on Riemannian manifolds ⋮ Parallel optimization over the integer efficient set ⋮ 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 ⋮ Criteria and dimension reduction of linear multiple criteria optimization 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 new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ DC programming: overview. ⋮ 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 ⋮ A solution method for semivectorial bilevel programming problem via penalty method ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ 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 ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ 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 ⋮ Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program ⋮ Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization of a quasi-concave function over an efficient set
• Careful usage of pessimistic values is needed in multiple objectives optimization
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• 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
• Optimization over the efficient set: Four special cases
• A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
• Optimality conditions for minimization over the (weakly or properly) efficient set
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• The range of the efficient frontier in multiple objective linear programming
• Optimization over the efficient set using an active constraint approach
• 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: Optimization over the efficient set