7-Simplex Method-04-01-2025
7-Simplex Method-04-01-2025
Step 2: Write the initial simplex table and obtain the initial basic feasible solution.
If all the 𝐶𝑗 − 𝑍𝑗 values are ≤ 0, then the initial basic feasible solution is Optimal. We
can stop the procedure.
Step 5: When the new variable enters into the basis column then one of the existed
variable has to leave. To decide the leaving variable, we have to find the ratios by
dividing the elements in the 𝑏 column by the key column elements found in the step
4. Out of all ratios the minimum non-negative (zero or positive) ratio row will
becomes the key row and the corresponding basic variable becomes the leaving
variable. (The element which is the intersection of key column and key row is called
key element or pivot element).
If all the ratios are negative or infinity then the solution of the problem is
unbounded. Otherwise, go to step 6.
Step 6: Now, We have to make the column vector corresponds to the new basic
variable to identity vector. By making the key element to 1 and other elements in
the key column to zeros with respect to key element.
𝐶𝑗 − 𝑍𝑗 ≰0
Most positive
𝐶𝑗 − 𝑍𝑗 ≰0
𝐶𝑗 − 𝑍𝑗 ≤0
Example:
A firm manufactures two products 𝐴 & 𝐵 on which the profits earned per unit are ₹3 and
₹4, respectively. Each product is processed on two machines 𝑀1 and 𝑀2 . Product 𝐴 requires one
minute of processing time on 𝑀1 and two minutes on 𝑀2 , while 𝐵 requires one minute on 𝑀1 and
one minute on 𝑀2 . Machine 𝑀1 is available for not more than 7 hr. 30 min. while machine 𝑀2 is
available for 10 hr. during any working day. Find the number of units of products 𝐴 and 𝐵 to be
manufactured to get maximum profit.
𝑪𝒋
𝑍𝑗
𝐶𝐽 − 𝑍𝑗
Example:
𝑍𝑗 values represents the amounts by which the contributions (or profit) would be reduced if
one unit of the corresponding variables (𝑥1 , 𝑥2 etc.) was added to the product mix. In other
way, 𝑍𝑗 values represents the contribution lost per unit of the variables.
𝐶𝑗 − 𝑍𝑗 values (index row or net evaluation row) represents net profit (or net contribution or
net marginal improvement) in the value of the objective function 𝑍 for each unit of the
respective column variable introduced into the solution.
The values in replacement ratios (𝜃) column represents the units of the variable that can be
produced by trading all of the current level basic variables. This limits the number of units of
the incoming variable that can be produced from the exchange.
Note: If at least one of the 𝐶𝑗 − 𝑍𝑗 value corresponds to non-basic variable is zero then it is
an indication for the existence of multiple solutions.
Consider the following optimal simplex table for the maximization problem.
𝑪𝒋 It is clear from the table that, in
the 𝑐𝑗 − 𝑧𝑗 row along with the
𝐶𝐵 Basic Body of the problem 𝑏 𝜃 basic variables (𝑦3 , 𝑦2 , 𝑦5 ), the
variables non-basic variable having zero
value. This indicates that the
problem is having an alternative
solution.
To find the alternative solution,
consider that non-basic variable
having zero 𝐶𝑗 − 𝑍𝑗 value as
incoming variable and follow
𝑍𝑗
the general procedure for
𝐶𝑗 − 𝑍𝐽 ≤0 updating the solution in the
next iteration.
Once you update the table in the next iteration, you can observe that you reached optimal
solution with new set of basic variables.
Though we have different basic variables in two instances with different values, the optimal values
of the objective function will be same.
𝑪𝒋
𝐶𝑗 − 𝑍𝐽 ≤0
Update the solution accordingly. You will get alternate solution in the next table.