Answer to Question #237074 in Operations Research for opr
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
Leave a comment