An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem

Related Items (85)

Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Relationships between constrained and unconstrained multi-objective optimization and application in location theory ⋮ Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming ⋮ Unnamed Item ⋮ Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ A deterministic algorithm for global multi-objective optimization ⋮ A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle ⋮ Set-valued average value at risk and its computation ⋮ Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy ⋮ An algorithmic approach to multiobjective optimization with decision uncertainty ⋮ On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods ⋮ A Benson type algorithm for nonconvex multiobjective programming problems ⋮ An exact algorithm for biobjective integer programming problems ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets ⋮ Efficient allocation of resources to a portfolio of decision making units ⋮ A new exact method for linear bilevel problems with multiple objective functions at the lower level ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Outer approximation algorithms for convex vector optimization problems ⋮ A survey of interval algorithms for solving multicriteria analysis problems ⋮ A framework for controllable Pareto front learning with completed scalarization functions and its applications ⋮ Criteria and dimension reduction of linear multiple criteria optimization problems ⋮ A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming ⋮ A new duality approach to solving concave vector maximization problems ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ Characterizing coherence, correcting incoherence ⋮ Primal and dual approximation algorithms for convex vector optimization problems ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Компромиссные паретовские оценки параметров линейной регрессии ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ Generation of efficient and ε -efficient solutions in multiple objective linear programming ⋮ PolySCIP ⋮ A hybrid method for solving multi-objective global optimization problems ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ Primal and dual algorithms for optimization over the efficient set ⋮ Primal-dual simplex method for multiobjective linear programming ⋮ Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning ⋮ Minimizing the maximal weighted lateness of delivering orders between two railroad stations ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Mathematical optimization in intensity modulated radiation therapy ⋮ Mathematical optimization in intensity modulated radiation therapy ⋮ The vector linear program solver Bensolve -- notes on theoretical background ⋮ An objective space cut and bound algorithm for convex multiplicative programmes ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ A vector linear programming approach for certain global optimization problems ⋮ Tractability of convex vector optimization problems in the sense of polyhedral approximations ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ Locating a semi-obnoxious facility in the special case of Manhattan distances ⋮ An approximation algorithm for convex multi-objective programming problems ⋮ Approximation of convex bodies by multiple objective optimization and an application in reachable sets ⋮ Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes ⋮ Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials ⋮ Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver ⋮ Approximating the nondominated set of an MOLP by approximately solving its dual problem ⋮ Using multiobjective optimization to map the entropy region ⋮ A linear risk-return model for enhanced indexation in portfolio optimization ⋮ Set Optimization—A Rather Short Introduction ⋮ Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs ⋮ A semidefinite programming approach for solving multiobjective linear programming ⋮ Benson type algorithms for linear vector optimization and applications ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS ⋮ Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ Cost of fairness in agent scheduling for contact centers ⋮ Incomplete risk-preference information in portfolio decision analysis ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Approximation methods in multiobjective programming ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ The adaptive parameter control method and linear vector optimization ⋮ Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case ⋮ Global maximization of UTA functions in multi-objective optimization

This page was built for publication: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem