Bisection Search Algorithm for Optimizing Over the Efficient Set    Thai Quynh Phong and Hoang Quang Tuyen   Abstract We are concerned with the problem of maximizing a linear function over the efficient set related to a multiple-objective linear programming problem. Mathematically, this problem is classified as a global optimization problem. We propose an implementable algorithm, which is hoped to be efficient when the number of criteria is small relative to the number of variables.