Use the simplex method to solve the following. Maximize z = 300x_1 + 200x_2 + 10

Question

Use the simplex method to solve the following. Maximize z = 300x_1 + 200x_2 + 100x_3 subject to x_1 + x_2 + x_3 lessthanorequalto 200 2x_1 + 3x_2 + 4x_3 lessthanorequalto 640 2x_1 + x_2 + x_3 lessthanorequalto 320 2x_1 + x_2 + x_3 lessthanorequalto 320 x_1 greaterthanorequalto 0, x_2 greaterthanorequalto 0, x_3 greaterthanorequalto 0 The maximum is z = at x_1 = x_2 = and x_3 = Use the simplex method to solve the linear programming problem. Maximize z = 6x_1 + 3x_2 + x_3 subject to: x_1 + 5x_2 + 9x_3 lessthanorequalto 112 x_1 + 3x_2 + 11x_3 lessthanorequalto 218 with x_1 greaterthanorequalto 0, x_2 greaterthanorequalto 0, x_3 greaterthanorequalto 0 Select the correct choice below and, if necessary, fill in the answer box to complete your choice. A. The maximum is when x_1 x_2 x_3 = s_1 = 0, s_2 = 106. B. There is no maximum solution to this linear programming problem. Use the simplex method to solve the following Maximize z = 2x_1 + 2x_2 - 6x_3 subject to 5x_1 + 5x_2 - 15x_3 lessthanorequalto 75 6x_1 + 6x_2 + 18x_3 lessthanorequalto 104 x_1 greaterthanorequalto 0, x_2 greaterthanorequalto 0, x_3 greaterthanorequalto 0. Select the correct choice below and, if necessary, fill in the answer box to complete your choice. A. The maximum is when x_1 = x_2 = x_3 = s_1 = 0 and s_2 = B. There is no maximum solution for this problem.

Explanation / Answer

(1) Solution vector x:
x1=120
x2=80
x3=0
Objective function z = 52000

(2) Solution vector x:
x1=112
x2=0
x3=0
Objective function z = 672

(3) Solution vector x:
x1=15
x2=0
x3=0
Objective function z = 30

Process of all three is same and easy but lengthy. you ask direct answer so i give you answer. It can solve easily by simplex method

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.