CH 2 BUS104
Decision variables a. tell how much or how many of something to produce, invest, purchase, hire, etc. b. represent the values of the constraints. c. measure the objective function. d. must exist for each constraint.
A
All of the following statements about a redundant constraint are correct EXCEPT a. A redundant constraint does not affect the optimal solution. b. A redundant constraint does not affect the feasible region. c. Recognizing a redundant constraint is easy with the graphical solution method. d. At the optimal solution, a redundant constraint will have zero slack.
D
The maximization or minimization of a quantity is the a. goal of management science. b. decision for decision analysis. c. constraint of operations research. d. objective of linear programming.
D
To find the optimal solution to a linear programming problem using the graphical method a. find the feasible point that is the farthest away from the origin. b. find the feasible point that is at the highest location. c. find the feasible point that is closest to the origin. d. None of the alternatives is correct.
D
A redundant constraint is a binding constraint. T/F?
F
An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem. T/F?
T
In a feasible problem, an equal-to constraint cannot be nonbinding. T/F?
T
The standard form of a linear programming problem will have the same solution as the original problem. T/F?
T
A constraint that does not affect the feasible region is a a. non-negativity constraint. b. redundant constraint. c. standard constraint. d. slack constraint.
B
Slack a. is the difference between the left and right sides of a constraint. b. is the amount by which the left side of a ≤ constraint is smaller than the right side. c. is the amount by which the left side of a ≥ constraint is larger than the right side. d. exists for each variable in a linear programming problem.
B
The improvement in the value of the objective function per unit increase in a right-hand side is the a. sensitivity value. b. dual price. c. constraint coefficient. d. slack value.
B
A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called a. optimal. b. feasible. c. infeasible. d. semi-feasible.
C
Which of the following statements is NOT true? a. A feasible solution satisfies all constraints. b. An optimal solution satisfies all constraints. c. An infeasible solution violates all constraints. d. A feasible solution point does not have to lie on the boundary of the feasible region.
C
