Discrete

These problems contain decision variables which only take 0 or 1 ie. they are binary decision variables.

Examples

0/1 Knapsack problem

The 0/1 knapsack problem is a binary optimization problem where each item must be either entirely selected or not selected, subject to a weight (or capacity) constraint, with the goal of maximizing total value. Fractional selection is not allowed, which makes the problem combinatorial and NP-hard.