Solve the Linear Programming Problem $P = 2 x + 8 y$

question 62

Multiple Choice

Solve the linear programming problem. Maximize $P = 2 x + 8 y$ subject to $x + y \leq 4$ $2 x + y \leq 5$ $x \geq 0 , y \geq 0$

• A) \(x = 0\) , \(y = 5\) , \(P = 40\)
• B) \(x = 1\) , \(y = 3\) , \(P = 26\)
• C) \(x = 1\) , \(y = 0\) , \(P = 26\)
• D) \(x = 2.5\) , \(y = 0\) , \(P = 5\)
• E) \(x = 0\) , \(y = 4\) , \(P = 32\)

---

Definitions:

Concession

An act of yielding or compromising in a disagreement, where one party agrees to make a change or give up something in order to reach an agreement.

Successive Concessions

A negotiation strategy where each party makes gradual concessions to reach an agreement.

Resistance Point

The price beyond which a negotiator is unwilling to go during a negotiation.

Fatigue Point

The moment at which physical or mental weariness reduces effectiveness or the ability to continue.