An approach for finding efficient points in multiobjective linear programming

DOI10.1080/02522667.2008.10699800MaRDI QIDQ3602248zbMATH OpenOpenAlexFDO

Authors 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

multiobjective linear programmingefficient pointefficient face

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• Determination of the efficient set in multiobjective linear programming
• Finding all maximal efficient faces in multiobjective linear programming
• Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Identifying the Efficient Extreme-Points of the Three-Objective Linear Programming Problem

Cites work

• A fuzzy satisficing method for large-scale multiobjective linear programming problems with block angular structure
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• A simplified MOLP algorithm: The MOLP-S procedure
• Algorithms for the vector maximization problem
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Constructing efficient solutions structure of multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• 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
• 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

(15)

• Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming
• Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
• A regression study of the number of efficient extreme points in multiple objective linear programming
• Using Efficient Anchoring Points for Generating Search Directions in Interior Multiobjective Linear Programming
• On efficient solution of multiobjective linear programming
• A multiple objective programming approach to linear bilevel multi-follower programming
• Solving bilevel programming problems with multicriteria optimization techniques
• Complete efficiency and the initialization of algorithms for multiple objective programming
• A semidefinite programming approach for solving multiobjective linear programming
• scientific article; zbMATH DE number 2143160 (Why is no real title available?)
• On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
• Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• Constructing efficient solutions structure of multiobjective linear programming

This page was built for publication: An approach for finding efficient points in multiobjective linear programming

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