Share
Explore BrainMass

Statistics - Simplex method

Study problem: 4-10

Solve the following linear programming model by the simplex method.

Maximize Z= $40x1 + $30x2

Subject to: 2 x1 + 2 x2  240

2 x1  120

2 x2  80

x1, x2  0

Study Problem: 4-12

Solve the following linear programming model by the simplex method.

Minimize Z = $2 x1 + $3 x2

Subject to: 2 x1 + 5 x2  30

4 x1 + 2 x2  28

x1, x2,  0

Attachments

Solution Summary

A Complete, Neat and Step-by-step Solution is provided in the attached file.

$2.19