A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
From MaRDI portal
Publication:1600950
DOI10.1016/S0377-2217(01)00153-9zbMATH Open1008.90027WikidataQ126843276 ScholiaQ126843276MaRDI QIDQ1600950FDOQ1600950
Authors: Harold P. Benson, Erjiang Sun 
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.
- An approach for finding efficient points in multiobjective linear programming
- scientific article; zbMATH DE number 1941912
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- A regression study of the number of efficient extreme points in multiple objective linear programming
- Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29)
Cites Work
- Title not available (Why is that?)
- Theory of multiobjective optimization
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Nonlinear multiobjective optimization
- Title not available (Why is that?)
- Handbook of global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiobjective programming and planning
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Linear multiobjective programming
- Analysis of the objective space in multiple objective linear programming
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- Solving multiple objective linear programs in objective space
- A new pivoting rule for solving various degeneracy problems
- Generating all maximal efficient faces for multiple objective linear programs
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Determination of the efficient set in multiobjective linear programming
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
- Outcome space partition of the weight set in multiobjective linear programming
- Pivoting in an outcome polyhedron
- Multiparametric Linear Programming
- Solving multiobjective programming problems by discrete representation
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- Multiple criteria decision support -- a review
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- Constructing the set of efficient objective values in multiple objective linear programs
- Title not available (Why is that?)
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Title not available (Why is that?)
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
Cited In (20)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
- Multi-objective integer programming: an improved recursive algorithm
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- Bilevel programming for generating discrete representations in multiobjective optimization
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
- Optimising a nonlinear utility function in multi-objective integer programming
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
- The \(L\)-shape search method for triobjective integer programming
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- Standard sensitivity analysis and additive tolerance approach in MOLP
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
- Determining maximal efficient faces in multiobjective linear programming problem
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- Outcome space partition of the weight set in multiobjective linear programming
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
- Title not available (Why is that?)
This page was built for publication: A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600950)
