Optimization over the efficient set using an active constraint approach

DOI10.1007/BF01415906zbMath0734.90081MaRDI QIDQ3363070

Jerald P. Dauer

Publication date: 1991

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

nonconvex constraintsmulticriteria linear programactive constraint algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (28)

Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Semivectorial bilevel optimization problem: penalty approach ⋮ Utility function programs and optimization over the efficient set in multiple-objective decision making ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Dual approach to minimization on the set of Pareto-optimal solutions ⋮ Optimization over the efficient set of multi-objective convex optimal control problems ⋮ 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 ⋮ Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ A new method for optimizing a linear function over the efficient set of a multiobjective integer program ⋮ Minimization of a quasi-concave function over an efficient set ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ Optimization over the efficient set ⋮ A regression study of the number of efficient extreme points in multiple objective linear programming ⋮ 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 ⋮ New closedness results for efficient sets in multiple objective mathematical programming ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ On degeneracy and collapsing in the construction of the set of objective values in a multiple objective 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 ⋮ Necessary conditions for nonlinear suboptimization over the weakly- efficient set ⋮ Optimization over the efficient set: Four special cases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving multiple objective linear programs in objective space
• Constructing the set of efficient objective values in multiple objective linear programs
• Theory of multiobjective optimization
• Careful usage of pessimistic values is needed in multiple objectives optimization
• Analysis of the objective space in multiple objective linear programming
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• A multiobjective optimization model for water resources planning
• Generating all maximal efficient faces for multiple objective linear programs
• The range of the efficient frontier in multiple objective linear programming
• Computation of the search direction in constrained optimization algorithms
• Newton-type methods for unconstrained and linearly constrained optimization
• Numerically stable methods for quadratic programming
• Large-scale linearly constrained optimization
• On Computing an Initial Efficient Extreme Point
• Algorithms for the vector maximization problem
• Sparse Matrix Methods in Optimization
• Convex Analysis
• Optimization over the efficient set

This page was built for publication: Optimization over the efficient set using an active constraint approach