Professional Documents
Culture Documents
: : : : :
8/1/2007 3 Hours 3 6
Q2 : Solve the following LP problem : Mini. z = 3 x1 + 4 x2 S.T. 3 x1 2 x2 6 x1 + 5 x2 x1 , x2 Q3 : (a) Given that the LP problem, Max. z = 6 x1 +3 x2 S.T. 4 x1 + x2 3 x1 +2 x2 x1 , x2
has the second iteration tableau.
6 30 0 + + + , 3 x3 3 x3 x3 x3
(1) (2)
____________________________________________________________________________________________________________________________________
2 1 0 S1
3/5 3/5 - 1/5
(1) (2) S2
6/5
Basic Z X3 X1
X1 0 0 1
X2 0 -1 1
X3 0 1 0
Solution 2 2/5
2/5 1/5
-4/5
3/5
1- Is it optimal solution? 2- What is the status of : (a) resource (1) (b) resource (2). 3- Which resource has the first priority to increase its availability? 4- Find the range of X1 - coefficient to keep the solution optimal and corresponding range of Z.
______________________________________________________________________________
Page : 1 / 3
Part : 1 / 1
(b) For the following table of assignment costs , find the optimal assignment of the 4 operators to 4 out of the 5 machines. The machine with no operator is a stand by. Compute the optimal total cost and determine which is the stand by ? Machine
Operator
1 2 3 4
1 5 3 4 2
2 2 3 6
3 5 9 7 7
4 5 2 6
5 2 2 1 5
______________________________________________________________________________________________________________________________________
Q4 : (a) The following table gives the transportation costs. Each of destinations 1 and 3 needs no
penalty if there is shortage in its need. But, demand of destination 2 must be satisfied. Use Vogel's Approximation Method ( VAM ) to get the starting solution. Then, find the optimal solution and the destination having shortage.
S1 S2 Sources S3 Demands
Destinations D1 D2 5 2 5 4 7 1 50 20
D3
Capacities 3 15 80 6 10 5
75
________________________________________________________________________________
(b) The following table is obtained as a starting solution for a transportation problem. Source D5 has zero costs.
D1 Sources Demands S1 S2 S3 S4 50 20 80
Destinations D2 D3 D4 50 30 30
D5 60
Capacities 60 100 50 80
50
40
60
1- What is D5 called? Check its demand value and correct it if needed. 2- Is this solution feasible? Why? If it is not, modify the table to be feasible.
___________________________________________________________________________________________________________________________________
Q5 : (a) For a deterministic-static demand manufacturing inventory model involving holding, shortage
and procurement costs, show that :
_____________ Qo =
Page : 3 / 3
_________________________________________________________________
(b) A company can produce an essential item. It costs LE. 120 each time of machine set-up. The production monthly rate is 2500 units. The holding cost per unit is LE. 0.6 per month. The company's demand of the item is 6000 units per year. [wl = 0.6417 , wu = 1.5583]. 1- Determine the optimal lot size(Qo ) and monthly total optimal cost ( TCUo). 2- Find the decision range of Q, for an allowance of 10% increase in (TCU) above (TCUo). 3- If this item can be purchased with setting up cost equals to LE. 80. Is it better to buy instead of producing the item?
_________________________________________________________
(c) For a production scheduling optimization problem, data is given in the following table foe 3 successive periods. Period Capacities ( units) Demand i Regular time Overtime 1 90 150 160 2 60 70 180 3 100 80 150 Totals 250 300 490 The regular and over-time costs are LE. 3 and LE. 4 per unit. Holding and shortage are limited to a maximum of 1 period only. Holding cost per unit is LE. 0.5, while the penalty cost for a unit shortage is LE. 0.8. 1- Formulate the table of the equivalent transportation model. 2- Assuming shortage is not allowed and holding is not limited, reformulate the table and find the optimum production schedule.
_________________________________________________________________________________________________________________________________
Q6 : In a factory, machines break down at an average rate of 3 per day. Break down are distributed as
Poisson. In the maintenance department, there is a cheap repair man who can serve break down machines at an average rate of 4 per day. (a) Find : 1- the probability that the repairman starts service of a break down machine immediately of its reaching the maintenance department. 2- the average time of a machine in the department before the repairman starts service. 3- the average number of machines in the maintenance department. 4- the percentage of time the repairman is idle. 5- the average non-working time of the broken machine. 6- the percentage utilization of the repairing facility. (b) The non-working time of any machine costs LE. 16 per day. The repairman takes LE. 28 per day. Another faster repairman who can repair machines at an average rate of 6 per day, asks for LE 40 per day. Is the cheaper repairman preferred or the faster one?
Page : 3 / 3
Part :
1/1