Question: Question 1 Question 1 ? Please Question 2 ? Please Question 3 ? Please IE 350 Operations Research HW #2 The Simplex Method Due: midnight
Question 1
Question 1 ? Please
Question 2 ? Please
Question 3 ? Please
IE 350 Operations Research HW #2 The Simplex Method Due: midnight of September 24 (Friday, by 11:59 PM), 2021 Instructions: Please submit A PDF file to Blackboard. Question 1 (20%): Describe graphically what the simplex method does step by step to solve the following problem. Instruction: you need to draw the graph, choose the initial CPF, conduct optimality test, and iterate until you find the optimal solution. Maximize Z = X1 + 2x2 subject to X1 + 3x2 5 8 x + x2 0,X3 20 and Question 3 (25%): Using the Big M method, work through the simplex method step by step to solve the following problem. Minimize Z = 3x1 + 2x2 + 4x3 subject to 2x1 + x2 + 3x3 = 60Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
