Adjacency based method for generating maximal efficient faces in multiobjective linear programming

DOI10.1016/j.apm.2012.01.034zbMath1349.90605OpenAlexW2069540826MaRDI QIDQ345543

Saoussen Krichen, Hela Masri, Adel Guitouni

Publication date: 2 December 2016

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2012.01.034

zbMATH Keywords

efficient setadjacencymultiobjective linear programmingoutcome setefficient faces

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (2)

Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing efficient solutions structure of multiobjective linear programming
• A modified method for constructing efficient solutions structure of MOLP
• Determining maximal efficient faces in multiobjective linear programming problem
• A new pivoting rule for solving various degeneracy problems
• 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
• Further analysis of an outcome set-based algorithm for multiple-objective linear programming
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• 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
• 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 fuzzy approach to the multiobjective transportation problem
• Two storage inventory problem with dynamic demand and interval valued lead-time over finite time horizon under inflation and time-value of money
• Primal-dual simplex method for multiobjective linear programming
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Vector maximization at a degenerate vertex
• Towards finding global representations of the efficient set in multiple objective mathematical programming

This page was built for publication: Adjacency based method for generating maximal efficient faces in multiobjective linear programming