Uploaded by PAOLA CASTRO

Assignment 1. Linear Programming

advertisement
PHILIPPINE WOMEN’S UNIVERSITY
GRADUATE SCHOOL PROGRAM
NAME: JOAN FORTUNA
PROFESSOR: DR. HECTOR JOHN MANALIGOD
SUBJECT: Advanced Production and Operations Mgt
Student number: 20141159
1. Cooking Optimization Graph
CAKE 1 (CA)
CAKE 2 (CB)
TOTAL HOURS
COOKING
DECORATING
3 Hours
4 hrs
56 hours/week
2 hrs
3 hrs
40 hours/ week
PROFIT
8 Pesos
12 pesos
1. Assume there are no CAKE 1 cooked per week
(Assign zero for CAKE 1)
56= 3 *CA + 4CB
56= 0+4 CB
56/ 4= CB
CB= 14
2. Assume there are no CAKE 2 cooked per week
(Assign zero for cake 2)
56= 3 *CA + 4CB
56=3 CA+0
56/ 3= CA
CA=18.66
1. Assume there are no CAKE 1 decorated per week
(Assign zero for CAKE 1)
40= 2 CA+ 3 CB
40= 2 (0) + 3 CB
40/ 3= CB
PHILIPPINE WOMEN’S UNIVERSITY
GRADUATE SCHOOL PROGRAM
CB= 13.3
2. Assume there are no CAKE 2 decorated per week
(Assign zero for cake 2)
40= 2 CA+ 3 CB
40= 2 CA+ 3 (0)
40/2= CA
CA=20
COOKING PLOT
CAKE 1
CAKE 2
0
14
18.66
0
No Cake 1
No Cake 2
COOKING GRAPH
20
18
16
14
12
10
8
6
4
2
0
0
14
2. Decorating Optimization Graph
DECORATING PLOT
CAKE 1
No Cake 1
No Cake 2
CAKE 2
0
13.33
20
0
PHILIPPINE WOMEN’S UNIVERSITY
GRADUATE SCHOOL PROGRAM
DECORATING GRAPH
25
20
15
10
5
0
0
13,33
3. What is the D-point for both processes and graph?
OPTIMIZATION
16
14
12
CA= 8
CB=8
OF= 160
10
8
6
4
2
0
-2
0
5
10
15
20
25
PHILIPPINE WOMEN’S UNIVERSITY
GRADUATE SCHOOL PROGRAM
FINDING THE D-POINT
COOKING
DECORATING
PROFIT
CAKE 1
3 Hours
2 hrs
8 Pesos
3 CA + 4 CB =56
COOKING
2 CA + 3 CB= 40
DECORATING
SOLVING FOR THE TABLES
2 (3 CA + 4 CB= 56)
-3 (2 CA + 3 CB= 40)
6 CA + 8 CB =112
-6 CA-9CB= =120
-CB= =8
-1. -1
CB= 8
SOLVING FOR CAKE 1
2CA + 3CB= 40
2 CA+ 3(8)= 40
2 CA + 24= 40
2 CA= 40-24
2CA= 16/2
CA= 8
CAKE 2
4 hrs
3 hrs
12 pesos
TOTAL HOURS
56 hours/week
40 hours/ week
PHILIPPINE WOMEN’S UNIVERSITY
GRADUATE SCHOOL PROGRAM
BEST POSSIBLE COMBINATION
Cake 1
8
8
Cake 2
8
12
total
4. What is maximum profit? Php 160
64
96
Php 160
Download