Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • RMT Questions

    Загружено:

    kks
    17 просмотров24 страницы
    maths

    Оригинальное название

    Rmt Questions

    Авторское право

    © © All Rights Reserved

    Доступные форматы

    PDF или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    maths

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PDF или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    17 просмотров24 страницы

    RMT Questions

    Загружено:

    kks
    maths

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PDF или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 24
    Reg. No. Question Paper Code : 96318 M.C.A. DEGREE EXAMINATION, FEBRUARY/MARCH 2014. Fourth Semester DMC 1942 — RESOURCE MANAGEMENT TECHNIQUES, (Regulations 2009) ‘Time : Three hours Maximum : 100 marks Sea eee ep Al: Answer ALL questions. PART A — (10 x 2= 20 marks) Name some areas where we can use OR technique. What is meant by unbounded solution? How to resolve degeneracy in transportation problem? What is meant by balanced assignment problem? Define upper bound and lower bound. What is mixed integer programming? Write the differences between PERT and CPM. In a network diagram, what is a dummy activity? What is joking in queuing theory? List any two applications of queuing theory. PART B — (6 x 16 = 80 marks) (a) The postal department is considering the purchase of vehicles of pick up and deliver mail from various offices. They are considering three types of vehicles, The cost of each of these are Rs.5 lakhs, Rs.10 lakhs Rs.8 lakhs per vehicle, respectively. These require a crew of 2, 4, and 4 person per day considering multiple shifts. They expect. these to run for 60,100 and 80 km per day. They expect that the total distance to be covered by the vehicles per day would be 2000 km. Based on the fuel economy, the operating cost per day for these vehicles are Rs.200, Rs.350 and Rs.300 per day. They have a budget restriction of Rs.1.6 crore and have 80 people available as crew. Formulate a model to minimize the operating costs. Or ta (b) Solve the given linear programming problem using simplex algorithm Maximize Z = 4x, +5x, Subject to 2x, +8x, $8 Ax, + 4x, $10 x, unrestricted, x, >0. (a) M/s Cow and Calf Dairies make three types of milk products. They own three plants, one which is to selected for each product. Table give the estimated processing cost and distribution cost per unit for each product processed at each plant. Unit processing cost (RsJ/litre) Unit distribution cost (Rs Mitre) Plant/Product of UM It PlantProduct I 12-1 Standardmilk 5.5 5 Standard milk 1 2 1 Flavoured milk 6 = 7 Flavouedmik 06 1 13 Yogurt 65-6 ot Yogurt 06 05 08 Table 1 Table 2 ‘Table 3: Shows the daily production of each product and the selling prices. Product Planned production Planned price Gitres) (Rs Litre) Standard milk 8000 13.00 Flavoured milk 5000 18.00 Yogurt 2000 20.00 Formulate this problem as an assignment problem to maximize total profit. Find the optimal solution and the profit associated with it. Or (0) ATV assembling unit has four plants in different city locations with capacity 125, 250, 175 and 100 units respectively. The demand schedules for its four outlets are 100, 400, 90 and 60 respectively. Though the components costs are one and the same in all plant locations due to varying levels of transport cost the profit per set varies considerably Given the per unit profit table obtain the optimum solution that maximizes the total profit. Factory Showrooms si s2 s3 S4 FL 90 100 120 110 F2 100 105 130 17 F3 uu 109 110 120 Fa 130 125 108 113 Se 96318 13, 14, (@) ) (a) Solve: Minimize Z = 7x, + 6x, Subject to 2x, + 3x, S12 6x, +5x, $30, where x,, x, must be non-negative integers. Or Solve the LPP using cutting plane method. Maximize Z =x, +x, +x, Subject to ‘Tx, Bit, + ST 12x, +15xq +5 $7 x1.%2,%5 2 Oand integer. Consider the following data of a project. Durations (weeks) Activity Predecessors Optimistic Most Pessimistic time likelihood time time A - 3 5 8 B - 6 7 9 c A 4 5 9 D B 3 5 8 E A 4 6 9 F cD 5 8 ul G CDE 3 6 9 H F 1 2 9 @ Construct the project network. (ii) Find the expected durations and variance of each activity. (ii) Find the critical path and the expected project completion time. Or 3 96318 15. (b) @ (b) Consider the data of a project as shown in table. Activity Normal time Normalcost Crashtime —_Crash cost (weeks) Rs.) (weeks) (Rs) 1-2 16 500 i 900 13 6 800 3 560 _ 9 800 5 910 25 16 =, 850 12 865 3-2 8 1120 a 5 1230 4 6 1200 3 1380 45 13 1600 8 1850 If the indirect cost per week is 300 find the optimal, normal and minimum project completion time. A self-service grocery store employs one cashier at its counter. Eight customers arrive on an average every 5 minutes while the cashier can serve 10 customers in 5 minutes. Assuming Poisson distribution of arrival and exponential distribution for service rate, find (@) Average number of customers in the system. (ii) Average number of customers in queue. (ii) Average time a customers spends in the system. (iv) Average time a customers waits before being served. Or A barber shop has two barbers and three chairs for customers. Assume that the customers arrive in poison fashion at a rate of 5 per hour and that each barber services customers according to an exponential distribution with mean of 15 minutes. Further if a customer arrives and no empty chair in the shop, he will leave, What is the probability that the shop is empty? What is the expected number of customers in the shop? 4 96318 Reg. No.:[_ | ieee Question Paper Code : 86318 M.C.A. DEGREE EXAMINATION, AUGUST 2018. Fourth Semester DMC 1942 - RESOURCE MANAGEMENT TECHNIQUES (Regulation 2009) ‘Time : Three hours ‘Maximum : 100 marks as 10, (Use of normal distribution table is permitted) Answer ALL questions, PART A — (10 x 2= 20 marks) What is the canonical form of a linear programming problem? How will you find the existence of multiple solutions of linear programming problem while solving it by simplex method. Obtain the initial solution for the following transportation problem by least cost method. _ T Souree Destination Supply ina | He | 0 a i 2 z 4 5 | 2 3 3 i 8 8 5 4 ci i Be als 6 2 14 Demand| 7 | “9 18 34 Distinguish between transportation model and assignment model. State the importance of integer programming problem and their applications. Write a brief note on cutting plane method. What is the significance of the total float with regard to the resources available for a project? How will you define the three time estimates used in PERT. Define the terms queue discipline and system capacity. Brief the applications of queuing theory in industrial management. PART B— (x 1 80 marks) 11. (a) A company manufactures two types of cloth using three different colours of wool. One yard length of type A cloth requires 4 OZ of red wool, 5 OZ of green wool and 3 OZ of yellow wool. One yard length of type B cloth requires 5 OZ of red wool, 2 OZ of green wool and 8 OZ of yellow wool, ‘The wool available for manufacture is 1000 OZ of red wool, 1000 OZ of Sreen wool and 1200 OZ of yellow wool. The manufacturer can make a profit of ©5 on one yard of type A cloth and €3 on one yard of type B cloth. Find the best combination of the quantities of A and type B cloth which gives him maximum profit by solving the linear programming problem by graphical method. (6) D> Geig Misti ramones Do + xy +25 subject to 4x, +6x, +x, <8 Bx, ~6xq ~ 4x5 <1 2x, + Bx» Bay 24 Xi, 20 (6) - 12 (a) @ Solve the transportation problem with unit transportation costs, demands and supplies as given below (10) Destination Souree D1 D2 D3 D4 Supply Sl 6 e 2. 3 70 $2 il 5 2 8 55 83 10: te de. 70 Denand. 8 35 50 45 (i) Define an unbalanced assignment problem and describe the steps involved in solving it. © Or () @ How the problem of degeneracy arises in transportation problem? Explain how does one over come it? ® (i) The following tables gives the expected annual sales (in thousands of ©) for each salesman if assigned to various territories, Find the assignment of salesman so as to maximize the annual sales. (10) Territories Salesman 1 2 3 4 A 60 90 40 30 B 40 30 20 15 IG 40 20 35 10 D 30 30 25 20 2 86318 13. @) (b) 14. (a) Find the optimum integer solution to the linear programming problem by using Gomory's method. Maximize z= 2x, +2» Subjected to the constraints Bx, +8x, <8 2x, +x, 58 xy, 2 0 and are integers. a6) or Use .branch and bound method to solve the following integer programming problem. Maximize 2= 9x, + 4x Subject to the constraints Tx, + 16x, $52 Bx, ~2x, $18 20 and integers (16) (@ Construct the network for the project whose precedence relationships are as given below ‘A

    Вам также может понравиться