Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
1.
|
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. |
|
|
|
2.
|
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. |
|
|
|
3.
|
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. |
|
|
|
4.
|
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. |
|
|
|
5.
|
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. |
|
|
|
6.
|
Which of the following special cases does not require reformulation of the
problem in order to obtain a solution?
a. | alternate optimality | b. | infeasibility | c. | unboundedness | d. | each case requires a
reformulation. |
|
|
|
7.
|
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. |
|
|
|
8.
|
Infeasibility means that the number of solutions to the linear programming
models that satisfies all constraints is
a. | at least 1. | b. | 0. | c. | an infinite
number. | d. | at least 2. |
|
|
|
9.
|
A constraint that does not affect the feasible region is a
a. | non-negativity constraint. | b. | redundant constraint. | c. | standard
constraint. | d. | slack constraint. |
|
|
|
10.
|
All linear programming problems have all of the following properties
EXCEPT
a. | a linear objective function that is to be maximized or minimized. | b. | a set of linear
constraints. | c. | alternative optimal solutions. | d. | variables that are all restricted to
nonnegative values. |
|