Recently Kornbluth and Steuer have developed a simplex-based algorithm for finding all weakly-efficient vertices of an augmented feasible region of a multiple objective linear fractional programming problem. As part of this algorithm, they presented a method for detecting certain...

In this paper we study the multiple objective linear programming problem with parametric criteria coefficients. This problem is of interest since in many situations the coefficients of the objective functions of a multiple objective linear program either represent estimates of the true data or...