Consider the following linear programming problem: Maximize 40 X₁ + 30 X₂ + 60X₃ Subject to: X₁ + X₂ + X₃ ≥ 90 12 X₁ + 8 X₂ + 10 X₃ ≤ 1500 X₁ ,X₂ ,X₃ ≥ 0 How many slack,surplus,and artificial variables would be necessary if the simplex were used to solve this problem? A)3 slack,3 surplus,and 3 artificial B)1 slack,2 surplus,and 2 artificial C)1 slack,4 surplus,and 4 artificial D)1 slack,1 surplus,and 1 artificial E)None of the above

Question

Quizplus · Accepted Answer

There is one surplus variable for the "greater than or equal to" constraint, one slack variable for the "less than or equal to" constraint, and one artificial variable for the "greater than or equal to" constraint.

Consider the Following Linear Programming Problem: Maximize 40 X1

Consider the Following Linear Programming Problem: Maximize 40 X₁