This question will utilize the following LP problem Maximize Z = 6x1 + 5x2 + 8x3

Question

This question will utilize the following LP problem Maximize Z = 6x1 + 5x2 + 8x3 + 5x4 s.t 3x1 2x2 +6x34x4 S 48 10xi + 5x2 + 10x3 +5x4 S 50 x1 +x2 X3 +x4S 32 4x 8x2 16x3 + 2x, 3 64 x 20, j- 1,2,3,4 After some number of iterations, a person attempting to solve the problem has a current basis of X1 ?? Use the methods of Chapter 5 to obtain the current tableau. What is the value of the objective function? Is the current basic solution optimal? If not, is it feasible? Show your matrix work and attach any relevant Mathematica/Maple output.

Explanation / Answer

There is no feasible solution to this problem as the variables dont converge to maximize the condition

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

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