# February 2011 Master of Computer Application (MCA) – Semester 4 MC0079 – Computer Based Optimization Methods – 4 Credits

(Book ID: B0902)

Assignment Set – 1 (60 Marks)
Answer the following : 1. Write down the algorithm of the graphical method to solve a L.P.P. 10 marks 2. Explain the algorithm for solving a linear programming problem by graphical method 10 marks

3. A manufacturing firm has discontinued production of a certain unprofitable product line.
This created considerable excess production capacity. Management is considering to devote this excess capacity to one or more of three products: call them product 1, 2 and 3. The available capacity on the machines which might limit output are given below : Machine Type Milling Machine Lathe Grinder Available Time (in machine hours per week) 250 150 50

The number of machine-hours required for each unit of the respective product is given below : Productivity (in Machine hours/Unit) Machine Type Milling Machine Lathe Grinder Product 1 8 4 2 Product 2 2 3 – Product 3 3 0 1

The unit profit would be Rs. 20, Rs. 6 and Rs. 8 for products 1, 2 and 3. Find how much of each product the firm should produce in order to maximize profit ?

20 marks 4. Determine optimal solution to the problem given below. Obtain the initial solution by VAM. Write down the differences between PERT and CPM. 5. Explain Project Management (PERT). 10 arks 10 marks.

6. 1 Kg. of food–I contains 3 units of vitamin A and 2 units of vitamin C, while 1 Kg. of
food-II contains 2 units of vitamin A and 3 units of vitamin C. They cost Rs.10 per Kg. and Rs.8 per Kg. respectively. A dietician wants to mix the two kinds and prepare a mixture so that it contains at least 14 units of vitamin A and 16 units of vitamin C. Find how the dietician should mix them so that the cost to him may be minimum. 10 marks

7. Find the optimum integer solution to the following all IPP
Maximize z = x1 + 2x2 x1 + x2 ≤ 7 2x1 ≤ 11 2x2 ≤ 7 x1, x2 ≥ 0 and are integers 10 marks subject to the constraints

8. In a certain game, player A has three possible choices L, M and N, while player B has two, possible choices P and Q. Payments are to be made according to the choices made. Choices L, P L, Q M, P M, Q N, P Payment A pays B Rs. 3 B pays A Rs. 2 A pays B Rs. 2 B pays A Rs. 4 B pays A Rs. 2

N, Q

B pays A Rs. 3

What are the best strategies for players A and B in this game? What is the value of the game for A and B? 10 marks 9. Find the saddle point if they exists, game value and optimum strategies.
− 4 (a)  − 3 16   10 (d)  2  8
3 3   , (b) − 2 − 7  − 4  2  1 − 3 , (c) −9   0 − 5   13 5 −3 11  −11  , and  13  

4 8 6 10

0 6 4 2

14 10 8 2

− 2 12   14   0 

10 marks

10. A sample of 100 arrivals of customers at a retail sales depot is according to the following distribution:
Time between Arrivals (mts.) 0.5 1.0 1.5 2.0 2.5 3.0 3.5 4.0 4.5 5.0 Frequency 2 6 10 25 20 14 10 7 4 2

A study of the time required to service customers by adding up the bills, receiving payment, making change and placing packages in hand trucks, yields the following distribution.

Service time (mts.) .5 1.0 1.5 2.0 2.5 3.0

Frequency 12 21 36 19 7 5

Estimate the average percentage customer waiting time and average percentage idle time of the server by simulation for the next 10 arrivals.
20 marks

Sign up to vote on this title