GEMATMW

MODULE 4 ASSIGNMENT

1. A furniture manufacturer produces two types of display cabinets, type X and type Y. On a weekly
basis, he must produce at least 2 of each type, but not mote than 5 of type X or more than 6 of
type Y. It takes 4 hours to produce type X and 5 hours of type Y in a 40 hour working week. At
least 12 workers are needed with 2 working on type X and 3 on type Y at any one time. Assume
that the profit on type X is Php800 and profit on type Y is Php1000.
A. Formulate the linear programming problem that optimizes the weekly total profit.

2<=X<=5
2<=Y<=6
4X + 5Y <= 40
2X + 3Y >=12


B. Solve the problem graphically. Paste your graph inside the box.
















C. What are the corner points of the feasible region and what is the optimal weekly total
profit?

(2,6), (2.5,6), (5,4), (5,2), (3,2), (2, 2.667)
Take out points with decimals because no such thing as half a cabinet
Left with (2,6), (5,4), (5,2), (3,2)
800x + 1000y
800(2) + 1000(6) = 7600
800(5) + 1000(4) = 8000
800(5) + 1000(2) = 6000
800(3) + 1000(2) = 4400

Optimal Profit: 5 X, 4 Y, with total profit of Php 8000.



2. A manager has four subordinates and four tasks are to be performed. The subordinates have
different efficiency in performing tasks and the tasks differ in difficulty. The time each
subordinate would take to perform each task is given in the table below. Perform the Hungarian
Method to determine the minimum total time of assigning the subordinates to the tasks.
Task 1 Task 2 Task 3 Task 4
Person A 20 28 19 13
Person B 15 30 16 28
Person C 40 21 20 17
Person D 21 28 26 12

Task 1 Task 2 Task 3 Task 4
Person A 5 7 3 1
Person B 0 9 0 16
Person C 25 0 4 5
Person D 6 7 10 0

Task 1 Task 2 Task 3 Task 4
Person A 2 10 0 14
Person B 0 12 0 19
Person C 22 0 1 8
Person D 3 10 7 0

Task 1 Task 2 Task 3 Task 4
Person A
Person B
Person C
Person D

Assignment of Tasks
Person Is assigned to task Time
A 3 19
B 1 15
C 2 21
D 4 12
Minimum total time 67










3. Consider the graph below. Find the shortest path and shortest distance from vertex a to all the
other vertices in the graph.

Shortest distance Give the complete path
a to b 4 a, b
a to h 8 a, h
a to c 12 a, b, c
a to i 14 a, b, c, i
a to g 9 a, h, g
a to d 19 a, b, c, d
a to f 11 a, h, g, f
a to e 21 a, h, g, f, e