Consider the LP max s.t z = 2x1 + 3x2 x1 + x2 + x3 - x4 = 2 x1 - x2 + x4 = 0 x 0

Question

Consider the LP max s.t z = 2x1 + 3x2 x1 + x2 + x3 - x4 = 2 x1 - x2 + x4 = 0 x 0 List all the basic solutions. Identify all the nondegnerate basic feasible solutions and degenerate basic feasible solutions. Give an expression of the projection of the feasible set onto the (x1, x2) plane, by first expressing x3 and x4 as functions of x1 and x2, and then converting the nonnegativity constraints on x3 and x4 into constraints on x1 and x2. Graph the above set in the (x1, x2) plane, and label all of its vertices. Does the LP have an optimal solution?

Explanation / Answer

u have to first make the graph of the equations and then find the area according to the equations and after that u can easily find ur answer.....

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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