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 may or may not be feasible.
c. it does not affect the value of the objective function.
d. it always produces a feasible solution.

Option 'c' is correct.

Step-by-step explanation:

Since we have given that

the optimized solution of a linear program to an integer as it does not affect the value of the objective function.

As if we round the optimized solution to the nearest integer, it does not change the objective function .

while it is not true that it always produces the most optimal integer solution or feasible solution.

Hence, Option 'c' is correct.

i believe it is c.y = 9x

rise over run. 9 units up over 1 unit right or 9/1

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!