Integer Programming
Integer Programming
Integer Programming (IP) is a type of mathematical optimization (or operations research) technique
where some or all of the variables are required to take only integer (whole number) values.
It’s a special case of Linear Programming (LP) — but with a major twist: no fractions or decimals
allowed (at least for the integer variables).
Type Description
So, Integer Programming models are used where discrete decisions are involved.
Problem:
A small workshop makes tables and chairs. Each table earns ₹500, each chair earns ₹250. The
workshop has 40 hours of labor and 45 units of wood.
Wood
Product Labor (hrs) Profit (₹)
(units)
Table 5 10 500
Chair 3 5 250
Unlike regular LP problems, you can’t just use simplex method here because of the integer
restrictions. Some common methods are:
Advantages
Disadvantages
3. Sensitive to Data: Small changes in data may lead to completely different solutions.
Summary
Topic Details
Variables:
• Let
x₁ = number of tables
x₂ = number of chairs
Objective:
• Maximize Profit:
Z = 500x₁ + 250x₂
• Subject to:
• 5x₁ + 3x₂ ≤ 40 (Labor Constraint)
• 10x₁ + 5x₂ ≤ 45 (Wood Constraint)
• x₁, x₂ ≥ 0 (Non-negativity)
• x₁, x₂ ∈ Integers (Integer condition)
First constraint:
• 5x₁ + 3x₂ = 40
• → x₂ = (40 - 5x₁)/3
• Second constraint:
• 10x₁ + 5x₂ = 45
• → x₂ = (45 - 10x₁)/5 = 9 - 2x₁
25x₁ + 15x₂ = 200 — (A)
Subtract:
This suggests that these lines **do not intersect** in the positive region. So the **feasible region is a
triangle** between:
- (0,0)
---
- x₁, x₂ ≥ 0
|----|----|-------------------|--------------------|--------------------|
|0 |0 |0 |0 |0 |
|0 |1 |3 |5 | 250 |
|0 |2 |6 | 10 | 500 |
|0 |3 |9 | 15 | 750 |
| 0 | 4 | 12 | 20 | 1000 |
| 0 | 5 | 15 | 25 | 1250 |
| 0 | 6 | 18 | 30 | 1500 |
| 0 | 7 | 21 | 35 | 1750 |
| 0 | 8 | 24 | 40 | 2000 |
| 0 | 9 | 27 | 45 ✔ | 2250 |
| 0 | 10 | 30 | 50 |— |
Try x₁ = 1:
| x₁ | x₂ | Labor | Wood | Z |
|----|----|-------|------|----|
|1|0 |5 | 10 | 500 |
|1|1 |8 | 15 | 750 |
| 1 | 2 | 11 | 20 | 1000 |
| 1 | 3 | 14 | 25 | 1250 |
| 1 | 4 | 17 | 30 | 1500 |
| 1 | 5 | 20 | 35 | 1750 |
| 1 | 6 | 23 | 40 | 2000 |
| 1 | 7 | 26 | 45 ✔ | 2250 |
| 1 | 8 | 29 | 50 |—|
Try x₁ = 2:
| x₂ | Labor | Wood | Z |
|----|--------|------|----|
| 5 | 25 | 45 ✔ | 2250
Keep going…
Try x₁ = 3:
- x₂ = 3 → Labor = 24, Wood = 45 ✔, Z = 2250
Try x₁ = 4:
Try x₁ = 5:
---
- (0,9)
- (1,7)
- (2,5)
- (3,3)
- (4,1)
So, the workshop can choose **any of these** combinations and still earn ₹2250 profit.
|-------------|-------------|--------|
|0 |9 | ₹2250 |
|1 |7 | ₹2250 |
|2 |5 | ₹2250 |
|3 |3 | ₹2250 |
|4 |1 | ₹2250 |
You can pick whichever suits best based on real-world needs — space, demand, etc.
---
## Final Answer:
> The **maximum profit** is ₹2250, and there are **multiple optimal integer solutions** like:
> (etc.)