In this paper a bisecting search algorithm is developed for solving the problem (P) of optimizing a linear function over the set of weakly-efficient solutions of a multiple objective linear program. We show that probl...
详细信息
In this paper a bisecting search algorithm is developed for solving the problem (P) of optimizing a linear function over the set of weakly-efficient solutions of a multiple objective linear program. We show that problem (P) can arise in a variety of practical situations. The algorithm for solving problem (P) is guaranteed to find an optimal or approximately-optimal solution for the problem in a finite number of steps. Using a FORTRAN computer code called CONMIN as an aid, we have solved ten test problems using our proposed algorithm. This preliminary computational experience seems to indicate that the algorithm is quite practical for relatively small problems. [ABSTRACT FROM AUTHOR]
暂无评论