For maximization linear
programming problem, the simplex
method is terminated when all the
net-evaluation are
1)Negative
2)non-positive
3)non-negative
4)Zero
Answers
Answer:
3) NON-NEGATIVE
Step-by-step explanation:
HOPEFULLY IT HELPS! PLEASE MARK AS BRAINLIEST!HOPEFULLY IT HELPS! PLEASE MARK AS BRAINLIEST!
Answer:
3) non-negative
Step-by-step explanation:
THE SIMPLEX METHOD
1) Set the problem. Therefore, write the objective function and the inequality constraint.
2) Converts inequalities to equations. This is done by adding a slack variable for each inequality.
3) Create an initial simplex tableau. Write the objective function as revenue.
4) The most negative entry in the bottom row identifies the pivot column.
5) Calculate the quotient. The smallest quotient identifies the row. The element at the intersection of the column identified in step 4 and the row identified in this step is identified as the pivot element. The quotient is calculated by dividing the rightmost column by the identified column in step 4. Quotients with zeros, negative numbers, or zeros in the denominator are ignored.
6) Pivot to zero all other entries in that column. This is done in the same way as Gauss-Jordan.
7) When there are no negative entries in the bottom line, you're done. Otherwise, start over from step 4.
8) Read your answer. Use the 1 and 0 columns to get the variable. All other variables are zero. The maximum value you are looking for is displayed in the lower right corner.