Finding Simplex Multiplier in an Optimization Problem Without Using Simplex Method

[lapis tendon]

Set up the problem. ...
Convert the inequalities into equations. ...
Construct the initial simplex tableau. ...
The most negative entry in the bottom row identifies the pivot column.
Calculate the quotients. ...
Perform pivoting to make all other entries in this column zero. ...
When there are no more negative entries in the bottom row, we are finished; otherwise, we start again from step 4.

@spiral wind

see theres no any neg value

Set up the problem. That is, write the objective function and the inequality constraints.
Convert the inequalities into equations. This is done by adding one slack variable for each inequality.
Construct the initial simplex tableau. Write the objective function as the bottom row.
The most negative entry in the bottom row identifies the pivot column.
Calculate the quotients. The smallest quotient identifies a row. The element in the intersection of the column identified in step 4 and the row identified in this step is identified as the pivot element. The quotients are computed by dividing the far right column by the identified column in step 4. A quotient that is a zero, or a negative number, or that has a zero in the denominator, is ignored.
Perform pivoting to make all other entries in this column zero. This is done the same way as we did with the Gauss-Jordan method.
When there are no more negative entries in the bottom row, we are finished; otherwise, we start again from step 4.
Read off your answers. Get the variables using the columns with 1 and 0s. All other variables are zero. The maximum value you are looking for appears in the bottom right hand corner.]