The problem of optimizing some contiuous function over the efficient set of
a multiple objective programming problem can be formulated as a nonconvex
global optimization problem with special structure. Based on the conical br
anch and bound algorithm in global optimization, we establish an algorithm
for optimizing over efficient sets and discuss about the implementation of
this algorithm for some interesting special cases including the case of bio
bjective programming problems.