Integer Programming Solver
Solve integer linear programming problems using Branch and Bound algorithm
Related solvers
Enter Your Problem
Maximize Z =
x1+
x2
Select which variables must be integers:
x1+
x2
x1+
x2
CSV: meta / objective / constraint rows (+ optional integer flags). After Solve, also Export results CSV.
Theory of Integer Programming
Example Problem:
Maximize: Z = 3x₁ + 5x₂
Subject to:
- x₁ + 2x₂ ≤ 10
- 2x₁ + x₂ ≤ 12
- x₁, x₂ ≥ 0 and integer
Step-by-Step Solution Preview:
1. Solve LP relaxation: x₁ = 4.67, x₂ = 2.67, Z = 28.67
2. Branch on x₁: Create subproblems with x₁ ≤ 4 and x₁ ≥ 5
3. Solve both subproblems using Simplex
4. Continue branching until all variables are integer
5. Optimal integer solution: x₁ = 4, x₂ = 3, Z = 27
1. What is Branch and Bound primarily used for?
2. What does the "Branch" step in Branch and Bound do?
3. When can a branch be pruned in Branch and Bound?
4. What is the LP relaxation in Branch and Bound?