Discrete optimization

From Wikipedia, the free encyclopedia

Discrete optimization is a branch of optimization in applied mathematics and computer science.

As opposed to continuous optimization, the variables used in the objective function (or some of them) are restricted to assume only discrete values, such as the integers.

Problems of combinatorial optimization can be formulated in terms of discrete optimization, however methods of their solution are often different.