Lexicographic Optimization on Polytopes is Linear Programming

S.H. Tijs

Research output: Working paperDiscussion paperOther research output

262 Downloads (Pure)

Abstract

Finding the lexicographic maximum of a polytope in Rn can be achieved by solving a suitable LP-problem.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages4
Volume2006-89
Publication statusPublished - 2006

Publication series

NameCentER Discussion Paper
Volume2006-89

Keywords

  • lexicographic optimization
  • linear programming

Fingerprint Dive into the research topics of 'Lexicographic Optimization on Polytopes is Linear Programming'. Together they form a unique fingerprint.

  • Cite this

    Tijs, S. H. (2006). Lexicographic Optimization on Polytopes is Linear Programming. (CentER Discussion Paper; Vol. 2006-89). Operations research.