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

Group of answer choices

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

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

Group of answer choices

True

False

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

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

2

8

16

256