, Volume 35, Issue 3, pp 221-230

Characterizations of efficient solutions under polyhedrality assumptions

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Summary

We give several characterizations of efficient solutions of subsets ofR p (with respect to compatible preorders) in terms of the lexicographical order, under the assumptions that the set of admissible points is a convex polyhedron or the nonnegative cone corresponding to the preorder is polyhedral. We also characterize the lexicographical minimum of a convex polyhedron by means of the componentwise order and unitary lower triangular matrices.

Financial support from the Dirección General de Investigación Cientifica y Técnica (DGICYT), under project PS89-0058, is gratefully acknowledged.