Show every Simplex Tableau (just the answer will get you only 5 pts  you can easily get the answer by running a program like lp_solve)
max: 3x_{1} + 4x_{2} s.t.: x_{1} + 2x_{2} ≤ 8 3x_{1} + 2x_{2} ≤ 12 
Show every Simplex Tableau (just the answer will get you only 5 pts  you can easily get the answer by running a program like lp_solve)
max: 4x_{1} + 5x_{2} s.t.: x_{1} + 2x_{2} ≤ 8 3x_{1} + 2x_{2} ≤ 12 x_{1} + x_{2} ≥ 5 
Max: 4*x1 + 5*x2 + 3*x3; s.t: 5*x1 + 6*x2 + 4*x3 <= 30; 2*x1 + 3*x2 + 2*x3 <= 9; x1, x2 >= 0; 
This can be solved using the following input file:
max: 4*x1 + 5*x2 + 3*x3; 5*x1 + 6*x2 + 4*x3 <= 30; 2*x1 + 3*x2 + 2*x3 <= 9; 
You can obtain a copy of the input file here: click here
lp_solve inp1 
Max: 4*x1 + 5*x2 + 3*x3; s.t.: 5*x1 + 6*x2 + 4*x3 <= 30; 2*x1 + 3*x2 + 2*x3 <= 9; x1, x2, x3 integer ! 
Show the following for each iteration: (like in the class notes)

Max: 100*x1 + 150*x2; s.t.: 8000*x1 + 4000*x2 <= 40000; 15*x1 + 30*x2 <= 200; x1, x2 integer ! 
Show the following for each iteration: (like in the class notes)
