This is the Operations Research course. I could not do this question. It is the "BigM" question in the subject of the Simplex Method. It should not be just in writing. Usually we solve it with tables, graphics. If it can be done in this question, there should be tables, mathematical expressions, graphics. For example, it should look like the table below.

Please do not copy and paste. Thank you.

4.6-9.* Consider the following problem. Minimize Z = 3x + 2x2 + 4x3, subject to 2x1 + x2 + 3x3 = 3x] + 3x2 + 5x3 = 120 60 and x 20, X220, x3 0. I (a) Using the Big M method, work through the simplex method step by step to solve the problem. 13 10 S1 0 Basis CB I 2 18 3 -1 S2 0 0 $1 02 X1 12 2 1 0 -M 12 + M 0 -M -M -1 S3 0 0 0 -1 M 0 4 -1 -1.5 2.5M 10 2.5M 03 a2 03 -M -M RHS 0 0 50 1 0 0 0 1 0 -M -M 0 0 0 1 0 0 0 0 1 0 Zj Cj - Z 0 18 M -M