Problems:
Quantitative Methods: True/False
True/False
1. When the right-hand sides of 2 constraints are both increased by 1 unit, the value of the objective function will be adjusted by the sum of the constraints' prices.
2. The sensitivity range for an objective coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.
3. In a balanced transportation model, supply equals demand such that all constraints can be treated as equalities.
4. In a mixed integer model, some solution values for decision variables are integer and others can be non-integer.
5. The solution value (Z) to the linear programming relaxation of a maximization problem will always be less than or equal to the optimal solution value (Z) of the integer programming maximization problem
6. The solution to the LP relaxation of a maximization integer linear program provides a lower bound for the value of the objective function.
7. If we are solving a 0-1 integer programming problem, the constraint x1 + x2 + x3 ≤ 3 is a mutually exclusive constraint.
8. The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination.
9. The transshipment model is an extension of the transportation model in which intermediate transshipment points are added between the sources and destinations.
FILL IN THE BLANKS
10. An ______________ solution violates at least one of the model constraints.
11. Multiple optimal solutions can occur when the objective function line is __________ to a constraint line.
12. The sensitivity range for an _____________coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.
13. In a maximization linear programming problem profit is maximized in the objective function by subtracting cost from ____________.
14. In a problem involving capital budgeting applications, the 0-1 variables designate the ____________ or _____________ of the different projects.
15. In solving an integer linear programming problem, rounding ____ ________ solution values does not guarantee neither an optimal nor a feasible solution.
16. If we are solving a 0-1 integer programming problem, the constraint x1 + x2 ≤ 1 is a ________________constraint.
17. An example of a ________________ point is a distribution center or warehouse located between plants and stores.
18. A plant has 4 jobs to be assigned to 4 machines, each machine has different manufacturing times for each product. The production manager wants to determine the optimal assignments of 4 jobs to 4 machines to minimize total manufacturing time. This problem can be most efficiently solved using the ________________ model.