1.The LP relaxation of an integer programming (IP) problem is typically easy to solve and provides a bound for the IP model.

Group of answer choices

True

False

2.The branching part of the branch and bound algorithm that Solver uses to solve integer optimization models means that the algorithm

Group of answer choices

a)searches through only a limited set of feasible integer solutions

b)creates subsets of solutions through which to search

c)uses a decision tree to find the optimal solution

d)identifies an incumbent solution which is optimal

3.In a model with 8 changing cells, all of which are constrained to be binary, the number of potentially feasible solutions is no greater than

Group of answer choices

a)2

b)8

c)16

d)256

4.In the Branch & Bound algorithm for solving a maximization problem with variables that must be integer, the linear relaxation of the problem provides a lower bound on the value of the optimal solution

Group of answer choices

True

False

5.Many inherently nonlinear problems can be transformed into linear models with the use of:

Group of answer choices

a)binary constraints

b)binary variables

c)integer constraints

d)integer variables

6.Solver may be unable to solve some integer programming problems, even when they have an optimal solution.

Group of answer choices

True

False

7.The binary variables in the fixed cost models correspond to:

Group of answer choices

a)a process for which a fixed cost occurs

b)the total profit

c)the amount of labor hours

d)the number of units or products produced