Navigation Menu
🗂️ All Tools (Master Menu)
Home
☀️ Switch to Light Theme
Integer Linear Programming Solver
Branch & Bound algorithm • Optimal solutions • Live visualization
Problem Definition
Problem Type
📈
Maximize
📉
Minimize
Example Problems
🎒 Knapsack
🏭 Production
📋 Assignment
🔢 Simple 2D
Number of Variables
Objective Function (c
T
x)
3 2
Constraints (Ax ≤ b)
✕
✕
➕ Add Constraint
Variable Bounds
Animation Speed
500ms
🔍 Solve Problem
🔄 Reset
💾 Export Solution
Search Statistics
Nodes Explored
0
Nodes Pruned
0
Current Bound
-
Best Value
-
Time
0.0s
Status
Ready
Optimal Solution Found! ✨
Objective Function Value
0
Branch & Bound Tree
Search Log
Solver ready. Configure your problem and click Solve.