Test the Revised Simplex Algorithm class with the following maximization problem:
Maximize z = 2x_0 + 3x_1 + 4x_2
Subject to 3x_0 + 2x_1 + 1x_2 + 1y_3 + 0y_4 = 10
2x_0 + 5x_1 + 3x_2 + 0y_3 + 1y_4 = 15
where z is the objective variable, x are the decision variables and
y are slack variables.
Test the Revised Simplex Algorithm class with the following maximization problem: Maximize z = 2x_0 + 3x_1 + 4x_2 Subject to 3x_0 + 2x_1 + 1x_2 + 1y_3 + 0y_4 = 10 2x_0 + 5x_1 + 3x_2 + 0y_3 + 1y_4 = 15 where z is the objective variable, x are the decision variables and y are slack variables.