Linear Programming: The Graphical Method

1. Find the common solution of each of the following then graph.

13𝑥 + 𝑦 = −9
a. {
2𝑥 + 5𝑦 = 18
13x + y = –9 2x + 5y = 18
Let x = 0 Let x = 0
13(0) + y = –9 2(0) + 5y = 18
y = –9 5y = 18
y = 18/5
Let y = 0 Let y = 0
13x + (0) = –9 2x + 5(0) = 18
13x = –9 2x = 18
x = –9/13 x=9

7𝑥 + 3𝑦 = 41
b. {
2𝑥 + 5𝑦 = 20
7x + 3y = 41 2x + 5y = 20
Let x = 0 Let x = 0
7(0) + 3y = 41 2(0) + 5y = 20
3y = 41 5y = 20
y = 41/3 y=4
Let y = 0 Let y = 0
7x + 3(0) = 41 2x + 5(0) = 20
7x = 41 2x = 20
x = 41/7 x = 10

4𝑥 − 𝑦 = −40
c. {
3𝑥 + 2𝑦 = 30
4x – y = –40 3x + 2y = 30
Let x = 0 Let x = 0
4(0) – y = –40 3(0) + 2y = 30
–y = –40 2y = 30
y = 40 y = 15
Let y = 0 Let y = 0
4x – (0) = –40 3x + 2(0) = 30
4x = –40 3x = 30
x = –10 x = 10
 𝑥+𝑦 ≥2
𝑥+𝑦 ≤6
d. {
𝑥≥0
𝑦≥0
x+y≥2 x+y≤6
x+y=2 x+y=6
Let x = 0 Let x = 0
(0) + y = 2 (0) + y = 6
y=2 y=6
Let y = 0 Let y = 0
x + (0) = 2 x + (0) = 6
x=2 x=6

x≥0 y≥0
x=0 y=0

𝑥 ≤ 30
𝑥 ≥ 10
e. 𝑥+𝑦 ≥2
𝑥≥0
{ 𝑦≥0
x ≤ 30 x≥0
x = 30 x=0

x ≥ 10 y≥0
x = 10 y=0

x+y≥2
x+y=2
Let x = 0
(0) + y = 2
y=2
Let y = 0
x + (0) = 2
x=2
Applications
1.
The Central City Manufacturing Produces two types of toy model cars, the standby
streamer and the model T. Three machines are required to produce each type; these machines
are classified as MC1, MC2 and MC3. Each standby streamer requires seven minutes process
time on MC1, four minutes on MC2 and 10 minutes on MC3. A model T requires four
minutes on MC1, 15 minutes on MC2 and 16 minutes on MC3. Each day, there are 420
minutes of available time on MC1, 600 minutes on MC2 and 840 minutes on MC3. The
variable cost is Php50 per unit of standby streamers and Php64 per unit for the model T.
Standby streamers sell at a price of Php58 per model, whereas model T sell for Php75 per
model. The company’s fixed cost is Php70 per day.
Using the simplex method, determine the daily production rate for the two models
which will maximize profit.
MC1 MC2 MC3 Profit
Standby 7 4 10 58 – 50
Streamer =8
Model T 4 15 16 75 – 64
= 11
Avail. 420 600 840

Let x = stanby streamer

y = model T
Objective Function:
Max P: 8x + 11y – 70
Constraints:
7x + 4y ≤ 420
4x + 15y ≤ 600
10x + 16y ≤ 840
x, y ≥ 0

New Program
Objective Function:
Max P: 8x + 11y – 70 + 0S1 + 0S2 + 0S3
Constraints:
7x + 4y + S1 = 420
4x + 15y + S2 = 600
10x + 16y + S3 = 840
x, y, S1, S2, S3 ≥ 0

Tableau 1
Product x y S1 S2 S3 RHS
S1 7 4 1 0 0 420
S2 4 15 0 1 0 600
S3 10 16 0 0 1 840
Profit 8 11 0 0 0 0

Tableau 2
Product x y S1 S2 S3 RHS
S1 89/15 0 1 -4/15 0 260
y 4/15 1 0 1/15 0 40
S3 86/15 0 0 -16/15 1 200
Profit 76/15 0 0 -11/15 0 -440
Tableau 3
Product x y S1 S2 S3 RHS
S1 0 0 1 36/43 -89/86 2280/43
y 0 1 0 5/43 -2/43 1320/43
x 1 0 0 -8/43 15/86 1500/43
Profit 0 0 0 9/43 -38/43 -26520/43

Tableau 4
Product x y S1 S2 S3 RHS
S1 0 0 43/36 1 -161/86 2244/43
y 0 1 -5/36 0 7/72 70/3
x 1 0 2/9 0 -1/18 140/3
Profit 0 0 -1/4 0 -5/8 -630

x = 140/3 or 46.67
y = 70/3 or 23.33
Max P: 8(46.67) + 11(23.33) = 630 – 70 = 560

Conclusion:
Therefore, the Central Manufacturing should produce 46.67 standby streamer and
23.33 model T in order to maximize its profit to Php560.

2.
A poultry farmer must supplement the vitamins in the feed he buys. He is considering
two supplements, each of which contains the feed required but in different amounts. He must
meet or exceed the minimum vitamin requirements. The vitamin content per gram of the
supplements is given in the following table.
Vitamin Supplement 1 Supplement 2
1 5 units 25 units
2 25 units 10 units
3 10 units 10 units
4 36 units 20 units

Supplement 1 costs Php5 per gram and Supplement 2 costs Php6 per gram. The feed
must contain at least 50 units of vitamin 1, 100 units of vitamin 2, 60 units of vitamin3 and
180 units of vitamin 4. Determine the combination that has the minimum cost. Using simplex
method.

Vitamin 1 Vitamin 2 Vitamin 3 Vitamin 4 Costs

Supplement 1 5 25 10 36 5
Supplement 2 25 10 10 20 6
Minimum ≥50 ≥100 ≥60 ≥180
Let x = Supplement 1
y = Supplement 2
Objective Function:
Min C: 5x + 6y
Constraints:
5x + 25 y ≥ 50
25x + 10y ≥ 100
10x + 10y ≥ 60
36x + 20y ≥ 180
x, y ≥ 0
New Program
Objective Function:
Min C: 5x + 6y + 0S1 + 0S2 + 0S3 + 0 S4 + 10A1 + 10A2 + 10A3 + 10A4
Constraints:
5x + 25y – S1 + A1 = 50
25x + 10y – S2 + A2 = 100
10x + 10y – S3 + A3 = 60
36x + 20y – S4 + A4 = 180
x, y, S1, S2, S3, S4, A1, A2, A3, A4 ≥ 0

Tableau 1
Cj 5 6 0 0 0 0 10 10 10 10
Prod. Qnty x y S1 S2 S3 S4 A1 A2 A3 A4
10 A1 50 5 25 -1 0 0 0 1 0 0 0
10 A2 100 25 10 0 -1 0 0 0 1 0 0
10 A3 60 10 10 0 0 -1 0 0 0 1 0
10 A4 180 36 20 0 0 0 -1 0 0 0 1
Zj 3900 760 650 -10 -10 -10 -10 10 10 10 10
Cj – Z j -755 -644 10 10 10 10 0 0 0 0

Tableau 2
Cj 5 6 0 0 0 0 10 10 10 10
Prod. Qnty x y S1 S2 S3 S4 A1 A2 A3 A4
10 A1 30 0 23 -1 1/5 0 0 1 -1/5 0 0
5 x 4 1 2/5 0 -1/25 0 0 0 1/25 0 0
10 A3 20 0 6 0 2/5 -1 0 0 -2/5 1 0
10 A4 36 0 28/5 0 36/25 0 -1 0 -36/25 0 1
Zj 880 5 348 -10 101/5 -10 -10 10 -101/5 10 10
Cj – Z j 0 -342 10 -101/5 10 10 0 101/5 0 0

Tableau 3
Cj 5 6 0 0 0 0 10 10 10 10
Prod. Qnty x y S1 S2 S3 S4 A1 A2 A3 A4
6 y 30/23 0 1 -1/23 1/115 0 0 1/23 -1/115 0 0
5 x 80/23 1 0 2/115 -1/23 0 0 -2/115 1/23 0 0
10 A3 280/23 0 0 6/23 8/23 -1 0 -6/23 -8/23 1 0
10 A4 660/23 0 0 28/115 32/23 0 -1 -28/115 -32/23 0 1
Zj 9980/23 5 6 112/23 1981/115 -10 -10 -112/23 -1981/115 10 10
Cj – Z j 0 0 -112/23 -1981/115 10 10 342/23 3131/115 0 0

Tableau 4
Cj 5 6 0 0 0 0 10 10 10 10
Prod. Qnty x y S1 S2 S3 S4 A1 A2 A3 A4
6 y 9/8 0 1 -9/200 0 0 1/160 9/200 0 0 -1/160
5 x 35/8 1 0 1/40 0 0 -1/32 -1/40 0 0 1/32
10 A3 5 0 0 1/5 0 -1 1/4 -1/5 0 1 -1/4
0 S2 165/8 0 0 7/40 1 0 -23/32 -7/40 -1 0 23/32
Zj 629/8 5 6 149/50 0 -10 381/160 -149/50 0 10 -381/160
Cj – Z j 0 0 -149/50 0 10 -381/160 351/50 10 0 1981/160
Tableau 5
Cj 5 6 0 0 0 0 10 10 10 10
Prod. Qnty x y S1 S2 S3 S4 A1 A2 A3 A4
6 y 0
5 x 0
0 S1 1
0 S2 0
Zj
Cj – Z j