Global Information Lookup Global Information

Special ordered set information


In discrete optimization, a special ordered set (SOS) is an ordered set of variables used as an additional way to specify integrality conditions in an optimization model. Special order sets are basically a device or tool used in branch and bound methods for branching on sets of variables, rather than individual variables, as in ordinary mixed integer programming. Knowing that a variable is part of a set and that it is ordered gives the branch and bound algorithm a more intelligent way to face the optimization problem, helping to speed up the search procedure. The members of a special ordered set individually may be continuous or discrete variables in any combination. However, even when all the members are themselves continuous, a model containing one or more special ordered sets becomes a discrete optimization problem requiring a mixed integer optimizer for its solution.

The ‘only’ benefit of using Special Ordered Sets compared with using only constraints is that the search procedure will generally be noticeably faster.[1] As per J.A. Tomlin, Special Order Sets provide a powerful means of modeling nonconvex functions and discrete requirements, though there has been a tendency to think of them only in terms of multiple-choice zero-one programming.[2]

  1. ^ Christelle Gueret, Christian Prins, Marc Sevaux, "Applications of optimization with Xpress-MP", Editions Eyrolles, Paris, France (2000), ISBN 0-9543503-0-8, pag 39-42 Link to PDF
  2. ^ J.A. Tomlin, "Special Ordered Sets and an Application to Gas Supply Operations Planning", Ketron Management Science, Inc., Mountain View, CA 94040-1266, USA

and 20 Related for: Special ordered set information

Request time (Page generated in 0.8684 seconds.)

Special ordered set

Last Update:

In discrete optimization, a special ordered set (SOS) is an ordered set of variables used as an additional way to specify integrality conditions in an...

Word Count : 819

Partially ordered set

Last Update:

partially ordered set (poset for short) is an ordered pair P = ( X , ≤ ) {\displaystyle P=(X,\leq )} of a set X {\displaystyle X} (called the ground set of P...

Word Count : 5395

Lexicographic order

Last Update:

order of the dictionaries to sequences of ordered symbols or, more generally, of elements of a totally ordered set. There are several variants and generalizations...

Word Count : 3352

Order theory

Last Update:

section introduces ordered sets by building upon the concepts of set theory, arithmetic, and binary relations. Orders are special binary relations. Suppose...

Word Count : 4508

Cartesian product

Last Update:

mathematics, specifically set theory, the Cartesian product of two sets A and B, denoted A × B, is the set of all ordered pairs (a, b) where a is in...

Word Count : 2818

Cyclic order

Last Update:

requirement results in a partial cyclic order. A set with a cyclic order is called a cyclically ordered set or simply a cycle.[nb] Some familiar cycles are...

Word Count : 6381

Infimum and supremum

Last Update:

(abbreviated inf; plural infima) of a subset S {\displaystyle S} of a partially ordered set P {\displaystyle P} is the greatest element in P {\displaystyle P} that...

Word Count : 4346

Ordered field

Last Update:

orderings. Every subfield of an ordered field is also an ordered field in the inherited order. Every ordered field contains an ordered subfield that is isomorphic...

Word Count : 2210

Real number

Last Update:

largest ordered set that is complete and locally Archimedean. As with the previous two examples, this set is no longer a field or additive group. Ordered fields...

Word Count : 7702

Monotonic function

Last Update:

mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose...

Word Count : 2467

Order type

Last Update:

In mathematics, especially in set theory, two ordered sets X and Y are said to have the same order type if they are order isomorphic, that is, if there...

Word Count : 695

Ordinal number

Last Update:

set with no particular structure on it, the ordinals are intimately linked with the special kind of sets that are called well-ordered. A well-ordered...

Word Count : 6711

Ordered liberty

Last Update:

Ordered liberty is a concept in political philosophy, where individual freedom is balanced with the necessity for maintaining social order. In "Ordered...

Word Count : 1822

Complete lattice

Last Update:

In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice that satisfies...

Word Count : 2619

SOS2

Last Update:

SOS2 may refer to: Son of Sevenless, a set of encoding genes Special ordered set of type 2, a structure in discrete optimization This disambiguation page...

Word Count : 60

Mueller special counsel investigation

Last Update:

The Robert Mueller special counsel investigation was an investigation into 45th U.S. president Donald Trump regarding Russian interference in the 2016...

Word Count : 18151

Binary relation

Last Update:

{\displaystyle (x,y)} belongs to the set of ordered pairs that defines the binary relation. A binary relation is the most studied special case n = 2 {\displaystyle...

Word Count : 8911

United Kingdom Special Forces

Last Update:

Special Forces (UKSF) is a directorate comprising the Special Air Service, the Special Boat Service, the Special Reconnaissance Regiment, the Special...

Word Count : 1521

Fuzzy set

Last Update:

[0, 1]. Fuzzy sets generalize classical sets, since the indicator functions (aka characteristic functions) of classical sets are special cases of the membership...

Word Count : 7683

Glossary of set theory

Last Update:

ωε=ε η 1.  The order type of the rational numbers 2.  An eta set, a type of ordered set 3.  ηα is an Erdős cardinal θ The order type of the real numbers...

Word Count : 11511

PDF Search Engine © AllGlobal.net