Author Question: Which of the following approaches to solving integer linear optimization problems tries to identify ... (Read 178 times)

a0266361136 · **on:** Jun 24, 2018

Which of the following approaches to solving integer linear optimization problems tries to identify the convex hull by adding a series of new constraints that do not exclude any feasible integer points?
a. Branch-and bound approach
b. Cutting plane approach
c. Trial-and-error approach
d. Convex hull approach

Question 2

A fast food restaurant has automatic drink dispensers to help fill orders more quickly. When the 12 ounce button is pressed, they would like for exactly 12 ounces of beverage to be dispensed. There is, however, undoubtedly some variation in this amount. The company does not want the machine to systematically over fill or under fill the cups. Which of the following gives the correct set of hypotheses
a. H0: U > 12, Ha : U < 12.
b. H0: U = 12, Ha : U 12.
c. H0: U 12, Ha : U > 12.
d. H0: U 12, Ha : U < 12.

alexanderhamilton · **Reply #1 on:** Jun 24, 2018

Answer to Question 1

b
RATIONALE: Cutting plane approaches try to identify the convex hull by adding a series of new constraints that do not exclude any feasible integer points.

Answer to Question 2

d
RATIONALE: The correct set of hypotheses is H0 : u = 12, Ha : u 12 . They do not want the cups to be over or under filled, so they should use a two-sided alternative hypothesis.