Optimization over the efficient set
From MaRDI portal
Recommendations
- The maximization of a function over the efficient set via a penalty function approach
- Optimizing a linear function over an efficient set
- Optimization over the efficient set using an active constraint approach
- Optimization over the efficient set of a bicriteria convex programming problem
- Bisection search algorithm for optimizing over the efficient set
Cites work
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
- Algorithms for the vector maximization problem
- An all-linear programming relaxation algorithm for optimizing over the 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
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convex Analysis
- Finding all efficient extreme points for multiple objective linear programs
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 592648 (Why is no real title available?)
- scientific article; zbMATH DE number 219844 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- Minimization of a quasi-concave function over an efficient set
- Necessary conditions for nonlinear suboptimization over the weakly- efficient set
- Optimality conditions for minimization over the (weakly or properly) efficient set
- Optimization over the efficient set
- Optimization over the efficient set using an active constraint approach
- Optimization over the efficient set: Four special cases
- The range of the efficient frontier in multiple objective linear programming
Cited in
(57)- An algorithm for optimizing over the weakly-efficient set
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- The maximization of a function over the efficient set via a penalty function approach
- The utility efficient set and its interactive reduction
- Optimization over the efficient set: Four special cases
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- 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
- Bisection search algorithm for optimizing over the efficient set
- 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
- DC programming: overview.
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
- A solution method for semivectorial bilevel programming problem via penalty method
- Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net
- 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
- Semivectorial bilevel optimization problem: penalty approach
- On optimization over the efficient set in linear multicriteria programming
- Optimization over equilibrium sets∗
- Set Optimization—A Rather Short Introduction
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- scientific article; zbMATH DE number 3891128 (Why is no real title available?)
- Optimization over the efficient set using an active constraint approach
- Criteria and dimension reduction of linear multiple criteria optimization problems
- scientific article; zbMATH DE number 592648 (Why is no real title available?)
- Pénalisation dans l'optimisation sur l'ensemble faiblement efficient
- scientific article; zbMATH DE number 1086738 (Why is no real title available?)
- scientific article; zbMATH DE number 1530351 (Why is no real title available?)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- 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
- scientific article; zbMATH DE number 2096864 (Why is no real title available?)
- Optimization over the efficient set of a bicriteria convex programming problem
- Solving Optimization Problems over the Weakly Efficient Set
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On high-order model regularization for multiobjective optimization
- Optimization through dense sets
- On optimization over the efficient set of a multiple objective linear programming problem
- Optimality conditions for semivectorial bilevel convex optimal control problems
- Optimization over the efficient set: overview
- Optimization over the efficient set of multi-objective convex optimal control problems
- Existence results and optimization over the set of efficient solutions in vector-valued approximation theory
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Parallel optimization over the integer efficient set
- Optimization over the Pareto front of nonconvex multi-objective optimal control problems
- Maximizing a linear fractional function on a Pareto efficient frontier
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Characterizations of efficient sets by constrained objectives
- Applying set optimization to weak efficiency
- Semivectorial bilevel optimization on Riemannian manifolds
This page was built for publication: Optimization over the efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917733)
