Dual |
Note: This API is now obsolete.
[ObsoleteAttribute("No longer needed with new ORTools LP and MIP classes.")] public enum DualSimplexCosting
<ObsoleteAttribute("No longer needed with new ORTools LP and MIP classes.")> Public Enumeration DualSimplexCosting
[ObsoleteAttribute(L"No longer needed with new ORTools LP and MIP classes.")] public enum class DualSimplexCosting
[<ObsoleteAttribute("No longer needed with new ORTools LP and MIP classes.")>] type DualSimplexCosting
Member name | Value | Description |
---|---|---|
SteepestEdge | 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. |
BestReducedCost | 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. |
Copyright © 2023 CenterSpace Software, LLC. All rights reserved.