Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
1.
|
Which of the following is the most useful contribution of integer
programming?
a. | finding whole number solutions where fractional solutions would not be
appropriate | b. | using 0-1 variables for modeling flexibility | c. | increased ease of
solution | d. | provision for solution procedures for transportation and assignment
problems |
|
|
|
2.
|
Rounded solutions to linear programs must be evaluated for
a. | feasibility and optimality. | b. | sensitivity and duality. | c. | relaxation and
boundedness. | d. | each of the above is true. |
|
|
|
3.
|
Rounding the solution of an LP Relaxation to the nearest integer values
provides
a. | a feasible but not necessarily optimal integer solution. | b. | an integer solution
that is optimal. | c. | an integer solution that might be neither feasible nor optimal. | d. | an infeasible
solution. |
|
|
|
4.
|
The graph of a problem that requires x1 and x2 to be
integer has a feasible region
a. | the same as its LP relaxation. | b. | of dots. | c. | of horizontal
stripes. | d. | of vertical stripes. |
|
|
|
5.
|
The 0-1 variables in the fixed cost models correspond to
a. | a process for which a fixed cost occurs. | b. | the number of
products produced. | c. | the number of units
produced. | d. | the actual value of the fixed cost. |
|
|
|
6.
|
Sensitivity analysis for integer linear programming
a. | can be provided only by computer. | b. | has precisely the same interpretation as that
from linear programming. | c. | does not have the same interpretation and
should be disregarded. | d. | is most useful for 0-1
models. |
|
|
|
7.
|
Let x1 and x2 be 0-1 variables whose values indicate
whether projects 1 and 2 are not done or are done. Which answer below indicates that project 2 can be
done only if project 1 is done?
a. | x1 + x2 = 1 | b. | x1 + x2 =
2 | c. | x1 - x2 £ 0 | d. | x1 -
x2 ³ 0 |
|
|
|
8.
|
If the acceptance of project A is conditional on the acceptance of project B,
and vice versa, the appropriate constraint to use is a
a. | multiple-choice constraint. | b. | k out of n alternatives
constraint. | c. | mutually exclusive constraint. | d. | corequisite
constraint. |
|
|
|
9.
|
In an all-integer linear program,
a. | all objective function coefficients must be integer. | b. | all right-hand side
values must be integer. | c. | all variables must be
integer. | d. | all objective function coefficients and right-hand side values must be
integer. |
|
|
|
10.
|
Most practical applications of integer linear programming involve
a. | only 0-1 integer variables and not ordinary integer variables. | b. | mostly ordinary
integer variables and a small number of 0-1 integer variables. | c. | only ordinary
integer variables. | d. | a near equal number of ordinary integer
variables and 0-1 integer variables. |
|