Quantitative Methods For Business 12th Edition By Anderson – Test Bank

Chapter 11—Integer Linear Programming

MULTIPLE CHOICE

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

ANS: B PTS: 1 TOP: Introduction

2. In a model, x1  0 and integer, x2  0, and x3 = 0, 1. Which solution would not be feasible?
a. x1 = 5, x2 = 3, x3 = 0
b. x1 = 4, x2 = .389, x3 = 1
c. x1 = 2, x2 = 3, x3 = .578
d. x1 = 0, x2 = 8, x3 = 0

ANS: C PTS: 1 TOP: Introduction

3. Rounded solutions to linear programs must be evaluated for
a. feasibility and optimality.
b. sensitivity and duality.
c. relaxation and boundedness.
d. each of these choices are true.

ANS: A PTS: 1 TOP: LP relaxation

4. 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.

ANS: C PTS: 1 TOP: Graphical solution

5. The solution to the LP Relaxation of a maximization integer linear program provides
a. an upper bound for the value of the objective function.
b. a lower bound for the value of the objective function.
c. an upper bound for the value of the decision variables
d. a lower bound for the value of the decision variables

ANS: A PTS: 1 TOP: Graphical solution

6. 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.

ANS: B PTS: 1 TOP: Graphical solution

7. 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.

ANS: A PTS: 1 TOP: Fixed costs

8. 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.

ANS: C PTS: 1 TOP: Sensitivity analysis

9. 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

ANS: D PTS: 1 TOP: Conditional and corequisite constraints

10. Let x1 , x2 , and x3 be 0 – 1 variables whose values indicate whether the projects are not done (0) or are done (1). Which answer below indicates that at least two of the projects must be done?
a. x1 + x2 + x3  2
b. x1 + x2 + x3  2
c. x1 + x2 + x3 = 2
d. x1  x2 = 0

ANS: A PTS: 1 TOP: k out of n alternatives constraint

11. 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.

ANS: D PTS: 1
TOP: Modeling flexibility provided by 0-1 integer variables