Author Question: Which of the following is true of rounding the optimized solution of a linear program to an integer? ... (Read 127 times)

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

Which of the following is true of rounding the optimized solution of a linear program to an integer?
a. It always produces the most optimal integer solution.
b. It always produces a feasible solution.
c. It does not affect the value of the objective function.
d. It may or may not be feasible.

Question 2

A null and alternative hypothesis for a one proportion z test are given as H0: p = 0.8, Ha: p < 0.8 . This hypothesis test is
a. lower-tailed.
b. upper-tailed.
c. two-tailed.
d. these hypotheses are incorrectly stated.

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

Answer to Question 1

d
RATIONALE: Rounding to an integer solution is a trial-and-error approach. Each rounded solution must be evaluated for feasibility as well as for its impact on the value of the objective function. Even when a rounded solution is feasible, we do not have a guarantee that we have found the optimal integer solution.

Answer to Question 2

a
RATIONALE: If the alternative hypothesis contains the not-equal-to inequality symbol, then it is a two-tailed test. If the alternative hypothesis contains the less-than inequality symbol, then it is a left-tailed test. If the alternative hypothesis contains the greater-than inequality symbol, then it is a right-tailed test.