Page 1 of 1
Solve the linear programming problem using the simplex method. Maximize P= -x₁ + 2x₂ X₁ + X₂ ≤2 subject to -X₁ + 3x₂ 18
Posted: Wed Jul 06, 2022 11:56 am
by answerhappygod
- Solve The Linear Programming Problem Using The Simplex Method Maximize P X 2x X X 2 Subject To X 3x 18 1 (19.87 KiB) Viewed 19 times
Solve the linear programming problem using the simplex method. Maximize P= -x₁ + 2x₂ X₁ + X₂ ≤2 subject to -X₁ + 3x₂ 18 X₁ - 4x₂ ≤ 10 X₁, X₂ 20 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. OA. The maximum value of P is P= when x₁ = (Simplify your answers.) OB. There is no optimal solution. and x₂ = |