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

question 65

Multiple Choice

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.

---

Definitions:

Benefits Promised

Guarantees or assurances given by an employer to employees, often relating to retirement, health care, or other support.

Case-by-Case Basis

A method of analysis or decision-making where each situation is considered individually, with attention to its unique aspects and details.

Substantial

Significantly valuable, large, or meaningful.

Repudiation

The rejection or refusal to acknowledge or pay a debt, obligation, or contract.