An ordering of a set of vectors based on the lexicopositive (negative) properties of the vectors. For example, the sequence of vectors {xv1,..., xvq} is ordered in a lexicographic sense if xvi − xvj is lexico-positive for i > j. Such orderings are similar to dictionary ordering of words and are used to prove finiteness of the simplex algorithm. Cycling; Lexico-positive vector.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Lexicographic ordering . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_531
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_531
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive