Previous Year Very Short Questions of OR (B-TECH mechanical engineering 7-8th)

  1. Home
  2. ptu
  3. b-tech
  4. me
  5. 7-8th
  6. or
Watch More

Operations research

Previous year question paper with solutions for Operations research

Our website provides solved previous year question paper for Operations research . Doing preparation from the previous year question paper helps you to get good marks in exams. From our OR question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

These Questions are downloaded from www.brpaper.com You can also download previous years question papers of 10th and 12th (PSEB & CBSE), B-Tech, Diploma, BBA, BCA, MBA, MCA, M-Tech, PGDCA, B-Com, BSc-IT, MSC-IT.

Question papers (year-wise)
Very short questions
Print this page
  1. Draw a flowchart for the computational procedure for a LPP using simplex method.
  2. Explain any three applications of LPP in management.
  3. Compare simplex method and dual simplex method.
  4. What is the importance of Poisson and Exponential distribution in Queuing theory?
  5. What are the basic characteristics of a queuing system?
  6. Write short note on two person zero sums game.
  7. Write down the steps of the graphical method to obtain an optimal solution to a linear programming problem
  8. Give essential characteristics of queuing procedure.
  9. Explain shortly the (M/M/I) : ( / FIFO), Mean and variance of the queue length?
  10. What are the advantages and disadvantages of simulation?
  11. Name two advantages of a good model.
  12. Write two assumptions made in linear programming.
  13. Name three rule for game theory.
  14. Define .key column in simplex method.
  15. What do you mean by balanced transportation problem.
  16. Name three steps of goal programming.
  17. List two uses of replacement model.
  18. Define independent float.
  19. Name three direct inventories.
  20. Name any four mathematical models.
  21. Explain objective function and unrestricted variables with suitable example.
  22. Write the dual of the LPP : Maximize Z = 4x1 + 9x2 + 2x3, subject to 2x1 + 3x2 + 2x3  7, 3x1 – 2x2 + 4x3 = 5, x1, x2, x3  0.
  23. State assumptions of goal programming.
  24. Define competitive game.
  25. Write down major advantages of simulation models.
  26. State the “principle of optimality” in dynamic programming.
  27. Explain queuing system and steady state.
  28. Write down various types of replacement models.
  29. Explain briefly the problem of inventory control with deterministic demand.
  30. State Fulkerson’s rule for numbering the nodes in a network.