A Maximizing Linear Programming Problem with Constraints C1, C2, and C3

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?

A) One more unit of the resource in C1 would add $2 to the objective function value.
B) One more unit of the resource in C2 would add one more unit each of X and Y.
C) The resource in C3 has not been used up
D) The resources in C1 and in C2, but not in C3, are scarce.
E) All of the above are true.

Correct Answer:

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Access For Free