Characterizations of efficient solutions under polyhedrality assumptions

Vista senzilla d'ítem
dc.contributor.authorMartínez Legaz, Juan Enrique
dc.date.accessioned2020-03-03T14:40:30Z
dc.date.available2020-03-03T14:40:30Z
dc.date.issued1990
dc.descriptionPreprint 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]ca
dc.description.abstractWe 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.ca
dc.format.extent11 p.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/2445/151825
dc.language.isoengca
dc.publisherUniversitat de Barcelonaca
dc.relation.isformatofReproducció digital del document original en paper [CRAI Biblioteca de Matemàtiques i Informàtica - Dipòsit Departament CAIXA 32.16]
dc.relation.ispartofseriesMathematics Preprint Series; 75ca
dc.rights(c) Juan Enrique Martínez-Legaz, 1990
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
dc.sourcePreprints de Matemàtiques - Mathematics Preprint Series
dc.subject.classificationProgramació (Matemàtica)
dc.subject.otherUniversitat de Barcelona. Institut de Matemàtica
dc.titleCharacterizations of efficient solutions under polyhedrality assumptionsca
dc.typeinfo:eu-repo/semantics/articleca
dc.typeinfo:eu-repo/semantics/submittedVersion

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Miniatura
Nom:
MPS_N075.pdf
Mida:
476.41 KB
Format:
Adobe Portable Document Format
Descripció:
Descarregar

Col·leccions

Preprints de Matemàtiques - Mathematics Preprint Series