**Definition:** The **Stepping Stone Method** is used to check the optimality of the initial feasible solution determined by using any of the method Viz. North-West Corner, Least Cost Method or Vogel’s Approximation Method. Thus, the stepping stone method is a procedure for finding the potential of any non-basic variables (empty cells) in terms of the objective function.

Through Stepping stone method, we determine that what effect on the transportation cost would be in case one unit is assigned to the empty cell. With the help of this method, we come to know whether the solution is optimal or not.

The series of steps are involved in checking the optimality of the initial feasible solution using the stepping stone method:

- The prerequisite condition to solve for the optimality is to ensure that the number of occupied cells is exactly equal to m+n-1, where ‘m’ is the number of rows, while ‘n’ is equal to the number of columns.
- Firstly, the empty cell is selected and then the closed path is created which starts from the unoccupied cell and returns to the same unoccupied cell, called as a “closed loop”. For creating a closed loop the following conditions should be kept in mind:
- In a closed loop, cells are selected in a sequence such that one cell is unused/unoccupied, and all other cells are used/occupied.
- A pair of Consecutive used cells lies either in the same row or the same column.
- No three consecutive occupied cells can either be in the same row or column.
- The first and last cells in the closed loop lies either in the same row or column.
- Only horizontal and vertical movement is allowed.

- Once the loop is created, assign “+” or “–“ sign alternatively on each corner cell of the loop, but begin with the “+” sign for the unoccupied cell.
- Repeat these steps again until all the unoccupied cells get evaluated.
- Now, if all the computed changes are positive or are equal to or greater than zero, then the optimal solution has been reached.
- But in case, if any, value comes to be negative, then there is a scope to reduce the transportation cost further. Then, select that unoccupied cell which has the most negative change and assign as many units as possible. Subtract the unit that added to the unoccupied cell from the other cells with a negative sign in a loop, to balance the demand and supply requirements.

Example, suppose the following matrix shows the initial feasible solution and stepping stone method is adopted to check its optimality:

With the new matrix so formed, again the empty cells will be evaluated through a loop formation and signs will be assigned accordingly. The cell with the highest opportunity cost will be assigned the units, and this process will repeat until the best optimum solution is obtained or the opportunity cost of all the unoccupied cells comes to be negative.

Maina says

Great stuff

Dr. Gerhard Keller says

Great!

Dr Kemas Fachruddin says

Very Good and helpful for students

Aarif Hussain says

Best explanation

Humera says

Good explanation. Thank you

peter ogot says

please may i get a pdf on the illustration of assignment problem, transportation algorithm, simplex algorithm, and any other related units of operations research. my email is below and thanks! the steps are very clear. i have learnt

Kishan says

Thank you for your this contribution.

Lawal says

So good

A says

helpful