Answered

Welcome to Westonci.ca, the place where your questions are answered by a community of knowledgeable contributors. Join our Q&A platform to connect with experts dedicated to providing accurate answers to your questions in various fields. Join our platform to connect with experts ready to provide precise answers to your questions in different areas.

Solve the following linear programming problem by applying the simplex method to the dual problem.
Minimize
C = 3x1 +22x2
subject to
5X1 + X2 =11
X₂ + 5x2 =11
X1, X2 =0
Select the correct choice below and fill in any answer boxes present in your choice.
O A. Min C = _ at x1 = _ X2 = _
OB. There is no minimum value of C

Sagot :

LukeBeTrollinFVMS

Answer:

Objective Function: P = 2x + 3y + z

Subject to Constraints:

3x + 2y ≤ 5

2x + y – z ≤ 13

z ≤ 4

x,y,z≥0

Step-by-step explanation:

We hope our answers were useful. Return anytime for more information and answers to any other questions you have. We appreciate your time. Please revisit us for more reliable answers to any questions you may have. Keep exploring Westonci.ca for more insightful answers to your questions. We're here to help.