On Optimization over the Efficient Set in Linear Multicriteria Programming

@inproceedings{Horst2006OnOO,
title={On Optimization over the Efficient Set in Linear Multicriteria Programming},
author={Reiner Horst and Nguyen V. Thoai and Yoshitsugu Yamamoto and Duane Zenke},
year={2006}
}

The efficient set of a linear multicriteria programming problem can be represented by a ’reverse convex constraint’ of the form g(z) ≤ 0, where g is a concave function. Consequently, the problem of optimizing some real function over the efficient set belongs to an important problem class of global optimization called reverse convex programming. Since the concave function used in the literature is only defined on some set containing the feasible set of the underlying multicriteria programming… CONTINUE READING