Time Remaining: 00:47:46 Submit Quiz This Question: 15 pts 7 of 9 (8 complete) T

Question

Time Remaining: 00:47:46 Submit Quiz This Question: 15 pts 7 of 9 (8 complete) This Quiz: 100 pts possible Consider Paul Jordan's following linear programming formulation: Minimize S4X,+ $2X2 1x1+ 3X2 2 90 (C1) 8x1+ 2X2 2152 (C2) 3X, 2X2 2 108 (C3) 1x2 s 70 (C4) C4 x, X220 a) On the graph on right, constraints C. C2.C3. and Chave been plotted. Using the point drawing tool, plot all the comer points for the feasible area. The optimum solution is: A+(round your response to two decimal places). C2 0102030 40 60 80-90 xt b) Optimal solution value Z-fround your response to two decimal places) 1,6 :/ An object is selected. Delete it, or move it with arrows or by dragging. Show ASV bluediff,200x.png · Fur-Envy.-Roll-On-B.Jpg . ir Breathe-Easy"--Roll-o.. .Jpg + Roll_ .jpg . Deep,Muscle .r:''.ro. 7t: #9 @w0xeEad.ogee#7 MacBook Ai

Explanation / Answer

From the figure

the corner points are

(1.5,70)

(8.8,40.8)

(20.57,23.14)

(90,0)

For (1.5,70)

z=4x1+2x2 =4(1.5) +2(70) =6+140 =146

For (8.8,40.8)

z=4x1+2x2=4(8.8) + 2(40.8) =116.8

For (20.57,23.14)

z=4x1+2x2 =4(20.57) + 2(23.14) =128.56

For (90,0)

z=4x1+2x2 =4(90) +2(0) =360

out of these,minimimum value is 116.8 for (8.8,40.8)

Hence

a) X1 =8.8

X2 =40.8

b) Z=116.8

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

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