Another example of Linear Programming:

Problem:
The Balelo Company manufactures vases and candle holders using only two materials: labor and
resin. Given these two finite resources, the corporation want to determine the optimal daily
production of vases and candle holders. This is referred regarded as a product mix problem in
general. There are 40 hours of labor and 120 grams of resins available each day for production.
The two items use the following resources for manufacturing and generate the following profit
per item produced.
Labor Resin Profit
Product (hr/unit) (gm/unit) (Php / unit)
Vase 1 4 40
Candle holder 2 3 50

Step 1: Define the decision variable

How many vases and candle holder to produce?
Decision variable:
x1 = number of vases produced
x2 = number of candle holder produced
Step 2: Objective Function:
Maximize Z = Php 40x1 + 50x2
Php 40x1 = profit form vase
Php 50x2 = profit form candle holder
Step 3: Model Constraints
x1 + 2x2 ≤ 40 hr. of labor
4x1 + 3x2 ≤ 120grms of resins
x1, x2 ≥ 0
Complete linear Programming model:
Maximize Z = Php 40x1 + 50x2
Subject to:
x1 + 2x2 ≤ 40 hr. of labor
4x1 + 3x2 ≤ 120grms of resins
x1, x2 ≥ 0
 Where:
x1 = number of vases produced
x2 = number of candle holder produced

x1 + 2x2 ≤ 40 hr. of labor

(Assumption: x1 = 5 vases; and x2 = 10 candle holders – for us to get possible solution, since it
is not given to the problem)
(5) + 2(10) ≤ 40 hr. of labor
5 + 20 ≤ 40
25 ≤ 40
4x1 + 3x2 ≤ 120grms of resins
4(5) + 3(10) ≤ 120
20+ 30 ≤ 120
50 ≤ 120
Note: Because neither the constraint is violated by this hypothetical solution, we can say the
solution is feasible or possible
Step 4: Solution:
Feasible Solution: (trial and error)
Maximize Z = Php 40x1 + 50x2
Z = 40x1 + 50x2
Z= 40(5) + 50(10)
Z = 200 + 500
Z = Php 700
Let’s compute for an infeasible solution:
(Assumption: x1 = 10 vases; and x2 = 20 candle holders – for us to get possible solution, since it
is not given to the problem)
Z = 40x1 + 50x2
Z = 40(10) + 50 (20)
Z = 400 + 1000
Z = Php 1,400.00
For checking if feasible:
x1 + 2x2 ≤ 40 hr. of labor
10 + 2(20) ≤40
50 ≤ 40 - It is infeasible since it violates the resource constraints for labor
Optimal Solution:
The solution to this problem must maximize the profit without violating the constraints.
x1 = 24, x2 = 8
Z = 40x1 + 50x2
Z = 40 (24) + 50 (8)
Z = 960 + 400
Z = Php 1,360
For checking if feasible:
x1 + 2x2 ≤ 40 hr. of labor
24 + 2(8) ≤40
24 + 16 ≤40
40 = 40

GRAPHING SOLUTION:
1. Constraints line plotted as equation X2
Consider the line 1 (labor constraint)
50
x1 + 2x2 ≤ 40 hrs of labor
40
x1 + 2x2 = 40 x1 + 2x2 = 40
30
(0) + 2x2 = 40 x1 +2(0) = 40
20
x2 = 40/2 x1 = 40
x2 = 20 10

X1
0 10 20 30 40 50
Consider the line 2 (resin constraint) X2
4x1 + 3x2 ≤ 120grms of resins
4x1 + 3x2 = 120 4x1 +3x2 = 120 50

4 (0) + 3x2 = 120 4x1 + 3(0) =120 40

x2 = 120 / 3 x1 = 120 / 4 30

x2 = 40 x1 = 30 20

10
X1
0 10 20 30 40 50

2. Optimal Solution

X2

50

40
Point A: x1=0 ; x2= 20
30
A
20

10
B
Point C: x1=30 ; x2= 0
C X1
0 10 20 30 40 50

Point B = ? (Determine the solution values mathematically once the optimal solution points on
the graph have been determined)
a. Convert the both equations to function of x1
x1 + 2x2 = 40 4x1 + 3x2 = 120
x1= 40- 2x2 4x1 = 120-3x2
x1 = 30 – (3x2/4)
b. Let x2 in the first equation equal x

40-2x2 = 30-(3x2/4)
[40-2x2 = 30-(3x2/4)]4
160-8x2 = 120-3x2
8x2-3x2 -= 160-120
5x2 = 40
x2 = 40/5
x2= 8

Substituting the value of x2 = 8 into either one of the original equations to give value
to x1

x1 + 2x2 = 40
x1 = 40-2x2
x1 = 40 – 2(8)
x1 = 40 – 16
x1 = 24

To compute the profit (Point B)

Z = 40x1 + 50x2
Z = 40 (24) + 50 (8)
Z = 960 + 400
Z = Php 1,360.00

To compute the profit (Point A) To compute the profit (Point C)

Z = 40x1 + 50x2 Z = 40x1 + 50x2
Z = 40(0) + 50(20) Z = 40(30) + 50(0)
Z =0+ 1000 Z = 1200 + 0
Z = Php 1,000.00 Z = Php 1,200.00

Point A profit: Php 1,000.00

Point B profit: Php 1,360.00
Point C profit: Php 1,200.00

The optimum solution is point B which will give a maximum profit of Php 1,360.00