Consider the following LP. Maximize profit = 2x1 + x2 + 5x3 + 2x4 subject to Mac

Question

Consider the following LP. Maximize profit = 2x1 + x2 + 5x3 + 2x4 subject to Machine 1(hours) 2x1 + 5x2 + 2x3 + 2x4 le 150 Machine 2(hours) x1 + x3 + 2x4 le 200 Budget($) 25x1 + 10x2 + 50x3 + 20x4 le 1500 Quotas x1 ge 10 and x2 ge 15 Is the solution x1 = 20, x2 = 0, x3 = 10, x4 = 20, a feasible solution? Explain why or why not. Find a feasible solution with x1 = 10 and give the value for the profit P associated to it. If x1 = 15, x2 = 15, x3 = 0, and X4 = 12, how much slack is there in the first 3 constraints?

Explanation / Answer

c

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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