#
Question

11. The product design and market share optimization problem presented in the textbook is formulated as a 0-1 integer linear programming model.

a. True

b. False

12. The objective of the product design and market share optimization problem presented in the textbook is to choose the levels of each product attribute that will maximize the number of sampled customers preferring the brand in question.

a. True

b. False

13. If a problem has only less-than-or-equal-to constraints with positive coefficients for the variables, rounding down will always provide a feasible integer solution.

a. True

b. False

14. Dual prices cannot be used for integer programming sensitivity analysis because they are designed for linear programs.

a. True

b. False

15. Some linear programming problems have a special structure that guarantees the variables will have integer values.

a. True

b. False

16. Generally, the optimal solution to an integer linear program is less sensitive to the constraint coefficients than is a linear program.

a. True

b. False

17. The classic assignment problem can be modeled as a 0-1 integer program.

a. True

b. False

18. If Project 5 must be completed before Project 6, the constraint would be x_{5} − x_{6} ≤ 0.

a. True

b. False

19. If the LP relaxation of an integer program has a feasible solution, then the integer program has a feasible solution.

a. True

b. False

20. Multiple choice constraints involve binary variables.

a. True

b. False