A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
From MaRDI portal
Publication:427391
DOI10.1007/s10898-011-9709-yzbMath1245.90115MaRDI QIDQ427391
Lizhen Shao, Matthias Ehrgott, Andreas Löhne
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-9709-y
vector optimization; linear programming; outer approximation; multiobjective optimization; objective space
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Primal and dual algorithms for optimization over the efficient set, An algorithm to solve polyhedral convex set optimization problems, AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS, Inner approximation algorithm for solving linear multiobjective optimization problems, A Benson-type algorithm for bounded convex vector optimization problems with vertex selection, A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem, Using multiobjective optimization to map the entropy region, Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems, Algorithms to Solve Unbounded Convex Vector Optimization Problems, The \(L\)-shape search method for triobjective integer programming, Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming, Characterizing coherence, correcting incoherence, Primal and dual approximation algorithms for convex vector optimization problems, A parametric simplex algorithm for linear vector optimization problems, An approximation algorithm for convex multi-objective programming problems, A semidefinite programming approach for solving multiobjective linear programming, Benson type algorithms for linear vector optimization and applications, An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem, Approximating the nondominated set of an MOLP by approximately solving its dual problem, A graph-based algorithm for the multi-objective optimization of gene regulatory networks, Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver, Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming, The vector linear program solver Bensolve -- notes on theoretical background, A vector linear programming approach for certain global optimization problems, Tractability of convex vector optimization problems in the sense of polyhedral approximations, An a posteriori decision support methodology for solving the multi-criteria supplier selection problem, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle, A Benson type algorithm for nonconvex multiobjective programming problems, Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions, PolySCIP, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, Set Optimization—A Rather Short Introduction, Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pareto optimality, game theory and equilibria
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Set-valued duality theory for multiple objective linear programs and application to mathematical finance
- On-line and off-line vertex enumeration by adjacency lists
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Outcome space partition of the weight set in multiobjective linear programming
- A survey of recent developments in multiobjective optimization
- Handbook of multicriteria analysis
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- Geometric Duality in Multiple Objective Linear Programming
- Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
- On some relations between a dual pair of multiple objective linear programs
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Multicriteria Optimization
- State Constraints in Convex Control Problems of Bolza
