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

question 95

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:

Agent By Conduct

An individual or entity that acts on behalf of another party in a way that suggests they have the authority to do so, even if no formal agency relationship exists.

Grain Sellers

Individuals or companies engaged in the business of selling grains either wholesale or retail.

Soybeans

A type of legume native to East Asia, widely grown for its edible bean which has numerous uses, including oil, meal, and as a vegetable.

Processing Facilities

Locations or sites equipped with machinery and technology for treating or handling materials or goods.