Author Question: A maximizing linear programming problem with constraints C1, C2, and C3 has been solved. The dual ... (Read 90 times)

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

Question 1

A linear programming problem has three constraints:
2X + 10Y ≤ 1004X + 6Y ≤ 1206X + 3Y ≥ 90
What is the largest quantity of X that can be made without violating any of these constraints?
◦ 50
◦ 20
◦ 15
◦ 30
◦ 10

Question 2

A maximizing linear programming problem with constraints C1, C2, and C3 has been solved. The dual values associated with the problem are C1 = $2, C2 = $0.50, and C3 = $0. Which statement below is false?
◦ The resource in C3 has not been used up.
◦ One more unit of the resource in C2 would add one more unit each of X and Y.
◦ The resource in C2 must be used up first.
◦ One more unit of the resource in C1 would add $2 to the objective function value.
◦ The resources in C1 and in C2, but not in C3, are scarce.

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