Abstract:
Proper Efficiency in Nonconvex Vector-Maximization-Problems with Polyhedral Domination
Structure
Vector-maximization-problems arise when more than one objective function are to be simulta
neously 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 multicriteria decision problems, the trade-offs play an
important role and are related to the weighted sum programs. When the trade-offs belong to an
interval, we obtain a polyhedral structure of dominance. In this paper, a generalization is pr
ovided for the characterization of the properly efficient solutions, as solutions of some para
metric programmig.