An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
From MaRDI portal
Publication:427361
DOI10.1007/s10898-011-9786-yzbMath1245.90114OpenAlexW2020896892MaRDI QIDQ427361
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9786-y
Related Items
Optimizing over the properly efficient set of convex multi-objective optimization problems, A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem, Primal and dual algorithms for optimization over the efficient set, On optimization over the efficient set of a multiple objective linear programming problem, The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems, Solving Optimization Problems over the Weakly 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization over the efficient set: overview
- Theory of multiobjective optimization
- Careful usage of pessimistic values is needed in multiple objectives optimization
- An algorithm for optimizing over the weakly-efficient set
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- 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
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- A convex-concave programming method for optimizing over the efficient set.
- An inner approximation method for optimization over the weakly efficient set
- 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
- Robust solution of nonconvex global optimization problems
- A global optimization approach for generating efficient points for multiobjective concave fractional programs
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- An algorithm for nonconvex programming problems
- An Existence Theorem in Vector Optimization
- On the Existence of Pareto Efficient Points
- Multicriteria Optimization
- Convex Analysis
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- On minimization over weakly efficient sets
- Optimization over the efficient set
- Convex analysis and global optimization
- Conical algorithm in global optimization for optimizing over efficient sets
- An algorithm for optimizing over the efficient set
- 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
