Scribd
Upload
51 views21 pages

Graphical Method Minimization

econ

Uploaded by

ML Creations
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views21 pages

Graphical Method Minimization

econ

Uploaded by

ML Creations
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

GRAPHICAL METHOD

MINIMIZATION
MINIMIZATION PROBLEM 1
Assume that a firm is to produce Gro-plus and Crop-plus.
Each bag of Gro-plus would need 2 lbs of nitrogen and 4
lbs of phosphate and cost Php 6. Each bag of Crop-plus
requires 4 lbs of nitrogen and 3 lbs of phosphate and
cost Php 3. At least 16 lbs of nitrogen and 24 lbs of
phosphate must be used. The firm wants to minimize
cost.
MINIMIZATION PROBLEM 1
CHEMICAL CONTRIBUTION
Brand Nitrogen (lb/bag) Phosphate (lb/bag)
Gro-plus 2 4
Crop-fast 4 3

1. FORMULATION:
a. Decision Variables
Let x = number of Gro-plus to produce to minimize cost.
Let y = number of Crop-plus to produce to minimize cost.
b. Objective Function
Minimize Cost = 6x + 3y
c. Constraints
2x + 4y  16 lb of nitrogen (0, 4) (8,0)
4x + 3y  24 lb of phosphate (0, 8) (6,0)
x, y  0
STEP 2: GRAPH
Y

14 –

12 –

10 –

8–

6–

4–

2–

0– | | | | | | |
2 4 6 8 10 12 14 X
STEP 3 AND 4: AFR AND CORNER POINTS
Y

14 –

12 –

10 –

8–A

6–

4–
B
2–
C
0– | | | | | | |
2 4 6 8 10 12 14 X
STEP 5: OPTIMAL VALUES/ VALUE OF X
AND Y AT EACH POINT

Point X Y Min C = 6x + 3y

A 0 8 Min C = 6(0) + 3(8) = 24

C 8 0 Min C = 6(8) + 3(0) =48


STEP 5: VALUE OF X AND Y AT EACH POINT
POINT B: INTERSECTION
OF EQ 1AND EQ 2 SOLVE FOR X
• 2x +4y 16 (4) 2x + 4y = 16
2x + 4(1.6)= 16
• 4x +3y 24 (2) 2x + 6.4 = 16
2x = 16 - 6.4
2x = 9.6
• 8x +16y = 64 x=4.8
• 8x +6y = 48
• 10y = 16
• y = 1.6
STEP 5: OPTIMAL VALUES/ VALUE OF X AND Y AT EACH POINT

Point X Y Min C = 6x + 3y

A 0 8 Min C = 6(0) + 3(8) = 24

B 4.8 1.6 Min C = 6(4.8) + 3(1.6) = 33.60

C 8 0 Min C = 6(8) + 3(0) =48


STEP 6: DECISION

DECISION:
• Therefore to minimize at Php 24 , the company
should produce 8 bags of Crop-plus.
CHECK WITH CONSTRAINTS

Constraints:
2x + 4y 16 2(0) + 4(8)  16 32  16 minimum requirements met
4x + 3y 24 4(0) + 3(8)  24 24  24 minimum requirements met

All the minimum requirements on nitrogen and phosphate were met .


STEP 6: DECISION

DECISION:
• Therefore to minimize at Php 24 , the company
should produce 8 bags of Crop-plus.
MINIMIZATION PROBLEM 2

• A banquet hall offers two types of tables for rent: 6-person


rectangular tables at a cost of $27 each and 10-person round
tables at a cost of $46 each. You would like to rent the hall for a
wedding banquet and need tables for a minimum of 230
people. The room can have a maximum of 39 tables and the
hall only has 10 rectangular tables available. How many of each
type of table should be rented to minimize cost?
STEP 1: FORMULATION
A. DECISION VARIABLES
Let x = number of rectangular tables to be rented to minimize cost.
Let y = number of round tables to be rented to minimize cost.

B. OBJECTIVE FUNCTION:


Min C = 27x + 46y

C. CONSTRAINTS
maximum of 39 tables: x + y ≤ 39 (0,39)(39,0)
seats : 6x + 10y > 230 (0,23) (38.33)
rectangular tables available: x < 10
NNC: x, y > 0
STEPS 2,3, AND 4
B
EQ 1
EQ 3

C
A EQ 2

 C. CONSTRAINTS
D
maximum of 39 tables: x + y ≤ 39 (0,39)(39,0)
seats : 6x + 10y > 230 (0,23) (38.33)
rectangular tables available: x < 10
NNC: x, y > 0
STEP 5: OPTIMAL VALUES/ VALUE OF X AND Y AT EACH POINT

Point X Y Min C = 27x + 46y

A 0 23 Min C = 27(0) + 46(23) = 1,058

B 0 39 Min C = 27(0) + 46(39) = 1,764

D
STEP 5: OPTIMAL VALUES/ VALUE OF X AND Y AT EACH POINT

 C. CONSTRAINTS
maximum of 39 tables: x + y ≤ 39 (0,39)(39,0)
seats : 6x + 10y > 230 (0,23) (38.33)
rectangular tables available: x < 10
NNC: x, y > 0

PT. C – INTERSECTION BETWEEN EQ 1 AND EQ 3

x + y ≤ 39 AND x < 10
10 + y = 39
y = 39-10 = 29
(10,29)
STEP 5: OPTIMAL VALUES/ VALUE OF X AND Y AT EACH POINT

Point X Y Min C = 27x + 46y

A 0 23 Min C = 27(0) + 46(23) = 1,058

B 0 39 Min C = 27(0) + 46(39) = 1,764

C 10 29 Min C = 27(10) + 46(29) = 1,604

D
STEP 5: OPTIMAL VALUES/ VALUE OF X AND Y AT EACH POINT

 C. CONSTRAINTS
maximum of 39 tables: x + y ≤ 39 (0,39)(39,0)
seats : 6x + 10y > 230 (0,23) (38.33)
rectangular tables available: x < 10
NNC: x, y > 0

PT. D – INTERSECTION BETWEEN EQ 2 AND EQ 3

6x + 10y > 230 AND x < 10


6(10) + 10y = 230
10y = 230-60
10y = 170 y = 17
(10,17)
STEP 5: OPTIMAL VALUES/ VALUE OF X AND Y AT EACH POINT

Point X Y Min C = 27x + 46y

A 0 23 Min C = 27(0) + 46(23) = 1,058

B 0 39 Min C = 27(0) + 46(39) = 1,764

C 10 29 Min C = 27(10) + 46(29) = 1,604

D 10 17 Min C = 27(10) + 46(17) = 1,052


STEP 6: DECISION

DECISION:
• Therefore to minimize at Php 1,052 , 10 rectangular
tables and 17 round tables should be rented.
CHECK WITH CONSTRAINTS

Constraints:
tables: x + y ≤ 39 10 + 17 ≤ 39 27 ≤ 39
Seats: 6x + 10y > 230 6(10) + 10(17) > 230 230 > 230
rectangular tables available: x < 15 10 < 15
All the conditions were met .

You might also like