Statistics Solutions

(See Solution) You are using the simplex method to solve the following linear programming problem. Maximize Z = 6 x 1 + 5 x 2 - x 3 + 4 x 4 , subject to

Question:

You are using the simplex method to solve the following linear programming problem.

Maximize Z = 6 x 1 + 5 x 2 - x 3 + 4 x 4 ,

subject to

3 x 1 + 2 x 2 - 3 x 3 + x 4 ≤ 120

3 x 1 + 3 x 2 + x 3 + 3 x 4 ≤ 180

and

x 1 ≥ 0, x 2 ≥ 0, x 3 ≥ 0, x 4 ≥ 0.

You have obtained the following final simplex tableau where x 5 and x 6 are the slack variables for the respective constraints.

Coefficient of:
Basic Variable Eq. Z x 1 x 2 x 3 x 4 x 5 x 6 Right Side
Z (0) 1 0 \[\frac{1}{4}\] 0 \[\frac{1}{2}\] \[\frac{3}{4}\] \[\frac{5}{4}\] Z*
x 1
0 1 \[\frac{11}{12}\] 0 \[\frac{5}{6}\] \[\frac{1}{12}\] \[\frac{1}{4}\] \[b_{1}^{*}\]
x 3 (2) 0 0 \[\frac{1}{4}\] 1 \[\frac{1}{2}\] - \[\frac{1}{4}\] \[\frac{1}{4}\] \[b_{2}^{*}\]

Use the fundamental insight presented in Sec. 5.3 of the textbook to identify Z* , \[b_{1}^{*}\] , and \[b_{2}^{*}\] .

Price: $2.99
Solution: The downloadable solution consists of 2 pages
Deliverable: Word Document


∴ Other downloads you may be interested in ∴

log in to your account

Forgot password?
Don't have a membership account?
REGISTER

reset password

Back to
log in

sign up

Back to
log in