I know Operations Research is one of the most anxious papers that gives sleepless nights to many of you. However its not that a difficult paper. Instead of following a unit by unit guidelines, lets understand how the OR paper is being framed.
Q1. (15 marks. Attempt any 2 out of 3)
- A very simple question based on forming the equations and plotting on the graph paper. Only 2 variable model would be asked. At max 3-4 equations, 1 objective function and non negativity constrains need to be written. Practice multiple past exam paper sums. That should be sufficient
- LPP simplex. A sum which is already framed. A max of either 2 or 3 variables with either 2 or 3 variables. A maximum of 3 tables simplex needs to be solved. DO NOT solve sums of minimization types or mix constraints. Only maximization type sums would come. No constraints which are greater than or equal to needs to be done.
- Either a LPP sums to be formulated and then solved by graphical or Simplex. Or some basic concept testing on graphical or simplex like slack variables, LPP constructions, Variables and objective functions, unboundness, redundancy and infeasibility in graphical, degeneracy alternate and optimum solution in simplex, shadow prices, ISO profit or ISO cost lines, duality, artificial variables.
Q 2. (15 marks. Attempt any 2 out of 3)
- A very simple either a 4×4 or 5×5 or a unbalanced maximization or minimization sum on assignment. Do not do sums on flight scheduling, travelling salesman, etc. Maximum of only 2 iterations after the row/column minimization table.
- A balanced/unbalanced maxima or minim transportation sum to be initially done either by NWC, LCM or VAM and tested by MODI. Maximum of only 2 loops. Also do not do sums on degeneracy. Degeneracy only at theory level.
- Either a transportation sum or theory on regret matrix, Hungarian method, degenerancy, restricted assignment
Q 3. (15 marks. Solve 2 of 3)
- A sum involving drawing a network diagram and calculation of critical paths, EST, EFT, LST, LFT, floats and slack. Not more than 10 activities. A very simple sum. However you need to be careful on calculations and network diagram. 1 mistake at any step can lead to the entire sums being incorrect.
- A simple sum on PERT involving diagram drawing, calculation of calculated time, variances and SD of the path. Then calculation of the probability for the given time or time for a given probability
- Crashing sum involving diagram drawing, cost and time estimation and then calculation of optimum time and cost. Only upto a maximum of 4 steps for crashing needs to be done. Concepts may be asked on burst and merge activity, time estimates in PERT, crashing steps, Updating etc.
Q 4 (15 marks, solve any 2 of 3)
- A sum on construction of pay off and then calculating the EMV, EPPI, EVPI and EOL. Or a sum where you need to choose alternatives based on Maximax or Maximin , laplace, hurwicz and Minimax regret needs to be done. No decision tree needs to be done.
- A very simple sum on job sequencing on 2 machines or max 3 machines and calculation of total time and idle time on machines.
- A very simple sum on pure strategy with saddle point and may be small concepts on saddle point, payoffs, players, strategies etcs to be covered at basic concept level.
Q 5. Numericals on any of the following may be included. Note any 1 of the following:-
- Case of transportation where an initial solution might be given and you are supposed to optimise the same via MODI and answer a few question on cell penalties
- A case on either PERT/Crashing to be done in the similar way that was mentioned in Q3
- A simplex table solved and given (either complete or incomplete) which needs to be evaluated for optimality and some questions pertain to the final cj-zj row.
Of the above, transportation or Simplex seems more likely.
Text books recommended
- Vipul Publications:- Nitin Kulkarni
- Sheth Publications:- Shrotri, Pandit
For any further clarifications, please feel free to contact Prof Vipin Saboo on 9820779873.