Operations Research Puzzle

Edit Answers
123456789101112131415161718192021222324252627282930
Across
  1. 2. : North-West Corner Rule used to obtain an initial feasible solution in Transportation Problem.
  2. 4. : Condition where objective function value can increase or decrease indefinitely.
  3. 5. : The original Linear Programming Problem.
  4. 7. : Vectors that cannot be expressed as a linear combination of each other.
  5. 10. : Rectangular array of numbers arranged in rows and columns.
  6. 12. : Critical Path Method used for deterministic project scheduling.
  7. 13. : Special type of LPP that deals with distribution of goods from sources to destinations.
  8. 16. : A flat affine subspace of one dimension less than its ambient space.
  9. 18. : Single-server queuing model with Poisson arrivals and exponential service times.
  10. 19. : Method used to solve Assignment Problems optimally.
  11. 22. : Game where one player’s gain equals another player’s loss.
  12. 24. : A corner point of the feasible region.
  13. 26. : A limiting constraint that restricts the feasible region.
  14. 29. : A feasible solution obtained by setting non-basic variables equal to zero.
Down
  1. 1. : Variable introduced in Big-M or Two-Phase method to obtain an initial feasible solution.
  2. 3. : Function that needs to be maximized or minimized in LPP.
  3. 6. : Iterative algorithm used to solve Linear Programming Problems.
  4. 8. : Concept that every Linear Programming Problem has a corresponding dual problem.
  5. 9. : Another term for extreme point of feasible region.
  6. 10. : To find the smallest value of the objective function.
  7. 11. : Method that assigns a very large penalty cost to artificial variables in the objective function.
  8. 14. : Variable added to convert ≤ constraint into equality form.
  9. 15. : Condition in Transportation Problem where total supply equals total demand.
  10. 17. : Program Evaluation and Review Technique used for probabilistic project scheduling.
  11. 20. : Variable subtracted to convert ≥ constraint into equality form.
  12. 21. : A solution that satisfies all constraints of an optimization problem.
  13. 23. : Maximum number of linearly independent rows or columns in a matrix.
  14. 25. : Process of reducing project duration by increasing resources at additional cost.
  15. 27. : A basic feasible solution where one or more basic variables are zero.
  16. 28. : Quantity having magnitude and direction.
  17. 30. : A set of linearly independent vectors that spans a vector space.