You are on page 1of 23

SIKKIM MANIPAL UNIVERSITY - DDE Master of Business Administration – MBA Semester II MB0048 - OPERATIONS RESEARCH – 4 Credit (Book ID 1631

) Model Question Paper Duration: 2 hours Total marks: 140

__________________________________________________________________________ Section-A 1Mark x 50 = 50 Marks Answer the following 1. Which of the following is an example of a mathematical model? a. Iconic model b. Replacement model c. Analogue model d. General model

2. Which phase in Operations Research involves making recommendations for the decision process? a. Judgement Phase b. Research Phase c. Action Phase d. Recommendation Phase

3. A production manager of a manufacturing organisation is asked to manage and optimise the utilisation of the resources. He/she has to deal with all the aspects of buying like when to buy, how much to buy, etc. Which of the following tool or technique of Operations Research should be used? a. Linear programming b. Inventory control methods c. Transportation model d. Goal programming

4. Models in which the input and output variables follow a defined probability distribution are

a. Deterministic b. Probabilistic c. Symbolic d. Sequencing

5. ______________________ has several objective functions, each having a target value. a. Queuing model b. Linear programming c. Goal programming d. Inventory control method

6. In linear programming we need to ensure that both the objective function and the constraints can be expressed as linear expressions of _________________. a. Basic variables b. Decision variables c. Constraints d. Objective function

7. Optimisation refers to the maximisation or minimisation of the __________________ . a. Objective functions b. Constraints c. Co-efficients of decision variables d. Constants

8. When a linear programming problem is represented in the canonical form, the minimisation of a function is mathematically equivalent to the ______________ of this function. a. Maximisation of the negative expression b. Minimisation of the negative expression c. Minimisation of the positive expression d. Maximisation of the positive expression

9. Non-linear equalities c. all coefficients of decision variables in the objective and constraints expressions are known and finite? a. Linear equalities b. a. 1 d. Non-linear inequalities 11. Linear programming is a powerful tool for ____________________________. a. a. Objective function b. Optimum strategy c. Linear inequalities d. Constraints d. Divisibility 13. both objective function and constraints can be expressed as ____________________. 10 12. According to which of the basic assumptions of linear programming problem. Any inequality in one direction (≤ or ≥) may be changed to an inequality in the opposite direction (≥ or ≤) by multiplying both sides of the inequality by _____________. In Linear Programming Problems. Additivity d. Maximising a nonlinear objective function b. Linearity b. Solving a system of equalities and inequalities d. Deterministic c. -1 c. Which of the following defines the measure of effectiveness of the system as a mathematical function of its decision variables? a. Selecting alternatives in a decision problem . Queuing theory 10. 0 b. Optimising costs c.

One b.14. Redundant Constraint 15. Multiple optimal solution c. Infeasible c. Degenerate d. a. Which of the following is a characteristic of simplex method? a. a. in which of the following case. Inequality constraint c. Infeasible problem 16. Four 18. Zero c. Objective function can be represented by a line 17. Binding constraint d. a. Boundaries of feasible region are planes d. Convexity c. only one optimum solution will be obtained in a graphical solution method? a. A unique optimal solution b. Unbounded or infeasible . In graphical analysis. the __________________ equation is replaced to form a linear equation. All constraints are equations b. When the primal problem is unbounded. Three d. An unbounded solution d. the dual is_______________. Linear Programming constraint b. Slack and surplus variables can be incorporated in the objective function with ______________ coefficients. Multiple optimal solutions b.

A basic solution to an m-origin. Non-integer programming technique d. a. Linear programming problem b.n + 1 c. Balanced assignment problem c.19. In which of the following integer programming problems all decision variables are restricted to integer values? a. Simulation 20. a. m + n – 1 21. Pure integer programming problems b. m . n destination transportation problem can have at the most __________________ positive basic variables (non-zero). a. Unbalanced assignment problem d.n .1 b. The objective of formulation of __________________ is to develop an integral transportation schedule that meets all demands from the inventory at a minimum total transportation cost. m . Branch and bound technique b. Integer programming technique c. Transportation problem c. Mixed integer programming problems . a. Game theory d. The number of rows is not equal to the number of columns and vice versa in ___________________________. otherwise the basic solution degenerates. m + n + 1 d. Linear programming techniques 23. Quadratic programming problem 22. Assignment problem b. ________________________ is applied when some variables have upper or lower bounds.

a. Probability b. Queuing theory is a collection of mathematical models of various queuing systems based on _____________ concepts. Zero integer programming problems d. Reneging d. Collusion 26. a. a. LIFO c. Sequencing 25. FIFO b. Server c. Statistical model c. the ____________ is followed. Deterministic c. Deterministic model b. a. Priority service d. Service d. a. Dynamic b. Static 27. When the customer arrivals are completely random. Poisson distribution . Impatient customers who would not wait beyond a certain time and leave the queue are said to _________________. Jockeying c. One integer programming problems 24.c. ____________ is a rule wherein an important customer is allowed to enter into the service immediately after entering into the system. Pre-emptive priority 28. Balking b. ___________ queuing disciplines are based on the individual customer’s status. Game d.

Random d. Assignment models 31. Prototyping c. a. Game models c. Single server. Several servers. Simulation b. gets some service and finally leaves the system having received the complete service. a. Single server. Service facility b.d. CPM d. Last Come. First Come. Queuing theory is a collection of _______________________ of various queuing systems. Service facilities in a series 32.Single queues d. Waiting time d. In this type of a model.First Served b. _________ represents number of customers waiting in the queue. Mathematical models b. Which queuing discipline is based on the stack method? a.Several queues c. Arrival pattern 30. a customer enters the first station and gets a portion of service and then moves on to the next station.Single queue b. a. a. Probability concept 29. Queue length c. _______________ is the process of defining a model of a real system. PERT . Simulation models d.First Served 33. Priority c.

CPM 38. ______________ refers to comparing the actual progress against the estimated schedule. etc. Rapid Prototyping d. The technique of ____________ involves the selection of random observations within the simulation model. All of the above 36. Provides at best approximate solution to problem d. materials. PERT c. b. Simulation should not be applied in all the cases because it: a. Two c. money. ___________________may be defined as a collection of interrelated activities (or tasks) which must be completed in a specified time according to a specified sequence and require resources. a. Zero d. CPM d. Projects b. Project controlling d. Simulation 37. facilities. One b. Requires considerable talent for model building and extensive computer programming efforts. the float is a. Monte Carlo b. PERT 35. Experimentation c. Project scheduling c. Project planning b. Consumes much computer time c. a. such as personnel.34. For the critical activities. a. Negative .

irrespective of the opponent’s strategy. b. If a player’s strategy is to adopt a specific course of action. What is the abbreviation of PERT? a. d. Pure b. Chaste c. Free c. Independent d. path with the fewest activities. shortest path through the network 43. Hungarian method . Which of the following is used to come up with a solution to the assignment problem? a. path with the most activities. MODI method b. Probable Evaluation and Review Technique c. c. a. a. The critical path of a network is the a. Total b. longest path through the network.39. Path Evaluation and Reasoning Technique d. Mixed 42. Program Evaluation and Review Technique b. the player’s strategy is called _____________ strategy. Tainted d. The _________ float for activity is the difference between the maximum time available to perform the activity and its duration. stepping-stone method d. northwest corner method c. Predetermined Evaluation and Review Technique 41. Zero 40.

He handles information of bus schedules and make reservations. Customers arrive at a rate of 8 per hour and the clerk can serve 12 customers on an average per hour.50 c. To find an initial basic feasible solution by Matrix Minima Method. zero cost b. none of these 45. A road transport company has one reservation clerk on duty at a time. 1-2-3-4-5 d. what is the value of the objective function? a. highest cost c. 0 b. the critical path is: a. If X1 = 20 and X2 = 30. 2 b. Activity 1-2 1-6 6 2-3 14 2-4 5 3-5 11 4-5 7 6-7 11 5-8 4 7-8 18 Duration(weeks) 7 For the network diagram. 5 c. 2-4-5-6-7 c. lowest cost d. 10 . 1-2-4-7-8 46.44. The objective function for a LP model is 3X1 + 2X2.120 47. 8 d. 1-2-3-5-8 b. The average number of customers waiting for the service in the system are: a. we first choose the cell with a. 60 d.

Network scheduling is a technique for ____________ and __________________ of large projects. ii -False d. inventory controls and marketing. Integrating. Scheduling. Integrating b. ii -False b. Capacity 49. i -True. i -False. but some of the tasks cannot be performed by the workers then it is a form of ____________________________. purchasing. OR methods in industry can be applied in the fields of production. Unbalanced assignment problem d. ii -True . transportation. Infeasible assignment problem b. Implementing d. If there are 'n' number of workers and 'n' number of tasks to be performed. i. Facility. Server. Planning. i -True. Service. Integrating Section-B 2Marks x 25= 50 Marks Answer the following 51.48. Facility. Balanced assignment problem 50. a. Feasible assignment problem c. Capacity d. a. Planning. i -False. State True or False: a. and competitive strategies. Scheduling c. OR techniques are used to find the best possible solution. ii -True c. Capacity c. ii. The number of customers in queue and also those being served in the queue relates to the ____________ efficiency and ______________. a. Queue length b.

Options i & iv b. i. Which of the following options indicate the advantages of linear programming? i. Options i & iii d.52. a. iii. allocation b. a. ii. Probabilistic models b. _________________ phase deals with formulation of hypothesis and model. Judgement. organising c. ________________ phase deals with formulation of the problems relative to the objectives. Planning. ________________ include a set of mathematical symbols to represent the decision variable of the system. ii. Organising. a. Research. Action 54. Judgement c. General models. It is used to determine the proper mix of media to use in an advertising campaign. Action d. It takes into consideration the effect of time and uncertainty. Linear programming is a mathematical technique designed to help managers in their ______________ and ________________. General models. Options ii & iii . i. Mathematical models c. Specific models 53. Allocation. and charts. It indicates how decision makers can employ productive factors most effectively by choosing and allocating resources. Parameters appearing in the model are assumed to be variables. Planning. ___________________ include all forms of diagrams. a. Physical models. Judgement. ii. graphs. Mathematical models d. Physical models. Options i & ii c. implementation 55. Research b. iv. decision making d. Research.

y2. Min W = 16y1 + 10y2 + 20y3 Subject to 4y1 + y2 + 5y3 ≥ 5 2y1 + 2y2 + 2y3 ≤ 6 y1. iii. i. iv. Min W = 16y1 + 10y2 + 20y3 Subject to 4y1 + y2 + 5y3 ≤ 5 . Options i & ii c. Linear programming parameters have an uncertainty factor attached to them. Identify which among the following are the reasons why sensitivity analysis is important. y3 ≥ 0 c. Min W = 16y1 + 10y2 + 20y3 Subject to 4y1 + y2 + 5y3 ≤ 5 2y1 + 2y2 + 2y3 ≥ 6 y1. Options i & iii d. Min W = 16y1 + 10y2 + 20y3 Subject to 4y1 + y2 + 5y3 ≥ 5 2y1 + 2y2 + 2y3 ≥ 6 y1.56. y3 ≥ 0 d. Options i & iv b. y2. y2. The labour of computation can be considerably reduced. y3 ≥ 0 b. x2 ≥ 0 a. a. Options ii & iv 57. Write the dual of Max Z = 5x1 + 6x2 Subject to 4x1 + 2x2 ≤ 16 x1 + 2x2 ≤ 10 5x1 + 2x2 ≤ 20 x1. ii. Useful in planning future decisions. Values of linear programming parameters might change.

2C. 1B. 2A. Size of the service system a. ii-True b. 1D. number of service centres and duration of service C. i-True. service facility and queue discipline B. Hungarian method can be applied to maximisation problem. 4C b. Series or parallel arrangement a. 4D 60. i-True. All assignment problems are maximisation problems. Match the following sets: Part A 1. Service facility 2. 1B. i-False. Configuration of service system ii. 3B. Queuing system 3. 1A. 2A. 3B. y3 ≥ 0 58. Options i & ii b. Cost of the service system iv. ii-False c. ii-True d. Which of the below aspects form a part of a service system? i. 4C d. ii-False 59. 2D. Multiple service channels 4. Static queuing discipline Part B A. y2. i-False. 4C c. Speed of the service iii. Availability of service. Based on Individual Customer status in the queue D. Arrival pattern. Options i & iv . Consider the below mentioned statements: i. State True or False: a. 3D.2y1 + 2y2 + 2y3 ≤ 6 y1. ii. 3A.

Different cash counters in an electricity office where the customers can make payment in respect of their electricity bills provide an example of several servers -several queues model. 0. 30.5/day c.05 148 0.15 150 0. Single server . Consider the following statements: i.05 At present the truck will hold 150 scooters. Using the random numbers . 0. Random Numbers 82. But the production rate varies with the distribution depicted in table below. Options ii & iii 61. Deterministic. Speculative b. i -False. the average number of scooters waiting for shipment in the factory is a. ii -True c. Speculative . A factory produces 150 scooters.10 149 0. 34. State true or false a. 0. ii -True d. i -False. ii -False 62. Options i & iii d.Single queue model involves one queue – one service station facility called single server models where customer waits till the service point is ready to take him for servicing. 85. ii -False b. Probabilistic. Production rate Probability 147 0. 0. a. 64. i -True. 47.c.6/day d. i -True. The Monte Carlo technique is restricted for application involving random numbers to solve ______________ and _____________ problems. 02.15 153 0.20 151 0. 54.7/day 63.30 152 0. 50. ii.4/day b. 96.

D. B. 4C b. The problem is to determine the shipping pattern. 3B. C. a. 4C c. 4C d. 2D. Finance 2. Deterministic. CPM 3. Match the following sets related to the applications of linear programming problems: Part A 1. 2A. 2A. Match the following sets: Part A 1. Stochastic 64. 3B. The problem is to determine how many advertisements to place in each medium. 1B. Represent point in time that signifies the completion of some activities and the beginning of new ones D. Production and operations management 3. 3C.c. Stochastic d. 1A. 1A. The problem is to determine the quantities of each product that should be produced. Marketing Part B A. 4C . Activities Part B A. 2D. PERT 2. Represented by arrows and consume time and resources. a. 2A. The problem of the investor could be a portfolio-mix selection problem. 3B. Distribution 4. Events 4. Used for projects involving activities of non repetitive in nature in which time estimates are uncertain C. 1A. 1D. 2B. Indeterministic. 3C. 1D. 3B. 4D 65. Used for projects involving activities of repetitive nature B. 4D b.

3B. Position where Maximin . 2C. In a two person zero sum game. Two person zero sum game 4. 3A. 1A. 2D. 2A. 1D. 4D 66. Saddle point 2.minimax coincide B. 3A. Arise when two or more parties with Conflicting interests operate C. 4C d. Match the following sets: Part A 1. Developed by John Von Neuman and Morgenstern a. 3C. the pay-off matrix of A is: Player B B1 Player A A1 A2 4 -1 B2 7 3 B3 0 6 The pay-off matrix of B is: a. 4D 67. 4D b. 1B. ‘Theory of Games and economic behaviour’ Part B A. 3B. 4C d. Competitive situations 3.c. 1A. Rectangular game D. 2C. 2B. 1B. 1B. 2A. 3D. 4C c. Player B B1 Player A A1 A2 4 -1 B2 7 3 B3 0 6 .

Player A A1 B1 Player B B2 B3 -4 -7 0 A2 1 -3 -6 d.b. The length of the phone call is assumed to be distributed exponentially with mean 3 minutes. 0. Arrival at a telephone booth are considered to be Poisson with an average time of 10 minutes between one arrival and the next.9 d.3 b. 1 . The probability that a person arriving at the booth will have to wait is a. Player B B1 Player A A1 A2 -4 1 B2 -7 -3 B3 0 -6 c. 0. Player A A1 B1 Player B B2 B3 4 7 0 A2 1 3 6 68.6 c. 0.

660/c. 19 days P2 20 18 20 P3 32 17 18 P4 27 18 20 24 20 15 16 - 71. A branch of city bank has one cashier at its counter. 20 days b. T2 to P4.69. T3 to P2. T1 to P3. and T4 to P1 d. T3 to P4. and T4 to P1 c. T1 to P3. Assuming Poisson distribution for arrival rate and exponential distribution for service rate. a most likely time of 18 days. the total cost using Vogel approximation Method is: a. T2 to P2. What is its expected time? a. On an average nine customers arrive for every five minutes and the cashier can serve 10 customers in five minutes. Consider the following assignment problem P1 T1 T2 T3 T4 Optimum assignment schedule is a. 550/d. 440/72. An activity has an optimistic time of 15 days. T3 to P2. T1 to P1. and T4 to P1 70. 779/b. T1 to P3. 60 days c. 18 days d. T2 to P4. and T4 to P3 b. find . and a pessimistic time of 27 days. T2 to P2. W1 F1 F2 F3 19 70 40 5 W2 30 30 8 8 W3 50 40 70 7 W4 10 60 20 14 7 9 18 For the above Transportation problem. T3 to P4.

Reneging Part B A. Match the following sets: Part A 1. 1 b. (5. 15 mins c. 9 ii. 5 mins d. Average number of customer in the system: a. (1. 8 b. 4 74. The value of the game is a. (4. (2. . 0 d. 20 mins 73.i.5) c. Customers Keep on switching over from one queue to another in a multiple service centres. The saddle point for the game is a. Average time a customer spends in the system: i. Balking 2.5) ii. B1 A1 A2 A3 A4 9 6 2 5 B2 3 5 4 6 B3 1 4 4 2 B4 8 6 3 2 B5 0 7 8 1 i.3) b. 1 mins b.6) d. Collusion 3. 0 d. 1 c. 5 c.

3B. 3A. 150 units of P1 iii. 2C.4 200 . Customers do not join a queue because of their reluctance to wait. 4B c. 4A b. 4A d.6 P2 1 3 Rs. 3B.4. Jokeying B. The company should produce i. a. 180 units of P1 b. 1C. 160 units of P1 iv. a. 1C. D. 1D. Impatient customers who would not wait beyond a certain time and leave the queue. C. The ABC manufacturing company can make two products P1 and P2. 180 units of P2 iii. 3A. 1D. 2D. Relevant data are: Product P1 Cutting hrs (per unit) Finishing hrs (per unit) Profit (per unit) Maximum Sales (Unit per week) The number of cutting hours available per week is 390 and number of finishing hours available per week is 810. 2D. 190 units of P2 2 3 Rs. The company should produce i. 2C. Each of the products requires time on a cutting machine and a finishing machine. 4B 75. Only one person would join the queue. but demand service on behalf of several customers. 120 units of P1 ii. 150 units of P2 ii.

Activity Optimistic 1-2 1-3 2-4 2-5 3-5 4-6 5-6 1 1 2 1 2 2 3 Estimated duration Most likely 1 4 2 1 5 5 6 (20 Marks) Pessimistic 7 7 8 1 14 8 15 . 76.iv. Degeneracy in Transportation problems (3 Marks) 10Marks x 2 = 20Marks c. The assignment cost of assigning any one operator to any machine is given in the following table. Solve the following assignment problems. Monte Carlo simulation Method (3 Marks) b. 200 units of P2 Section-C 40 Marks Answer the following questions. (10 Marks) Machine I A B C D E 160 135 140 50 55 II 130 120 110 50 35 Operators III 175 130 155 80 70 IV 190 160 170 80 80 V 200 175 185 110 105 Case Study A project is composed of seven activities whose time estimates are listed. Operating Characteristics and constituents of a Queuing system (4 Marks) 77. Explain the following (10 Marks) a.

(c) Compute the probability that the project will be completedi.78. 4 weeks earlier than expected ii. what is the probability of meeting the due date. (a) Draw the network (b) Compute the expected project length and variance of the project length 5 Marks x 2 = 10 Marks 79. 5 Marks x 2 = 10 Marks . Not more than 4 weeks later than expected (d) If the project due is 19 weeks.