# name
Characterizations of efficient solutions under polyhedrality assumptions

# metadata.dc.description[].value
Preprint enviat per a la seva publicació en una revista científica: Methods and Models of Operations Research 35, 221–230 (1991). [https://doi.org/10.1007/BF01415908]

# metadata.dc.description.abstract[].value
We give severa! characterizations of efficient solutions of subsets of RP (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.

# metadata.dc.relation.isformatof[].value
Reproducció digital del document original en paper [CRAI Biblioteca de Matemàtiques i Informàtica - Dipòsit Departament CAIXA 32.16]

# metadata.dc.source[].value
Preprints de Matemàtiques - Mathematics Preprint Series

# metadata.dc.subject.other[].value
Universitat de Barcelona. Institut de Matemàtica

# metadata.dc.title[].value
Characterizations of efficient solutions under polyhedrality assumptions