In this paper we present a new feasible direction method to find all efficient extreme points for bicriterion linear fractional programming problems. This method is based on the conjugate gradient projection method. An initial feasible point is used to generate all efficient extreme points for this problem through a sequence of feasible directions of movements Since methods based on vertex information may have difficulties as the problem size increases we expect this method to be less sensitive to problem size. A simple production example is given to clarify this method

Login to Download PDF

Please login with your Paper ID and password to access the full PDF.

🔑 Login to Download