Question #237074
Use the simplex method to obtain the optimal solution of the dual of following linear programming model
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑃 = 70𝑥1 + 50𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜
40𝑥1 + 30𝑥2 ≤ 2400
−20𝑥1 − 10𝑥2 ≥ 1000
𝑥1 ≥ 0, 𝑥2 ≥ 0
Expert's answer
Answer in progress...
Learn more about our help with Assignments: Math
Comments