Graphical Method for Two Variables Linear programming

1. A unique Optimal Solution

2. An Infinite Number of Optimal Solutions
3. An Unbounded Solution
4. No Solution

1. A Unique Optimal Solution

Question:
Solve the LPP using Graphical Method:

Objective Function:
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑧 = 20 𝑥1 + 10 𝑥2
Subject to Constraints:
𝑥1 + 2𝑥2 ≤ 40 (1)
3𝑥1 + 𝑥2 ≥ 30 (2)
4𝑥1 + 3𝑥2 ≥ 60 (3)
𝑥1 , 𝑥2 ≥ 0 (4)

𝑆𝑡𝑒𝑝 # 1:
Replace all “Inequalities” into “Equalities”

𝑥1 + 2𝑥2 = 40 (1𝑎)
3𝑥1 + 𝑥2 = 30 (2𝑎)
4𝑥1 + 3𝑥2 = 60 (3𝑎)
𝑆𝑡𝑒𝑝 # 2:
Solve each Equation for the vertices or slopes of 𝑥1 and 𝑥2
𝑥1 + 2𝑥2 = 40 (1𝑏)
𝑥1 2𝑥2 40
+ =
40 40 40
𝑥1 𝑥2
+ =1
40 20
𝑥1 = 40,
𝑥2 = 20
3𝑥1 + 𝑥2 = 30 (2𝑏)
3𝑥1 𝑥2 30
+ =
30 30 30
𝑥1 𝑥2
+ =1
10 30
𝑥1 = 10,
𝑥2 = 30

4𝑥1 + 3𝑥2 = 60 (3𝑐)

4𝑥1 3𝑥2 60
+ =
60 60 60
𝑥1 𝑥2
+ =1
15 20
 𝑥1 = 15,
𝑥2 = 20

𝑆𝑡𝑒𝑝 # 3:

𝑥1 = 40,
𝑥2 = 20, 𝑥1 + 2𝑥2 ≤ 40

𝑥1 = 10,
𝑥2 = 30, 3𝑥1 + 𝑥2 ≥ 30
𝑥1 = 15,
𝑥2 = 20, 4𝑥1 + 3𝑥2 ≥ 60
 A (15,0) = 20 ∗ 15 + 10 ∗ 0 = 300
𝑥2
B (40,0)= 20 ∗ 40 + 10 ∗ 0 = 800
30 C (4,18) = 20 ∗ 4 + 10 ∗ 18 = 260
D (6,12)= 20 ∗ 6 + 10 ∗ 12 = 240(𝑚𝑖𝑛)
The minimum value of Z occurs at
C
20 (6,12). Here the optimal solution is x1
=6, x2 = 18.
D
10
Feasible
Region
B

𝑥1
10 A 20 30 40