An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

0.00 Avg rating0 Votes
Article ID: iaor1998427
Country: Netherlands
Volume: 19
Issue: 3
Start Page Number: 87
End Page Number: 94
Publication Date: Aug 1996
Journal: Operations Research Letters
Authors:
Abstract:

We propose a method for finding the efficient set of a multiple objective linear program based on the well-known facial decomposition of the efficient set. The method incorporates a simple linear programming test that identifies efficient faces while employing a top-down search strategy which avoids enumeration of efficient extreme points and locates the maximally efficient faces of the feasible region. We suggest that discrete representations of the efficient faces could be obtained and presented to the Decision Maker. Results of computational experiments are reported.

Reviews

Required fields are marked *. Your email address will not be published.