Activity 1

Linear Programming Graphical Method

Problem 1

Angel furniture shop manufactures tables and chairs. All tables and chairs pass through two
departments namely, Department 1 and Department 2. In one production period, Department 1 and
Department 2 have a total of 120 and 96 available hours, respectively. Producing one table requires 3
hours in department 1 and 6 hours in department 2. Similarly, producing one chair requires 6 hours in
Department 1 and 3 Hours in Department 2. The contribution margin or profit of table is Php30.00 per
unit and chair is Php24.00 per unit.

Required: Using the graphical method, perform the following;

1. Formulate the objective function

2. Formulate the constraints

3. Prepare the graph

4. Determine the feasible region and shade it in the paragraph

5. Formulate a decision

Problem 2

Nicanor Processing Company produces an insecticide for rice and corn farmers. It has two
processing plants with different production capacities. The maximum production capacity of Plant A in a
week is 15 drums (200 liters per drum), while the maximum production capacity of Plant B is 20 drums
per week. The company aims to produce at least 25 drums of insecticides per week to satisfy the orders
of industrial customers. The Department of Environment and Natural Resources (DENR) has determined
that the production of this insecticide allows for the release of certain particles in the atmosphere which
may be hazardous to the community. Plant A emits 10 pounds of particles for every drum of insecticide,
while Plant B emits 15 pounds of particles in the atmosphere for every drum of insecticide produced.
DENR imposes a penalty of Php20.00 per pound of particles emitted by Plant A and Php25.00 per pound
of particles emitted by Plant B.

Required: Using the graphical method, perform the following;

1. Formulate the objective function

2. Formulate the constraints

3. Prepare the graph

 4. Determine the feasible region and shade it in the paragraph

5. Formulate a decision

PROBLEM 1(SOLUTION)
REQUIREMENT 1: FORMULATE THE OBJECTIVE FUNCTION
Let x= number of tables to be produced
Let y= number of chairs to be produced
x y Available Hrs
Department 1 3 6 120
Department 2 6 3 96
30 24

Max Profit: P=30x+24y

Subject to: 3x+6y≤120
6x+3y≤96
x, y>0

REQUIREMENT 2: FORMULATE THE CONSTRAINTS

First Constraint: 3x+6y=120 Second Constraint: 6x+3y=96
X=0 y=0 X=0 y=0
3(0)+6y=120 3x+6(0)=120 6(0)+3y=96 6x+3(0)=96
6y=120 3x=120 3y=96 6x=96
y=20 x=40 y=32 X=16
(0,20) (40,0) (0,32) (16,0)
3x+6y=120 3x+6y=120
6x+3y=96 3x+6(16)=120
3x+96=120
6x+12y=240 3x=120-96
-6x+3y=96 3x=24
9y=144 x=8
y=16

(8,16)

REQUIREMENT 3: PREPARE THE GRAPH

REQUIREMENT 4: DETERMINE THE FEASIBLE REGION AND SHADE IT IN THE GRAPH

Coordinates: (0,20) (40,0) (0,32) (16,0) (8,16)

Constraints: 3x+6y≤120, 6x+3y≤96

(0,20) (16,0)
First Constraint: First Constraint:
3(0)+6(20)≤120 3(16)+6(0)≤120
6(20)≤120 3(16)≤120
120≤120 48≤120
Second Constraint Second Constraint
6(0)+3(20)≤96 6(16)+3(0)≤96
3(20)≤96 6(16)≤96
60≤96 96≤96
(40,0) (8,16)
First Constraint: First Constraint:
3(40)+6(0)≤120 3(8)+6(16)≤120
3(40)≤120 24+96≤120
120≤120 120≤120
Second Constraint Second Constraint
6(40)+3(0)≤96 6(8)+3(16)≤96
6(40)≤96 48+48≤96
240≤96 96≤96
(0,32)
First Constraint: FEASIBLE REGION:
3(0)+6(32)≤120 (0,20)
6(32)≤120 (16,0)
192≤120 (8,16)
Second Constraint
6(0)+3(32)≤96
3(32)≤96
96≤96

FEASIBLE REGION

REQUIREMENT 5: FORMULATE A DECISION

Vertices Max Profit: 30x+24y
(0,20) 30(0)+24(20)=Php480.00
(16,0) 30(16)+24(0)=Php480.00
(8,16) 30(8)+24(16)=Php624.00
The optimum solution, therefore, is to produce 8 tables and 16 chairs to realize a maximize profit at
Php624.00.

PROBLEM 2(SOLUTION)
REQUIREMENT 1: FORMULATE THE OBJECTIVE FUNCTION
Let x = number of drums from plant A per week

Let y = number of drums from plant B per week

Minimize: C = Php200x + Php375y

REQUIREMENT 2: FORMULATE THE CONSTRAINTS

0 ≤ x ≤ 15

0 ≤ y ≤ 20

x + y ≥ 25

0 ≤ x ≤ 15 0 ≤ y ≤ 20
x + y ≥ 25 x + y ≥ 25 x + y ≥ 25 x + y ≥ 25
15 + y = 25 0 + y = 25 x + 20 = 25 x + 0 = 25
y=10 y=25 x=5 x=25
(15,10) (0,25) (5,20) (25,0)

0 ≤ x ≤ 15 0 ≤ y ≤ 20 0≤x≤1
(15,0) (0,20) X=15
Y=20
(15,20)

REQUIREMENT 3: PREPARE THE GRAPH

REQUIREMENT 4: DETERMINE THE FEASIBLE REGION AND SHADE IT IN THE GRAPH

Coordinates: (0,20) (0,25) (5,20) (15,0) (15,10) (15,20) (25,0)

Constraints: 0 ≤ x ≤ 15 , 0 ≤ y ≤ 20 , x + y ≥ 25

(0,20) (0,25)
0 ≤ 0 ≤ 15 0 ≤ 0 ≤ 15

0 ≤ 20 ≤ 20 0 ≤ 25 ≤ 20

0 + 20 ≥ 25 0 + 25 ≥ 25
20 ≥ 25 25 ≥ 25
(5,20) (15,0)
0 ≤ 5 ≤ 15 0 ≤ 15 ≤ 15

0 ≤ 20 ≤ 20 0 ≤ 0 ≤ 20

5 + 20 ≥ 25 15 + 0 ≥ 25
25 ≥ 25 15 ≥ 25
(15,10) (15,20)
0 ≤ 15 ≤ 15 0 ≤ 15 ≤ 15

0 ≤ 10 ≤ 20 0 ≤ 20 ≤ 20

15 + 10 ≥ 25 15 + 20 ≥ 25
25 ≥ 25 35 ≥ 25
(25,0) FEASIBLE REGION:
0 ≤ 25 ≤ 15 (5,20)
(15,10)
0 ≤ 0 ≤ 20 (15,20)

25 + 0 ≥ 25
25 ≥ 25
REQUIREMENT 5: FORMULATE A DECISION
Vertices Minimize: C = Php200x + Php375y
(5,20) 200(5)+375(20)=Php8,500.00
(15,10) 200(15)+375(10)=Php6,750.00
(15,20) 200(15)+375(20)=Php10,500.00

Nicanor Processing Company should produce 15 drums of insecticide from plant A and 10 drums of
insecticide from plant B to lessen the penalty which is Php6, 750.00