Consider the following example = Maximize z = 5x1 + 6x2 + 5x3 o Subject to 3x1 + 4x2 X3 0 The objective function equation in "standardized" form is written as * Z - 5x1 - 6x2 - 5x3 = 0 Z - 5x1 - 6x2 + 5x3 = 0 = Z - 5x1 + 6x2 - 5x3 = 0 - - None of the answers. Add/Subtract a slack/surplus variable to the ist constraint * O 3x1 + 4x2 - x3 + S1 = 72 - - 3x1 + 4x2 - X3 - S1 = 72 None of the answers. O 3x1 + 4x2 - x3 + S1 s 72 a Add/Subtract a slack/surplus variable to the 2nd constraint None of the answers. O x1 + 3x2 + 6x3 + S2 s 38 X1 + 3x2 + 6x3 + S2 = 38 - x1 + 3x2 + 6x3 - S2 s 28 Add/Subtract a slack/surplus variable to the 3rd constraint * 2x1 + 3x2 + 4x3 + S3 = 42 2x1 + 3x2 + 4x3 - S3 = 42 = O 2x1 + 3x2 + 4x3 + S3 = 42 None of the answers. The development of the simplex method computations is facilitated by imposing two requirements on the LP model: * Convert all equations to inequalities & all variables are non-negative. Convert all inequalities to equations & all variables are non-negative Convert all equations to inequalities & all variables are negative Convert all inequalities to equations & all variables are negative