Determining maximal efficient faces in multiobjective linear programming problem

DOI10.1016/j.jmaa.2008.11.063zbMath1173.90536OpenAlexW1976262603MaRDI QIDQ1018182

M. A. Yaghoobi, Latif Pourkarimi, Mashaallah Mashinchi

Publication date: 13 May 2009

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2008.11.063

zbMATH Keywords

efficiencymultiobjective linear programmingmaximal efficient faceminimal index set

Mathematics Subject Classification ID

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

Related Items

A common formula to compute the efficient sets of a class of multiple objective linear programming problems, A multiobjective based approach for mathematical programs with linear flexible constraints, Adjacency based method for generating maximal efficient faces in multiobjective linear programming, Finding non dominated points for multiobjective integer convex programs with linear constraints, Efficient curve fitting: an application of multiobjective programming, Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint, A new method for determining all maximal efficient faces in multiple objective linear programming, The maximal descriptor index set for a face of a convex polyhedral set and some applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing efficient solutions structure of multiobjective linear programming
• A dual-based algorithm for solving lexicographic multiple objective programs
• 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
• Generating all maximal efficient faces for 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 of a parametric multiple objective linear programming problem
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• Efficient solution generation for multiple objective linear programming based on extreme ray generation method
• Proper efficiency and the theory of vector maximization
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Finding all efficient extreme points for multiple objective linear programs
• Algorithms for the vector maximization problem