dual simplex pricing algorithm
Decides the type of pricing applied in the dual simplex algorithm.
Purpose
Dual simplex pricing algorithm
|
Description
Decides the type of pricing applied in the dual simplex algorithm. The default pricing (0) usually provides the fastest solution time, but many problems benefit from alternate settings.
| Value | Symbol | Meaning |
|---|---|---|
| 0 | CPX_DPRIIND_AUTO |
Automatic: let CPLEX choose; default |
| 1 | CPX_DPRIIND_FULL |
Standard dual pricing |
| 2 | CPX_DPRIIND_STEEP |
Steepest-edge pricing |
| 3 | CPX_DPRIIND_FULL_STEEP |
Steepest-edge pricing in slack space |
| 4 | CPX_DPRIIND_STEEPQSTART |
Steepest-edge pricing, unit initial norms |
| 5 | CPX_DPRIIND_DEVEX |
devex pricing |
See also
candidate limit for generating Gomory fractional cuts, MIP Gomory fractional cuts switch, pass limit for generating Gomory fractional cuts