Proper efficiency in nonconvex vector-maximization-problems

Vector-maximization-problems arise when more than one objective function are to be simultaneously maximized over a feasibility region. The concept of proper efficiency has been introduced by Geoffrion in order to eliminate points of a certain anomalous type. In this paper, a generalization is provided for the characterization of the properly efficient solutions, as solutions of some parametric programming problems. A specific characterization is given in the case of bicriterion programs.