Discrete programming

Discrete programming (discrete optimization) is a section of mathematical programming.

In contrast to optimization problems with continuous variables, variables in discrete programming problems take only discrete values, for example, integer values.

The tasks of combinatorial optimization can be solved using discrete programming methods. One of the main methods for solving discrete programming problems is the branch and bound method and dynamic programming.