An introduction to mixed-integer linear programming: The knapsack problem

Learn how to solve optimization problems in Python using scipy and pyomo

The knapsack problem is probably one of the first problems one faces when studying integer programming, optimization, or operations research. In this problem, from a given set of items, one must choose the most valuable combination to fit in a knapsack of a certain capacity (weight, volume, or both).

Throughout this article, we will implement the knapsack problem in a relaxed form …

introduction linear mixed operations-research optimization programming pyomo python