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-9zbMath1008.90027WikidataQ126843276 ScholiaQ126843276MaRDI QIDQ1600950
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)
Related Items (13)
The \(L\)-shape search method for triobjective integer programming ⋮ Graphical exploration of the weight space in three-objective mixed integer linear programs ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Unnamed Item ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ Standard sensitivity analysis and additive tolerance approach in MOLP ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Determining maximal efficient faces in multiobjective linear programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving multiple objective linear programs in objective space
- Constructing the set of efficient objective values in multiple objective linear programs
- Theory of multiobjective optimization
- Analysis of the objective space in multiple objective linear programming
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Multiobjective programming and planning
- A new pivoting rule for solving various degeneracy problems
- Multiple criteria decision support -- a review
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Generating all maximal efficient faces for multiple objective linear programs
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Hybrid approach for solving multiple-objective linear programs in outcome space
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Nonlinear multiobjective optimization
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Determination of the efficient set in multiobjective linear programming
- Handbook of global optimization
- 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
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Solving multiobjective programming problems by discrete representation
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- Multiparametric Linear Programming
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
