Determining maximal efficient faces in multiobjective linear programming problem

DOI10.1016/J.JMAA.2008.11.063MaRDI QIDQ1018182zbMATH OpenOpenAlexFDO

Authors M. A. Yaghoobi, L. 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

efficiencymaximal efficient faceminimal index setmultiobjective linear programming

Mathematics Subject Classification ID

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

Recommendations

• Finding all maximal efficient faces in multiobjective linear programming
• A new method for determining all maximal efficient faces in multiple objective linear programming
• Adjacency-based local top-down search method for finding maximal efficient faces in multiple objective linear programming
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• Constructing efficient solutions structure of multiobjective linear programming

Cites work

• A dual-based algorithm for solving lexicographic multiple objective programs
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• Algorithms for the vector maximization problem
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Complete efficiency and the initialization of algorithms for multiple objective programming
• Constructing efficient solutions structure of multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• Efficient solution generation for multiple objective linear programming based on extreme ray generation method
• Finding all efficient extreme points for multiple objective linear programs
• Finding all maximal efficient faces in multiobjective linear programming
• Generating all maximal efficient faces for multiple objective linear programs
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
• Optimization over the efficient set of a parametric multiple objective linear programming problem
• Proper efficiency and the theory of vector maximization
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• The set of all nondominated solutions in linear cases and a multicriteria simplex method

Cited in

(16)

• 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
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
• Finding non dominated points for multiobjective integer convex programs with linear constraints
• The maximal descriptor index set for a face of a convex polyhedral set and some applications
• Generating efficient faces for multiobjective linear programming problems
• 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
• scientific article; zbMATH DE number 943301 (Why is no real title available?)
• Adjacency-based local top-down search method for finding maximal efficient faces in multiple objective linear 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
• Constructing efficient solutions structure of multiobjective linear programming
• Efficient curve fitting: an application of multiobjective programming
• A modified method for constructing efficient solutions structure of MOLP

This page was built for publication: Determining maximal efficient faces in multiobjective linear programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018182)