A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
type: Item
instance of: scholarly article
title: A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
zbMATH Open document ID: 1008.90027
DOI: 10.1016/S0377-2217(01)00153-9
author: Harold P. Benson
author: Erjiang Sun
published in: European Journal of Operational Research
publication date: 2002-06-16T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1756568
zbMATH Keywords: multicriteria analysis
zbMATH Keywords: multiple objective linear programming
zbMATH Keywords: efficient point
zbMATH Keywords: outcome set
MaRDI profile type: Publication
cites work: Determination of the efficient set in multiobjective linear programming
cites work: Solving multiobjective programming problems by discrete representation
cites work: Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
cites work: Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
cites work: A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
cites work: Hybrid approach for solving multiple-objective linear programs in outcome space
cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
cites work: Outcome space partition of the weight set in multiobjective linear programming
cites work: Pivoting in an outcome polyhedron
cites work: Q3760254
cites work: Multiobjective programming and planning
cites work: Analysis of the objective space in multiple objective linear programming
cites work: On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
cites work: Solving multiple objective linear programs in objective space
cites work: Constructing the set of efficient objective values in multiple objective linear programs
cites work: Generating all maximal efficient faces for multiple objective linear programs
cites work: An Overview of Techniques for Solving Multiobjective Mathematical Programs
cites work: A new pivoting rule for solving various degeneracy problems
cites work: Multiparametric Linear Programming
cites work: Handbook of global optimization
cites work: Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
cites work: Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
cites work: Multiple criteria decision support -- a review
cites work: Nonlinear multiobjective optimization
cites work: Q5638112
cites work: Theory of multiobjective optimization
cites work: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
cites work: A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
cites work: Q4102911
cites work: Q3815146
cites work: Q3217984
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: Linear multiobjective programming
cites work: Q3716769
Wikidata QID: Q126843276
Recommended article: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
Recommended article: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
Recommended article: Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.
Recommended article: An approach for finding efficient points in multiobjective linear programming
Recommended article: Q4408968
Recommended article: An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
Recommended article: Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
Recommended article: A regression study of the number of efficient extreme points in multiple objective linear programming
Recommended article: Q3582563
Recommended article: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
description: scientific article; zbMATH DE number 1756568