SAMPLE FINAL EXAM, Management Science (QMIS 205)PLEASE NOTE: Final Exam is Comprehensive .
Students should also review the sample test for the midterm
True or False questions
In LP, the objective function always consists of either maximizing or minimizing some value.
Parameters are known, constant values that are usually coefficients of variables in equations.
Binary variables are best suited to be the decision variables when dealing with yes-or-no decisions.
If a transportation problem has four origins and five destinations, the LP formulation of the problem willhave nine functional (structural) constraints.
A transportation problem with 3 sources and 4 destinations will have exactly 7 terms in the objectivefunction.
In an unbalanced transportation model, all constraints are equalities.
Assignment problems are cost minimization problems and cannot be solved as a profit maximization problem.
In an assignment problem, every source and every destination has a demand of either 0 or 1.
A prohibited route in a transportation model should be assigned an arbitrarily high cost coefficient.
A constraint with a ≥ sign in a linear programming model is to restrict th
e usage of a limited resource.
To find the optimal solution for an integer programming problem we can solve it as a linear programming problem and then round the solution.
In LP, an infeasible solution violates all of the constraints of the problem.
When solving a minimization problem graphically, it is generally the goal to move the objectivefunction line out, away from the origin, as far as possible.
In a total integer model, all decision variables have integer solution values.
In a mixed integer model, some solution values for decision variables are integer and others can be non
When a certain route in a transportation problem does not exist, the problem cannot be formulated as atransportation problem.
When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved.