A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program

European Journal of Operational Research

Volumn 139, Issue 1, 2002, Pages 26-41

  Benson, Harold P ^a   Sun, Erjiang ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Efficient point; Multicriteria analysis; Multiple objective linear programming; Outcome set

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING;

MULTICRITERIA ANALYSIS;

OPERATIONS RESEARCH;

EID: 0037118179     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00153-9     Document Type: Article

References (40)

1. Interactive multiple objective decision making: A bibliography (1965-1988)
2. Determination of the efficient decision set in multiobjective linear programming
3. Solving multiobjective programming problems by discrete representation
4. Finding an initial efficient extreme point for a linear multiple objective program
5. Generating the efficient outcome set in multiple objective linear programs: The bi-criteria case
6. A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
7. Hybrid approach for solving multiple-objective linear programs in outcome space
8. An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
9. Outcome space partition of the weight set in multiobjective linear programming
10. Pivoting in an outcome polyhedron
11. Analysis of the objective space in multiple objective linear programming
12. On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
13. Solving multiple objective linear programs in objective space
14. Constructing the set of efficient objective values in multiple objective linear programs
15. Generating all maximal efficient faces for multiple objective linear programs
16. An overview of techniques for solving multiobjective mathematical programs
17. Generating efficient extreme points in linear multiple objective programming: Two algorithms and computing experience
18. A new pivoting rule for solving various degeneracy problems
19. Multiparametric linear programming
20. On the vertex enumeration problem in cutting plane algorithms of global optimization
21. Modification, implementation, and comparasion of three algorithms for globally solving linearly constrained convex minimization problems
22. Multiple criteria decision support - A review
23. Reducing the size of the nondominated set: Pruning by clustering
24. Principles of multiobjective optimization
25. An algorithm based on facial decomposition for finding the efficient set in multiple-objective linear programming
26. A survey of multicriteria optimization or the vector maximum problem, part I: 1776-1960
27. A five-phase procedure for implementing a vector-maximum algorithm for multiple-objective linear programming problems
28. The set of all nondominated solutions in linear cases a multicriteria simplex method