Click or drag to resize

DualSimplexCosting Enumeration

Note: This API is now obsolete.

Possible values for the dual simplex solver costing parameter. These values specify the pivoting strategy used by the solver.

Namespace:  CenterSpace.NMath.Core
Assembly:  NMath (in NMath.dll) Version: 7.3
[ObsoleteAttribute("No longer needed with new ORTools LP and MIP classes.")]
public enum DualSimplexCosting
  Member nameValueDescription
SteepestEdge0 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.
BestReducedCost1 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.
See Also