Click or drag to resize

PrimalSimplexCosting Enumeration

Costing algorithms supported by the primal simplex algorithm.

Namespace: CenterSpace.NMath.Core
Assembly: NMath (in NMath.dll) Version: 7.4
public enum PrimalSimplexCosting
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.
Partial2 Computes partial reduced cost.
See Also