|0||Steepest-Edge is a similar heuristic to the Dantzig (BestReducedCost), in that it chooses an entering variable with largest rate of decrease in the objective. However, it measures the rate of decrease per distance traveled along the edge of traversal.|
|1||Classic Dantzig rule. The variable chosen to enter the basis on a pivot is the one that maximizes the rate of decrease of the objective function.|
|2||Computes partial reduced cost.|
Copyright © 2021 CenterSpace Software, LLC. All rights reserved.