Sayın, S.2016-02-082016-02-0819960167-6377http://hdl.handle.net/11693/25796We 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.EnglishEfficient facesEfficient setMultiple objective linear programmingVector maximizationComputational methodsDecision makingLinear programmingMultiprogrammingOperations researchOptimizationSet theoryVectorsDecision makerFacial decompositionLinear programming testTop down search strategyAlgorithmsArticle10.1016/0167-6377(95)00046-11872-7468