# Solving linear programming problem by simplex method

Not what you're looking for? Search our solutions OR ask your own Custom question.

Find x1 ≥ 0, x2 ≥ 0, and x3 ≥ 0 such that

X1 + x2 + 2x3 ≤ 38

2x1 + x2 + x3 ≥ 24

And z = 3x1 + 2x2 + 2x3 is maximized.

https://brainmass.com/math/linear-programming/solving-linear-programming-problem-simplex-method-254019

#### Solution Preview

Hi,

Please find the solutions/explanations attached herewith.

I hope it will help you.

Thanks

Use the simplex method to solve

Find x1 â‰¥ 0, x2 â‰¥ 0, and x3 â‰¥ 0 such that

X1 + x2 + 2x3 â‰¤ 38

2x1 + x2 + x3 â‰¥ 24

And z = 3x1 + ...

#### Solution Summary

Step by step solution to the problem is provided.

$2.49