Optimizing over the properly efficient set of convex multi-objective optimization problems
From MaRDI portal
Publication:828826
DOI10.1007/s10479-020-03820-4zbMath1467.90034OpenAlexW3092329170MaRDI QIDQ828826
Kahina Ghazli, Nicolas Gillis, Mustapha Moulaï
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03820-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Optimization over the efficient set: overview
- Minimization of a quasi-concave function over an efficient set
- Problems with resource allocation constraints and optimization over the efficient set
- Benson type algorithms for linear vector optimization and applications
- An exact penalty on bilevel programs with linear vector optimization lower level
- An exact method for computing the nadir values in multiple objective linear programming
- An algorithm for optimizing over the weakly-efficient set
- 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 bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- The maximization of a function over the efficient set via a penalty function approach
- Nonlinear multiobjective optimization
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimizing a linear function over an efficient set
- Optimization on low rank nonconvex structures
- Minimum maximal flow problem: An optimization over the efficient set
- A convex-concave programming method for optimizing over the efficient set.
- An inner approximation method for optimization over the weakly efficient set
- Multiple criteria linear programming model for portfolio selection
- A Frank--Wolfe type theorem for convex polynomial programs
- Maximizing a concave function over the efficient or weakly-efficient set
- 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
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
- A solution method for semivectorial bilevel programming problem via penalty method
- A novel penalty function method for semivectorial bilevel programming problem
- Semivectorial bilevel optimization problem: penalty approach
- A survey of recent developments in multiobjective optimization
- Suitable-portfolio investors, nondominated frontier sensitivity, and the effect of multiple objectives on standard portfolio selection
- Proper efficiency and the theory of vector maximization
- An upper bound on properly efficient solutions in multiobjective optimization
- Graph Implementations for Nonsmooth Convex Programs
- Optimization over the efficient set using an active constraint approach
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Numerical Optimization
- Pénalisation dans l'optimisation sur l'ensemble faiblement efficient
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Primal and dual algorithms for optimization over the efficient set
- Algorithms for the vector maximization problem
- Multicriteria Optimization
- Optimization over the efficient set
- Conical algorithm in global optimization for optimizing over efficient sets
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- Reverse polyblock approximation for optimization over the weakly efficient set and efficient set.
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
This page was built for publication: Optimizing over the properly efficient set of convex multi-objective optimization problems
