Linear Programming:

Graphical Method 2
Example 1: Maximization Problem

A local boutique produced two designs of gowns A and B and has the following
materials available: 18 square meters of cotton,
20 square meters of silk, and
5 square meters of wool.

Design A requires the following: 3 square meters of cotton,

2 square meters of silk and
1 square meter of wool.

Design B requires the following: 2 square meters of cotton,

4 square meters of silk.

If Design A sells for ₧1,200 and Design B for ₧1,600, how many of each garment
should the boutique produce to obtain the maximum amount of money?
Solution for Example 1

Let x be the number of Design A gowns, and

y be the number of Design B gowns.

Materials Design A (x) Design B (y) Available

Cotton 3 2 18
Silk 2 4 20
Wool 1 0 5
Profit ₧1,200 ₧1,600  
Solution for Example 1

Maximize: P = 1,200x + 1,600y ® Objective Function

Subject to:
3x + 2y £ 18 Þ Cotton
2x + 4y £ 20 Þ Silk Structural Constraints
x £ 5 Þ Wool
x ³ 0, y ³ 0 ® Non-negativity Constraints
Solution for Example 1

3x + 2y £ 18

3x + 2y = 18 (0, 9) (6, 0)

2x + 4y £ 20
2x + 4y = 20 (0, 5) (10, 0)

x£5
x=5
Plotting of Graphs

(0, 9) ⬤ 3x + 2y = 18

x=5

(0, 5) ⬤

2x + 4y = 20

⬤ ⬤ ⬤
(5, 0) (10, 0)
(6, 0)
Determining the Feasible Region

⬤ 3x + 2y £ 18

x£5

✗ ✗
⬤
✗ 2x + 4y £ 20

Feasible ✗
Region
✗ ✗
⬤ ⬤ ⬤
Identifying the Extreme Points

x£5
⬤ 3x + 2y £ 18
Intersection of 1st
Eq. & 2nd Eq.

(0, 5) ⬤ Intersection of 1st

Eq. & 3rd Eq.
⬤
2x + 4y £ 20
Feasible
⬤
Region
⬤ ⬤ ⬤
(5, 0)
Solution for 1st Equation and 2nd Equation

2(3x + 2y = 18) Þ 6x + 4y = 36
3(2x + 4y = 20) Þ (–) 6x + 12y = 60
0x – 8y = –24
– 8y = –24
y=3
3x + 2(3) = 18
3x + 6 = 18
The intersection of first equation and
3x = 18 – 6
second equation is (4, 3).
3x = 12
x=4
Solution for 1st Equation and 3rd Equation

3x + 2y = 18
x=5

3(5) + 2y = 18 Directly substitute x = 5 to the 3x + 2y = 18.

15 + 2y = 18
2y = 18 – 15
2y = 3
The intersection of first equation and
y = 1.5 third equation is (5, 1.5).
Extreme Points

x≤5
⬤ 3x + 2y ≤ 18

(0, 5) ⬤
(4, 3)
⬤
2x + 4y ≤ 20
Feasible (5, 1.5)
⬤
Region
⬤ ⬤ ⬤
(5, 0)
Optimal Solution for Example 1

Objective Function: P = 1,200x + 1,600y

Extreme points Values of the objective function

(0, 5) 1,200(0) + 1,600(5) = 0 + 8,000 = 8,000 Optimal
(5, 0) 1,200(5) + 1,600(0) = 6,000 + 0 = 6,000 Value

(4, 3) 1,200(4) + 1,600(3) = 4,800 + 4,800 = 9,600

(5, 1.5) 1,200(5) + 1,600(1.5) = 6,000 + 2,400 = 8,400

Decision: P = ₧9,600
x = 4 Design A gowns
y = 3 Design B gowns
Checking
Solution: (x, y) = (4, 3)

Constraint for Cotton

3x + 2y £ 18 Þ 3(4) + 2(3) £ 18 Þ 12 + 6 £ 18 Þ 18 £ 18

Constraint for Silk

2x + 4y £ 20 Þ 2(4) + 4(3) £ 20 Þ 8 + 12 £ 20 Þ 20 £ 20

There is an excess of 1
Constraint for Wool square meter of wool
x£5 Þ4£5
 Objective Function

⬤
P5 = 1,200x + 1,600y
P4 = 1,200x + 1,600y
P3 = 1,200x + 1,600y
P2 = 1,200x + 1,600y
P1 = 1,200x + 1,600y ⬤

⬤
Feasible
⬤
Region
⬤ ⬤ ⬤