Test your basic knowledge |

Operations Research

Subject : business-skills
Instructions:
  • Answer 31 questions in 15 minutes.
  • If you are not ready to take this test, you can study here.
  • Match each statement with the correct term.
  • Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. Graphically speaking - the feasible solution points occurring at the vertices or "corners" of the feasible region. With two-variable problems - they are determined by the intersection of the constraint lines.






2. The distribution channel is the ______________ part of the supply chain from manufacturer to consumer.






3. A controllable input for a linear programming model.






4. The situation in which no solution to the linear programming problem satisfies all of the constraints.






5. An equation or inequality that rules out certain combinations of decision variables as feasible solutions.






6. A solution that satisfies all the constraints simultaneously.






7. In facility planning - which capacity cushion strategy would be appropriate when the cost of stockouts far exceeds the cost of additional building - equipment and resources?






8. A set of constraints that requires all variables to be nonnegative.






9. The study of how changes in teh coefficients of a linear pgoramming problem affect the optimal solution.






10. A cost that depends upon the decision made. The amount will vary depending on the values of the decision variables.






11. A representation of a problem where teh objective and all constraint conditions are described by mathematical expressions.






12. A linear program in which all of the constraints are written as equalities. The optimal solution is the same as the optimal solution of the original formulation of the linear program.






13. Of the cost elements making up total inventory cost - which is the most difficult to estimate?






14. The process of translating a verbal statement of a problem into a mathematical statement called the mathematical model.






15. A cost that is not affected by the decision made. It will be incurred no matter wha tvalues the decision variables assume.






16. One option for altering the pattern of demand which impacts aggregate planning is...






17. The firm produces exactly what is needed every month adjusting short term capacity through the use of overtime - part-time - temporary and contracted workers.






18. A variable added to teh left-hand side of a less-than-or-equal-to constraint to convert teh constraint into an equality. The value of this variable can usually be interpreted as the amount of unused resource.






19. It requires that inventory be classified according to Annual dollar usage






20. It assumes that the facility decisions are made and cannot be easily changed over the next 6 to 18 months.






21. A variable subtracted from teh lef-hand side of a greater-than-or-equal-to constraint to convert the constraint into an equality. The value of this varible can usually be interpreted as the amount over and above some required minimum level.






22. The case in which more than one solution provides the optimal value for the objective function.






23. A constraint that does not affect teh feasible region. If a constraint is redundant - it can be removed from the problem without affecting the feasible region.






24. Mathematical expressions in which the variables appear in separate terms and are raised to the first power.






25. A mathematical model with a linear objective function - a set of linear constraints - and nonnegative variables.






26. A rule indicating when simultaneous change in two or more objection function coefficients will not cause a change in the optimal values for the decision variables. It can also be applied to indicate when two or more right-hand-side changes will not c






27. The expression that defines teh quantity to be maximized or minimized in a linear programming model.






28. The situation in which the value of the solution may be made infinitely small in a minimization problem wtihout violating any of the constraints.






29. The amount by whcih an objective function coefficient would have to improve (increase for a maximization problem - decrease for a minimization problem) before it would be possible for the corresponding variable to assume a positive value in the opti






30. The set of all feasible solutions.






31. The improvement in the value of the optimal solution per unit increase in the right-hand side of a constraint.