Primal and dual algorithms for optimization over the efficient set
From MaRDI portal
Publication:4646523
Recommendations
- Optimization over the efficient set: overview
- Combination between global and local methods for solving an optimization problem over the efficient set
- scientific article; zbMATH DE number 592648
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
Cites work
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Analysis of the objective space in multiple objective linear programming
- Benson type algorithms for linear vector optimization and applications
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Conical algorithm in global optimization for optimizing over efficient sets
- Geometric Duality in Multiple Objective Linear Programming
- Mathematical optimization in intensity modulated radiation therapy
- Multicriteria Optimization
- Multiple criteria decision analysis. State of the art surveys
- Multiple criteria decision making for sustainable energy and transportation systems. Proceedings of the 19th international conference on multiple criteria decision making, Auckland, New Zealand, 7th -- 12th January 2008
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- On generation of test problems for linear programming codes
- On the efficient point set of tricriteria linear programs
- Optimization over the efficient set
- Optimization over the efficient set of a bicriteria convex programming problem
- Optimization over the efficient set: overview
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Primal and dual approximation algorithms for convex vector optimization problems
Cited in
(13)- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
- The primal-dual method for approximation algorithms
- The primal-dual algorithm as a constraint-set-manipulation device
- Holistic fleet optimization incorporating system design considerations
- Parallel optimization over the integer efficient set
- Optimization over the Pareto front of nonconvex multi-objective optimal control problems
- Combination between global and local methods for solving an optimization problem over the efficient set
- A post-optimality analysis algorithm for multi-objective optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- A genetics algorithms for optimizing a function over the integer efficient set
This page was built for publication: Primal and dual algorithms for optimization over the efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646523)
