# Operations Research Important Question Bank 2014 – Quest Tutorials

0

Linear Programming Problem (LPP)

Q.1. What are additivity, proportionality and continuity in LPP? (Nov 2012)

Q.2. When does a simplex solution to a Linear Programming problem become unbounded? (April 2009)

Q.3. What is an infeasible solution in LPP? (Oct‟ 07)

Q.4. What are alternate optima in LPP? (when do you get multiple solutions to an LPP?) ( Oct06)

Q.5.What is shadow price and what is its application? (April 08)

Q.6.What is a unique optimal solution? How do you test if a solution is unique in simplex method? (April 07)

Q.7.Uses of Slack, surplus and artificial variables in solving the LPP. (April 04)

Q.8. In simplex algorithm what does basis consists of? (Oct ‟08)

Q.9. Distinguish between Basic Feasible solution and Optimal solution in LPP. (Oct‟05)

Q.10. Major steps in formulation of an LPP problem. (Oct 04)

Transportation

Q.1. Explain the tests which are applied to an initial (starting) basic solution before carrying out optimality test in a Transportation problem? (April 2009)

Q.2. What is degeneracy in transportation problem? (April 06)

Q.3. Explain unbalanced transportation problem? (April 05)

Q.4. What is looping in transportation problem? (Ap‟04)

Q.5.What is the difference between Transportation problem and Assignment problem? (Ap‟04) Q.6. Explain degeneracy test in transportation problem. (Oct‟07)

Q.7. Prohibited transportation problem (Oct‟05)

Assignment

Q.1. In an assignment problem how many jobs can assigned to a worker? What procedure is followed  as per Hungarian method if  you have  more workers than jobs in an assignment problem? (Ap‟09)

Q.2. How do you prepare a balanced maximization problem with restrictions for Hungarian method in assignment problem? (Ap‟08)

Q.3.Comment on Regret matrix in Assignment problem. (Ap‟07)

Q.4. Write briefly on multiple optimal solutions in an assignment problem? (Ap‟05)

Q.5.How will you deal with the assignment problem where some assignments are prohibited? (Oct‟09)

Q.6. What is the principle behind a balanced assignment problem? (Oct‟08)

Q.7. What is reduced matrix in Assignment problem? (Oct‟07)

Q.8. What is unbalance assignment problem? (Oct‟05 and 03) Q.9. Comment on optimality in an assignment problem? (Oct‟06)

Q.10.How do you test a solution to an assignment problem to conclude the solution is optimal?

PERT and CPM

Q.1. In what kind of projects is resource requirement probabilistic? Give two suitable examples. (Ap‟09)

Q.2. What is the utility of total float or slack in project monitoring? (Ap‟08)

Q.3. Comment on Indirect cost in a project? (Ap‟07)

Q.4. Distinguish between free float and Independent float. (Ap‟05)

Q.5. What is Dangling event and Dummy activity in network diagram? (Ap‟05)

Q.6. Explain total float, free float and Independent float, (Oct‟07)

Q.7. Explain Critical Path in PERT/CPM analysis. (Oct‟06)

Q.8. Define Optimistic, Pessimistic and Most likely times. (Oct‟05)

Q.9. What are events and activities in PERT and CPM analysis? (Oct‟04) Q.10. Comment on Sub-critical path in PERT/ CPM analysis. (Oct‟03)

0