LEXICO
lexicographic_ordering_constraint1 <…lexicographic_ordering_constraintn> ;
LEXORDER
lexicographic_ordering_constraint1 <…lexicographic_ordering_constraintn> ;
where lexicographic_ordering_constraint is specified in the following form:
((variablelist1) order_type (variablelist2))
where variablelist1 and variablelist2 are variable lists of equal length. The keyword order_type signifies the type of ordering and can be one of two values: LEX_LE, which indicates lexicographically less than or equal to (), or LEX_LT, which indicates lexicographically less than ().
The LEXICO statement specifies one or more lexicographic constraints. The lexicographic constraint and the strict lexicographic constraint are defined as follows. Given two tuples and , the tuple is lexicographically less than or equal to () if and only if

The tuple is lexicographically less than () if and only if and . Equivalently, if and only if

Informally you can think of the lexicographic constraint as sorting the tuples in alphabetical order. Mathematically, is a partial order on a given subset of tuples, and is a strict partial order on a given subset of tuples (Brualdi, 2010).
For example, you can express the lexicographic constraint by using a LEXICO statement as follows:
lexico( (x1x6) lex_le (y1y6) );
The assignment , , , , , , , , , , , and satisfies this constraint because for and . The fact that is irrelevant in this ordering.
Lexicographic ordering constraints can be useful for breaking a certain kind of symmetry that arises in CSPs with matrices of decision variables. Frisch et al. (2002) introduce an optimal algorithm to establish GAC (generalized arc consistency) for the constraint between two vectors of variables.