Sie sind auf Seite 1von 5

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 :
Available Time
Machine Type
(in machine hours per week)
Milling Machine 250
Lathe 150
Grinder 50

The number of machine-hours required for each unit of the respective product is given
below :
Productivity (in Machine hours/Unit)
Machine Type Product 1 Product 2 Product 3
Milling Machine 8 2 3
Lathe 4 3 0
Grinder 2 – 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. 10 marks.
5. Explain Project Management (PERT).
10 marks
February 2011
Master of Computer Application (MCA) – Semester 4
MC0079 – Computer Based Optimization Methods – 4 Credits
(Book ID: B0902)
Assignment Set – 2 (40 Marks)

Answer all Questions

1. 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

2. Find the optimum integer solution to the following all IPP


Maximize z = x1 + 2x2
subject to the constraints
x1 + x2 ≤ 7
2x1 ≤ 11
2x2 ≤ 7
x1, x2  0 and are integers 10 marks

3. 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 Payment
L, P A pays B Rs. 3
L, Q B pays A Rs. 2
M, P A pays B Rs. 2
M, Q B pays A Rs. 4
N, P 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
4. Find the saddle point if they exists, game value and optimum strategies.

3 2  1 13 11 
 4 3   2  3 , (c)  9 5  11 , and
(a)   , (b)    
  3  7  4  5  0  3 13 

16 4 0 14  2
10 8 6 10 12 
(d) 
2 6 4 8 14 
 
 8 10 2 2 0
10 marks

5. A sample of 100 arrivals of customers at a retail sales depot is according to the following
distribution:

Time between Frequency


Arrivals (mts.)
0.5 2
1.0 6
1.5 10
2.0 25
2.5 20
3.0 14
3.5 10
4.0 7
4.5 4
5.0 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.) Frequency


.5 12
1.0 21
1.5 36
2.0 19
2.5 7
3.0 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

Das könnte Ihnen auch gefallen