# Knapsack problem

### From Glossary

An integer program of the form,

where . The original problem models the maximum value of a knapsack that is limited by volume or weight , where is the number of items of type put into the knapsack at unit return , that uses units per item.

The * group knapsack problem* has this form, except that it pertains to Gomory's
corner polyhedron problem for general integer programming.

The * multi-dimensional knapsack problem* has more constraints (e.g., volume and weight),
, where with and .