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

  • Sayin S
  • 6


    Mendeley users who have this article in their library.
  • 30


    Citations of this article.


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.

Author-supplied keywords

  • Efficient faces
  • Efficient set
  • Multiple objective linear programming
  • Vector maximization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Serpil Sayin

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free