Author Question: The ___________ approach to solving integer linear optimization problems breaks the feasible region ... (Read 176 times)

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

The ___________ approach to solving integer linear optimization problems breaks the feasible region of the LP Relaxation into subregions until the subregions have integer solutions or it is determined that the solution cannot be in the subregion.
a. cutting plane
b. trial-and-error
c. breaking region
d. branch-and-bound

Question 2

The average number of hours for a random sample of mail order pharmacists from company A was 50.1 hours last year. It is believed that changes to medical insurance have led to a reduction in the average work week. To test the validity of this belief, the hypotheses are
a. H0: U > 50.1, Ha : U < 50.1.
b. H0: U = 50.1, Ha : U 50.1.
c. H0: U 50.1, Ha : U > 50.1.
d. H0: U 50.1, Ha : U < 50.1.

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

Answer to Question 1

d
RATIONALE: The branch-and-bound approach to solving integer linear optimization problems breaks the feasible region of the LP Relaxation into subregions until the subregions have integer solutions or it is determined that the solution cannot be in the subregion.

Answer to Question 2

d
RATIONALE: The assumption to be challenged is last year's average. The alternative hypothesis comes from the fact that they believe there has been a reduction in the average work week. So the alternative hypothesis is Ha : u < 50.1 . The null is the complement of that: H0 : u 50.1.