Name: _____Hayna Marie D.

Aguilar_______________ Date: _March 12, 2021__________

Course/Yr./Blk: _BS Accountancy 1B____________Class Sched: _10:30 – 12:00 M/Th___

Exercise 1
Linear Programming

Resources
Products Cotton Silk Wool
Gown 3 2 1
Suit 2 4 0

Available: 18 m2 cotton, 20 m2 silk and 5 m2 wool

Gown (X1) = P 1,200
Suit(X2) = P 1,600
1. Formulate the objective function
Z = 1,200x1 + 1,600x2

2. Formulate the constraints.

3x1 + 2x2 ≤ 18
2x1 + 4x2 ≤ 20
X1 ≤ 5
X1 X2 ≥ 0

3. What is the optimal solution?

C1 If x1 = 0 C2 If x1 = 0 C3 If x1 = 0
3x1 + 2x2 ≤ 18 2x1 + 4x2 ≤ 20 x1 ≤ 5
3(0) + 2x2 = 18 2(0) + 4x2 = 20 1(0) = 5
2x = 18 4x = 20 x=0
2 4
X2 = 9 x=5
X1 X2
If x2 = 0 If x2 = 0
3x1 + 2x2 ≤ 18 2x1 + 4x2 ≤ 20 0 0
3x1+ 2(0) = 18 2x1 + 4(0) = 20
3x = 18 2x = 20
3 2
X1 = 6 x = 10

X1 X2 X1 X2

0 9 0 5

6 0 10 0
 Coordinates: C1 = (0, 9), (6, 10)
C2 = (0, 5), (10, 0)
C3 = (0, 0)

10

Point 2: (0, 5)
5
Point 3: (4, 3)

Feasible
Region
Point 4: (6, 0)
Point 1: (0, 0)
0 5 10
For finding the exact coordinates of Point 3:

3x1 + 2x2 ≤ 18
2x1 + 4x2 ≤ 20
Substitute:
2(3x1 + 2x2 = 18) 3x1 + 2x2 = 18
6x1 + 4x2 = 36 3(4) + 2x2 = 18
- 2x1 + 4x2 =20 12 + 2x2 = 18
4x1 = 16 2x2 = 18 - 12
4 4 2x2 = 6
X1 = 4 2 2
X2 = 3

Point Z = 1,200x1 + 1,600x2

1 (0, 0) 1,200(0) + 1,600(0) = 0
2 (0, 5) 1,200(0) + 1,600(5) = 8,000
3 (4, 3) 1,200(4) + 1,600(3) = 9,600
4 (6, 0) 1,200(6) + 1,600(0) = 7,200

Therefore the optimal solution occurs at point 3 and it is X1 = 4 and x2 = 3 and the corresponding
Objection Function Value is P 9,600.

4. Formulate the decision

The tailor should make 4 gowns and 3 suits to obtain the maximum amount of money
which is P 9,600,
To check:

3x1 + 2x2 ≤ 18 2x1 + 4x2 ≤ 20 X1 ≤ 5

3(4) + 2(3) ≤ 18 2(4) + 4(3) ≤ 20 4≤5
12 + 6 ≤ 18 8 + 12 ≤ 20
18 ≤ 18 20 ≤ 20