An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

DOI10.1016/0167-6377(95)00046-1zbMath0865.90112OpenAlexW2132732693MaRDI QIDQ2564306

Serpil Sayın

Publication date: 19 March 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/25796

zbMATH Keywords

efficient setefficient facesfacial decompositionvector maximizationmultiple objective linear program

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (21)

A multiple objective programming approach to linear bilevel multi-follower programming ⋮ A common formula to compute the efficient sets of a class of multiple objective linear programming problems ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Unnamed Item ⋮ Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ Minimal representations of a face of a convex polyhedron and some applications ⋮ Finding DEA-efficient hyperplanes using MOLP efficient faces ⋮ Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ An approach for finding efficient points in multiobjective linear programming ⋮ Further analysis of an outcome set-based algorithm for multiple-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ Determining maximal efficient faces in multiobjective linear programming problem ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull

Uses Software

• CPLEX

Cites Work

• Complete efficiency and the initialization of algorithms for multiple objective programming
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• Finding all maximal efficient faces in multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• Optimization over the efficient set: Four special cases
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
• Finding all efficient extreme points for multiple objective linear programs
• A revised simplex method for linear multiple objective programs
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming