Label each of the following statements as True or False, and then justify your answer by referring to specific statements

(with page citations) in the chapter.

(a) Linear programming problems are generally much easier to solve than IP problems.

(b) For IP problems, the number of integer variables is generally more important in determining the computational difficulty than is the number of functional constraints.

(c) To solve an IP problem with an approximate procedure, one may apply the simplex method to the LP relaxation problem and then round each noninteger value to the nearest integer.
The result will be a feasible but not necessarily optimal solution for the IP problem.
D,I 12.6-1.* Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively.
Maximize Z 2x1  x2 5x3  3x4 4x5, subject to 3x1  2x2 7x3  5x4 4x5  6 x1  x2 2x3  4x4 2x5  0 and xj is binary, for j 1, 2, . . . , 5.