Está en la página 1de 3

Course: Master of Business Administration

Semester 2
Subject Code: MB0048
Subject: Operations Research
Marks: 140
Answer key
Q No Correct answer Section No.
1. c. Optimal decision 1.2.1

2. c. Goal programming 1.8

3. b. Decision variables 1.8

4. c. Linear inequalities 2.3.1

5. a. Maximisation of the negative expression 2.4.2

6. d. 2.4.2

7. b. Convexity property 3.6

8. b. Extreme points 3.2

9. c. Feasible solution 3.6

10. a. Stack 4.2

11. d. Zero 4.5

12. a. Non-basic variables 4.3.1

13. d. Multiple optimal solutions 5.2

14. c. Optimal 5.5.3

15. b. Coefficients 5.3

16. c. Upper-right-hand 6.2

17. a. Loop 6.5.1

18. c. Vogels approximation method 6.4.3

19. c. Assignment algorithm 7.3

20. a. 7.4.2

21. c. Balanced assignment problem 7.4.1

22. c. Collusion 9.6.1

23. d. Pre-emptive priority 9.6


24. c. Poisson distribution 9.4.2

25. c. Assumptions 10.1

26. d. E(n) 10.4

27. c. Waiting time in the queue + service time 10.4

28. d. Queue 11.2

29. c. Simplest waiting line model 11.2

30. b. Single facility waiting channel 11.2

31. d. Simulation model 12.6

32. b. Four digit 12.5.2

33. d. Square root 12.6

34. a. Random 13.1

35. d. Simulation 13.4

36. c. What to do when all else fails 13.4

37. c. Time-oriented 14.1

38. b. Non - repetitive 14.2

39. a. Game theory 15.1

40. d. Saddle 15.2

41. a. 1-true, 2-true 1.2, 1.4

42. a. Judgement, Research 1.5

43. b. 1-False, 2-True 2.8

44. a. Options 1 & 2 2.2, 2.8

45. c. Spheres, hyper-spheres 3.4.2

46. a. Options 1 & 2 3.4

47. d. Very large positive, very large negative 4.3

48. c. 1-false, 2-false 4.6

49. a. 1-True, 2-True 5.4.1

50. a. Statement 1 & 3 5.5


51. a. End, Rim 6.2

52. c. Zero, Positive 6.5.2


th
53. d. xijk=1 if k is directed from city i to city j 7.5

54. b. Planning, Scheduling 7.5

55. b. Service, Capacity 9.3

56. d. Option 1 & 2 9.3

57. b. Channels, Servers 10.5

58. a. 1-True, 2-True 11.2.1

59. b. F, M 11.2.1

60. b. Impossible, Number of trails 12.6

61. b. Inventory control methods 1.8

62. d. Statements 1, 3 and 4 are true 2.6

63. c. Linear programming 2.1

64. a. 1D, 2A, 3B, 4C 3.5, 3.6

65. c. Statements 1, 3 & 4 are false 4.5, 4.6

66. b. Max W = 20y1 - 5y2 5.3


Subject to
6y1 - y2 13
4y1 - y2 = 14
y1 0, y2 is unrestricted in sign
67. c. Statements 2, 3 and 4 are true, 1 is false 6.5.3

68. a. Statements 1, 2 & 3 are true 7.5

69. c. 1B, 2A, 3D, 4C 9.6, 9.5, 9.2. 9.3

70. d. Rs. 29 10.6

71. d. 3 hours, 2 electrical items 10.6

72. d. 1B, 2C, 3A, 4D 11.2.2

73. d. 4 minutes, 45 minutes 12.6

74. d. Only statement 2 is true 13.2, 13.2.1

75. b. 1B, 2A, 3B, 4C 14.2