(6 pages)

NOVEMBER 2022 2201157/UMSM55A

Time : Three hours Maximum : 75 marks

SECTION A — (10 × 2 = 20 marks)

Answer any TEN questions.

1. What is linear programming problem?

2. State the canonical form of LPP.

3. What is meant by optimum basic feasible solution

in LPP?

4. Explain the term duality in LPP.

5. Write the dual of the following

Min z = 4 x1 + 6x 2 + 8x 3

Subject to x1 + 3x 2 ≥ 3 ; x1 + 2x 3 ≥ 5 ; x1 , x 2 , x 3 ≥ 0

6. What is balanced T.P?

7. When is an A.P is said to be unbalanced?

8. What is two person zero sum game?

9. How will you solve the sequencing problem on

n jobs on two machines?

10. What is dummy activity in a network?

11. Mention two important rules to be followed while

forming a network.

12. What is Monte-Carlo method of simulation?

SECTION B — (5 × 5 = 25 marks)

Answer any FIVE questions.

13. Solve the following LPP graphically

Max z = 3x1 + 5x 2

Subject to x1 + x 2 ≤ 2 ; 2x1 + 2x 2 ≥ 8 ; x1 , x 2 ≥ 0

14. Write the algorithm for methods of penalties.

15. Find the initial basic feasible solution for the

TP by using least cost method.
5 2 4 3 22
4 8 1 6 15
4 6 7 5 8
7 12 7 19
2 2201157/UMSM55A
16. Find the optimal solution for the AP
W X Y Z
A 11 17 8 16
B 9 7 12 6
C 13 16 15 12
D 14 10 12 11

17. Using the principle of Dominance solve the

following game
8 10 9 14
10 11 8 12
13 12 14 13

18. Explain the method of obtaining an optimal

solution for a sequencing problem with 6 jobs and
2 machines.

19. The following data are the characteristics of a

project :
Activity A B C D E F
Immediate Predecessors – A A B, C – E
Duration 2 3 4 6 2 8

Draw the network diagram and find the critical

path.

3 2201157/UMSM55A
 SECTION C — (3 × 10 = 30 marks)

Answer any THREE questions.

20. Solve graphically

Max z = 20x 1 + 30 x 2

Subject to 3x1 + 3x 2 ≤ 36 ; 5x1 + 2x 2 ≤ 50 ;

2x1 + 6x 2 ≤ 60 ; x1 , x 2 ≥ 0 .

21. Solve the LPP using big M method

Max z = − 2x1 − x 2

Subject to

3x1 + x 2 = 3; 4 x1 + 3x 2 ≥ 6 ; x1 + 2x 2 ≤ 4 ; x1 , x 2 ≥ 0

22. Solve the following assignment problem

6 2 5 2 6

2 5 8 7 7

7 8 6 9 8

6 2 3 4 5

9 3 8 9 7

4 7 5 6 8

4 2201157/UMSM55A
[P.T.O.]
23. Find the sequence that minimize the total time in
hours required to complete the following jobs on
three machines
Job 1 2 3 4 5 6 7

Machine I 4 9 8 5 10 9 8

Machine II 5 4 3 6 2 5 4

Machine III 7 8 6 12 6 7 13

What is the minimum elapsed time?

24. The following indicates the details of the activity

of a project. The duration are in days.
Activity 1–2 1–3 1–4 2–5 3–5 4–5 5–6

to 1 1 2 1 2 2 3

tm 1 4 2 1 5 5 6

tp 7 7 8 1 14 8 15

(a) Draw the network diagrams

(b) Find the expected duration and variance for

each activity

(c) Calculate variance and SD of the project

5 2201157/UMSM55A
(d) What is the probabilities that the project will
be completed with in

(i) 20 weeks
(ii) 17 weeks.

———————

6 2201157/UMSM55A