Solve the following linear programming problem graphically: Maximize Z=4X₁ +4X₂ Subject to: 3X₁ +5X₂ ≤ 150 X₁ - 2X₂ ≤ 10

[answerhappygod]

Solve The Following Linear Programming Problem Graphically Maximize Z 4x 4x Subject To 3x 5x 150 X 2x 10 1 (113.16 KiB) Viewed 8 times

Solve the following linear programming problem graphically: Maximize Z=4X₁ +4X₂ Subject to: 3X₁ +5X₂ ≤ 150 X₁ - 2X₂ ≤ 10 5X₁ + 3X₂ ≤ 150 X₁, X₂ ≥0 1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints. 2) Using the point drawing tool, plot the five corner points which define the feasible region. and X₂ = (round your responses to two decimal The optimal solution is X₁ = places). Maximum profit is $ (enter your response as a whole number). C 50+ 40- 30- 20- 10- 10 20 30 40 X₁ - 50