(10) If the optimal solution to the LP Relaxation problem is an integer, it is the optimal solution to the integer linear program. a. True b. False (11) In a model involving fixed costs (e.g., setup cost or sales cost), the 0-1 binary variable guarantees that the capacity is not consumed unless the cost has been incurred. a. True b. False (12) The constraint x1 - x2 = 0 implies that if project 1 is selected, project 2 cannot be selected. a. True b. False (13) If a maximization 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) The maximal flow problem can be formulated as a capacitated transshipment problem and determines the maximum amount of flow (such as messages, vehicles, fluid, etc.) that can enter and exit a network system in each time-period. a. True b. False