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) The resource in C2 must be used up first.
Correct Answer:
Verified
Q12: A linear programming problem contains a restriction
Q44: A firm makes two products, Y and
Q46: Consider the following constraints from a two-variable
Q47: Suppose that a maximization LP problem has
Q49: A shadow price (or dual value) reflects
Q52: Suppose that an iso-profit line is given
Q53: A linear programming maximization problem has been
Q57: The difference between minimization and maximization problems
Q58: Suppose that an iso-profit line is given
Q60: A linear programming problem has three constraints:
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents