1- The objective function equation in "standardized" form is written as*

z + 2x1 - x2 + 4x3 = 0

z - 2x1 + x2 + 4x3 = 0

z - 2x1 + x2 - 4x3 = 0

z - 2x1 - x2 - 4x3 = 0

2- Add/Subtract a slack/surplus variable to the 1st constraint*

2x1 + x2 + x3 - S1 = 5

2x1 + x2 + x3 + S1 5

2x1 + x2 + x3 + S1 = 5

2x1 + x2 + x3 - S1 5

3-Add/Subtract a slack/surplus variable to the 2nd constraint*

x1 + 2x2 + 2x3 + S2 20

x1 + 2x2 + 2x3 + S2 = 20

x1 + 2x2 + 2x3 - S2 20

x1 + 2x2 + 2x3 - S2 = 20

4- Add/Subtract a slack/surplus variable to the 3rd constraint*

x2 + 2x3 + S3 12

x2 + 2x3 + S3 = 12

x2 + 2x3 - S3 12

x2 + 2x3 - S3 = 12

5- _____ is the "entering variable" since it has the ________.*

X3; most positive coefficient

X3; most negative coefficient

X3; minimum positive coefficient

X3; minimum positive ratio

6- __________ is the "leaving variable" since it has the/a _________.*

S1; minimum positive ratio

S1; zero ratio

S1; most positive ratio

S1; most negative ratio

7- The pivot element is the intersection of the _________________ &_____________ it's equal to _________.*

Pivot column; pivot row; 12

Pivot column; pivot row; 1

Pivot column; pivot row; 2

Pivot column; pivot row; 0

8- A solution is feasible if*

it satisfies at least one constraint

it satisfies all constraints

it doesn't satisfy any of the constraints

it's negative

9- The development of the simplex method computations is facilitated by imposing two requirements on the LP model:*

Convert all inequalities to equations & all variables are negative.

Convert all inequalities to equations & all variables are non-negative

Convert all equations to inequalities & all variables are negative

Convert all equations to inequalities & all variables are non-negative.

10- The formula of the "ratio" computed to determine the "leaving variable" is:*

RHS(Solution) - Pivot Column Coefficient

RHS(Solution) / Pivot Column Coefficient

RHS(Solution) * Pivot Column Coefficient

RHS(Solution) + Pivot Column Coefficient