A procedure for solving a transportation problem based on a simplification of the simplex method as applied to the constraint structure that defines a transportation problem. It starts with an initial basic feasible solution and then evaluates, for every nonbasic variable, whether an improved solution can be obtained by introducing one of the nonbasic variables into the basis. The problem is structured into an m-origin by n-destination rectangular array of cells in which the cell location (i, j) corresponds to the variable x ij that represents the amount to be shipped from origin i to destination j. The evaluation process for a nonbasic variable x ij starts in cell (i, j) and finds a path (steps) to current basic variable cells so that if x ijdoes come into the basis, a new feasible solution is generated. Such a path always exists, although degeneracy procedures may be needed to define the path if the current basic solution is degenerate. Associated with the path is a cost that...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Stepping-stone method . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_1000
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_1000
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive