An approach for finding efficient points in multiobjective linear programming

DOI10.1080/02522667.2008.10699800zbMath1165.90634OpenAlexW2314657639MaRDI QIDQ3602248

C. O. Pieume, Laure Pauline Fotso, Patrick Siarry

Publication date: 12 February 2009

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2008.10699800

zbMATH Keywords

efficient pointmultiobjective linear programmingefficient face

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items

A multiple objective programming approach to linear bilevel multi-follower programming, Solving bilevel programming problems with multicriteria optimization techniques

Cites Work

• Constructing efficient solutions structure of multiobjective linear programming
• A fuzzy satisficing method for large-scale multiobjective linear programming problems with block angular structure
• A simplified MOLP algorithm: The MOLP-S procedure
• 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
• Finding all maximal efficient faces in multiobjective linear programming
• Determination of the efficient set in 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
• Finding all efficient extreme points for multiple objective linear programs
• Algorithms for the vector maximization problem