Author Question: A linear programming problem has two constraints 2X + 4Y 100 and 1X + 8Y 100, plus nonnegativity ... (Read 114 times)

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

A linear programming problem has two constraints 2X + 4Y ≥ 100 and 1X + 8Y ≤ 100, plus nonnegativity constraints on X and Y. Which of the following statements about its feasible region is true?
◦ The feasible region is triangular in shape, bounded by (50, 0), (33-1/3, 8-1/3), and (100, 0).
◦ The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized.
◦ The graphical origin (0, 0) is in the feasible region.
◦ The two corner points are (0, 0) and (50, 12.5).
◦ There are four corner points including (50, 0) and (0, 12.5).

dudman123 · **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