Special ordered set
From Wikipedia, the free encyclopedia
In discrete optimization, a special ordered set is a set of variables such that only one (or zero) of them may be nonzero.
Often one distinguishes between special ordered sets of type one and type two. In a special ordered set of type two zero, one or two items may be non-zero. If there are two non-zero items the have to follow one after the other in the set.
[edit] Examples
- Imagine a special ordered set of type one containing the elements 1, 2, 3, 4 and 5. In it none or exactly one of 1-5 may be non-zero.
- Imagine a special ordered set of type two containing the same elements. In it none, exactly one if 1-5 or (1 and 2), (2 and 3), (3 and 4), or (4 and 5) may be non-zero.