Sp3

APRIL 2019 1811331/UMSM55A

Time : Three hours Maximum : 75 marks

PART A — (10  2 = 20 marks)

Answer any TEN questions.

Each question carries 2 marks.

1. What are the characteristics of a good model in

OR?

2. Write down the canonical form of a L.P.P.

3. Define feasible solution to a L.P.P.

4. What is charnes method of penalties?

5. Write down the dual form of Maximize

z  2x1  13x 2  3x 3 .
Subject to x1  x 2  3x 3  5 , x1  x 2  1 ,
3x1  x 2  4 x 3  1 and x1 , x 2 , x 3  0

6. What is the general form of a transportation

problem?

7. What is assignment problem? And give an

example.

8. Draw Gantt-chart for n-jobs through 2 machines.

 Sp3

9. Write down the Johnson condition for 3 machines

n jobs.

10. Write down tile maxi-mini principle for a game.

11. Define CPM and PERT.

12. What are the disadvantages of Monte Carlo

method of simulation?

PART B — (5  5 = 25 marks)

Answer any FIVE questions.

Each question carries 5 marks.

13. Solve graphically the following L.P.P Maximize

z  3x1  x 2 .

Subject to  2x1  x 2  1 , x1  2 and x1 , x 2  0 .

14. Write down the Simplex algorithm for a LPP.

15. Explain VAM for a transportation problem.

16. What is Hungarian Method? Where it is used?

17. Write down the basic assumptions of the

sequencing problem.

2 1811331/UMSM55A
 Sp3

18. Using Dominance rule, solve the game whose

payoff matrix is given by
Player B
1 7 3 4
Player A 5 6 4 5
7 2 0 3

19. Construct the net work for the project whose

activities and their relationships are given below.

Activities : A, D, E can start simultaneously

Activities : B, C > A; G, F > D, C; H >E, F.

PART C — (3  10 = 30 marks)

Answer any THREE questions.

Each question carries 10 marks.

20. Solve the following LPP, Using simplex method

Maximize z  2x1  5x 2 subject to x1  4 x 2  24 ,

3x1  x 2  21 , x1  x 2  9 and x1 , x 2  0 .

21. Using Dual simplex method to solve the L.P.P.

Minimize z  2x1  x 2 , Subject to 3x1  x 2  3 ,

4 x1  3x 2  6 , x1  x 2  3 and x1 , x 2  0 .

3 1811331/UMSM55A
 Sp3

22. The assignment cost of assigning any one operator

to any one machine is given in the following table.
Operators
I II III IV
10 5 13 15
3 9 18 3
Machines 10 7 3 2
5 11 9 7
Find the optional assignment by Hungarian
method.

23. Solve the following game using graphical method.

Player B
2 –2 3 7 6
Player A 6 5 1 4 0

24. Customer arrival at a milk booth for the required

service. Assume that inner arrival and service
time are constants and given by 1.5 and 4 minutes
respectively. Simulate the system by hand
computations for 14 minutes. (a) What is the
waiting time per customer? (b) What is the
percentage idle time for the facility? (assume that
the system start at t=0).

———————

4 1811331/UMSM55A