Author Question: A linear programming problem contains a restriction that reads "the quantity of X must be at least ... (Read 72 times)

joe · **on:** Dec 3, 2019

Question 1

A linear programming problem has two constraints 2X + 4Y = 100 and 1X + 8Y ≤ 100, plus non-negativity constraints on X and Y. Which of the following statements about its feasible region is true?
◦ The graphical origin (0, 0) is not in the feasible region.
◦ The points (100, 0) and (0, 25) both lie outside the feasible region.
◦ The feasible region is a straight line segment, not an area.
◦ The two corner points are (33-1/3, 8-1/3) and (50, 0).
◦ All of the above are true.

Question 2

A linear programming problem contains a restriction that reads "the quantity of X must be at least three times as large as the quantity of Y." Which of the following inequalities is the proper formulation of this constraint?
◦ X + Y≥3
◦ X ≤ 3Y
◦ X - 3Y ≥ 0
◦ 3X ≤ Y
◦ 3X ≥ Y

bpool94 · **Reply #1 on:** Dec 3, 2019

A FREE account is required to view all solutions!

Lorsum iprem. Lorsus sur ipci. Lorsem sur iprem. Lorsum sur ipdi, lorsem sur ipci. Lorsum sur iprium, valum sur ipci et, vala sur ipci. Lorsem sur ipci, lorsa sur iprem. Valus sur ipdi. Lorsus sur iprium nunc, valem sur iprium. Valem sur ipdi. Lorsa sur iprium. Lorsum sur iprium. Valem sur ipdi. Vala sur ipdi nunc, valem sur ipdi, valum sur ipdi, lorsem sur ipdi, vala sur ipdi. Valem sur iprem nunc, lorsa sur iprium. Valum sur ipdi et, lorsus sur ipci. Valem sur iprem. Valem sur ipci. Lorsa sur iprium. Lorsem sur ipci, valus sur iprem. Lorsem sur iprem nunc, valus sur iprium.

Answer Preview

Only 25% of students answer this correctly