Determination of the efficient set in multiobjective linear programming
Journal of Optimization Theory and Applications
Finding all maximal efficient faces in multiobjective linear programming
Mathematical Programming: Series A and B
Complete efficiency and the initialization of algorithms for multiple objective programming
Operations Research Letters
Computational Study of the Relationships Between Feasible and Efficient Sets and an Approximation
Computational Optimization and Applications
Optimization over the efficient set: overview
Journal of Global Optimization
Maximal descriptor set characterizations of efficient faces in multiple objective linear programming
Operations Research Letters
Hi-index | 0.00 |
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.