Minimization of a quasi-concave function over an efficient set (Q689154)

The author investigates the nonconvex optimization problem of minimizing a quasiconcave function on the set of efficient points of a linear vector minimization problem. Since all efficient vertices of the polytope given by the linear problem are not known in general, a cutting plane algorithm is presented which can be used for the determination of an approximate solution of this problem in a finite number of steps. It is also shown that this algorithm performs better, if the objective function is linear.