Graphical Linear Programming

Graphical linear programming involves plotting

the constraints on a rectangular coordinate
plane and identifying an area that will satisfy
all the given constraints. This area is known as
the feasible solution area which contains the
combination of values for the decision
variables that simultaneously satisfy all the
restrictions in a linear program. However, it
has been proven that the maximum or
minimum value always occurs at a vertex of
Steps to Follow in Using Graphical Method
Step 1: Formulate the linear program.
Step 2: Solve for the x and y intercepts after
converting the inequality sign with an equal
sign. (Intercept Method)
Step 3: Graph the constraints and identify the
feasible solution area.
Step 4: Solve for the coordinates of the Corner
Points by Substitution or Elimination Method.
Step 5: Substitute the coordinates of the Corner
Points to the objective function to find the
Optimum Solution.
Step 6: Formulate your decision by choosing the
Example 1:
An appliance manufacturer produces two models of electric
fans and desk fans. Both models require fabrications and
assembly work. Each stand fan uses 4 hours of fabrication
and 2 hours of assembly and each desk fan uses 2 hours of
fabrication and 6 hours of assembly. There are 600 fabrication
hours available per week and 480 hours of assembly. Each
stand
Stepfan contributes
1: Linear Program P400 to profits and each desk fan
contributes P300 Let to profits.
x = no. of stand fans to produce
y = no. of desk fans to produce
Maximize: P = 400x + 300y
Subject to: 4x + 2y ≤ 600 (Fabrication Time)
2x + 6y ≤ 480 (Assembly Time)
x,y ≥ 0 (Non-negativity)
Step 2: Intercept Method
1. 4x + 2y = 600 2. 2x +
6y
X = 480
0 150 X 0 240
y 300 0 y 80 0
 1. 4x + 2y = 600 2. 2x +
6y = 480
X 0 150 X 0 240
y 300 0 y 80 0

Step 3: Feasible Solution Area Step 4: Corner Points

A ( 0,0)
B ( 0,80)
C ( 132,36 )
D ( 150,0 )

C
A
D
Step 4: Corner Points
A ( 0,0)
B ( 0,80)
C ( 132,36 )
D ( 150,0 )
Step 5: Optimum Solution

Maximize: P = 400x + 300y

At A A(0,0), P = 400(0) + 300(0) = 0

At B B(0,80), P = 400(0) + 300(80) = 24,000
At C C(132,36), P = 400(132) + 300(36) = 63,600
At D D(150,0), P = 400(150) + 300(0) = 60,000

Step 6: Decision
x = 132 stand fans
y = 36 desk fans
Maximum Profit: P63,600
Slack and Surplus
In addition to knowing the optimal solution of a linear
program, it is helpful to know whether all of the available
resources are being used.
Slack is used for the amount of a resource that is not
used. For a ≤ constraint,

Slack = (Amount of resource available) – (Amount of resource

used)

Ex. There were 240 hours of carpentry time available. If

the company decided to produce 25 tables and 30 chairs
instead of the optimal solution, the amount of carpentry
time used (4x + 3y) would be
4(25) + 3(30) = 190.

So Slack time in carpentry = 240 – 190 = 50

Surplus is used with ≥ constraint to indicate the amount
by which the righthand side of a constraint is exceeded.

Surplus = (Actual amount) – (Minimum amount)

Suppose there had been a constraint in the example that

required the total number of tables and chairs combined to
be at least 40 units (i.e., x + y ≥ 40) and the company
decided to produce 25 tables and 30 chairs.

The total amount produced would be 25 + 30 = 55,

so the surplus would be Surplus = 55 – 40 = 15

Meaning that 15 units more than the minimum were

produced.
 Maximize: P = 400x + 300y
Subject to: 4x + 2y ≤ 600
(Fabrication Time)
2x + 6y ≤ 480
(Assembly Time)
Decision
x = 132 stand fans x,y ≥ 0
(Non-negativity)
y = 36 desk fans
Maximum Profit: P63,600

4(132) + 2(36) = 600

600 - 600 = 0 (Slack -
Fabrication Time)

2(132) + 6(36) = 480

480 - 480 = 0 (Slack -
Assembly Time)
Example 2:
Consider Example on Geena is the Production Manager of Clear
Shampoo and she wants to determine the production mix that will
result in maximum profit.
Step 1: Linear Program
Let x = no. of case of Men’s shampoo
y = no. of case of Women’s shampoo
Maximize: P = $6x + $8y
Subject to: 5x + 10y ≤ 100
7x + 7y ≤ 84
9x + 5y ≤ 90
x,y ≥ 0
Step 2: Intercept Method

1. 5x + 10y = 100 2. 7x + 7y = 84 3. 9x + 5y =
90
X 0 20 X 0 12 X 0 10
y 10 0 y 12 0 y 18 0
1. 5x + 10y = 100 2. 7x + 7y = 84 3. 9x + 5y =
90
X 0 20 X 0 12 X 0 10
y 10 0 y 12 0 y 18 0

Step 3: Feasible Solution Area Step 4: Corner Points

A ( 0,0)
B ( 0,10)
C ( 4,8 )
D ( 7.5, 4.5 )
E (10, 0)
Step 4: Corner Points
A ( 0,0)
B ( 0,10)
C ( 4,8 )
D ( 7.5, 4.5 )
E (10, 0)

Step 5: Optimum Solution

Maximize: P = $6x + $8y
At A A(0,0), P = 6(0) + 8(0) = 0
At B B ( 0,10) P = 6(0) + 8(10) = 80
At C C ( 4,8 ) P = 6(4) + 8(8) = 88
At D D ( 7.5,4.5 ) P = 6(7.5) + 8(4.5) = 81
At E E (10, 0) P = 6(10) + 8(0) = 60

Step 6: Decision
x = 4 cases of Men’s shampoo
y = 8 cases of Women’s shampoo
Maximum Profit: $88
Example 3:
Bernadette is planning to reduce the operational cost in managing
her farm business to increase her profit. In doing so, she must
determine how many post production harvest equipment to build. Its
objective and constraint are as follows:

Minimize: C = P50x + P60y

Subject to: x + 2y ≥ 10
3x + 2y ≤ 18
x≥2
x,y ≥ 0

Step 2: Intercept Method

1. x + 2y = 10 2. 3x + 2y = 18 3.
X x =02 10 X 0 6
y 5 0 y 9 0
Step 2: Intercept Method
1. x + 2y = 10 2. 3x + 2y = 18 3.
X x =02 10 X 0 6
y 5 0 y 9 0

Step 3: Feasible Solution Area

Step 4: Corner Points
A ( 2,4)
B ( 2,6)
C ( 4,3 )

Subject to: x + 2y ≥ 10
3x + 2y ≤ 18
x≥2
Step 4: Corner Points
A ( 2,4)
B ( 2,6)
C ( 4,3 )

Step 5: Optimum Solution

Minimize: C = P50x + P60y
At A A(2,4) C = 50(2) +60(4) = 340
At B B(2,6) C = 50(2) +60(6) = 460
At CC(4,3) C = 50(4) +60(3) = 380

Step 6: Decision

x=2
y=4
Minimum Cost: P340
Example 4:
Karen is the Head Buyer of Coca-Cola and she wants to determine the supply
mix that will result on minimum cost. She is able to determine the data necessary for
her to make a decision. A kilogram of Equal Sweetener can produce 4 liters of Coke
Lite, 6 liters of Sprite Lite and 10 liters of Coke Zero. A kilogram of Nutra Sweetener
can produce 12 liters of Coke Lite, 8 liters of Sprite Lite and 5 liters of Coke Zero.
Karen must produce at least 96 liters of Coke Lite, 96 liters of Sprite Lite and 100
liters of Coke Zero per day. Equal sweetener cost $27 per kilogram while Nutra
sweetener costs $30 per kilogram. How many kilograms of Equal sweetener and
Nutra sweetener should she purchase per day to minimize costs? How much is the
total cost?

LP Model:
X = kg. of Equal Sweetener
Y = kg. of Nutra Sweetener
Min. : C = 27x + 30y
Subject to:
4x +12y ≥ 96
6x + 8y ≥ 96
10x + 5y ≥ 100
x, y ≥ 0

Step 2: Intercept Method

 4x +12y = 96 6x + 8y = 96 10x + 5y = 100

X 0 24 X 0 16 X 0 10
y 8 0 y 12 0 y 20 0
 4x +12y = 96 6x + 8y = 96 10x + 5y = 100
X 0 24 X 0 16 X 0 10
y 8 0 y 12 0 y 20 0
Step 3: Feasible Solution Area Step 4: Corner Points
A (24,0)
B (9.6, 4.8)
C (6.4, 7.2)
D (0,20)
 Step 4: Corner Points
A (24,0)
B (9.6, 4.8)
C (6.4, 7.2)
D (0,20)

Step 5: Optimum Solution

Min. : C=27x + 30y
At A A (24, 0) C= 27(24)+30(0)= 648
At B B (9.6,4.8) C= 27(9.6)+30(4.8)= 403.2
At CC (6.4, 7.2) C = 27(6.4)+30(7.2)= 388.8
At DD (0, 20) C = 27(0)+30(20) = 600

Step 6: Decision
Subject to:
X= 6.4 4x +12y ≥ 96
Y = 7.2 6x + 8y ≥ 96
Minimum Cost: = 388.8 10x + 5y ≥ 100