Answer to Question #237081 in Operations Research for opr

Question

 Solve the following linear programming problem using the simplex method.

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑃 = 2100𝑦1 + 2400𝑦2 + 10𝑦3 − 70𝑦4

𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜

25𝑦1 + 15𝑦2 + 𝑦3 ≥ 250

20𝑦1 + 30𝑦2 − 𝑦3 − 𝑦4 ≥ 300

𝑦1 ≥ 0, 𝑦2 ≥ 0, 𝑦3 ≥ 0 , 𝑦4 ≥ 0