| Option Name | MPL Name | Solver Param | ParamNr | Type | Default | Min | Max |
|---|---|---|---|---|---|---|---|
| Algorithm | OptimizeAlgorithm | list | 0 | 0 | 3 | ||
| Refactorization frequency | RefactorisationFreq | Splex_RefacFrq | 32 | int | 100 | 0 | MAXINT |
| Primal pricing | PrimalPricingAlg | Splex_PPricing | 31 | list | -1 | -1 | 1 |
| Dual pricing | DualPricingAlg | Splex_DPricing | 37 | list | -1 | -1 | 2 |
| Use barrier with crossover | BarrierCrossover | Solver_IpmSol | 56 | flag | 0 | 0 | 1 |
| Dual simplex phase | DualSimplexPhase | Splex_Dual_Phase | 40 | list | 0 | 0 | 2 |
| Barrier switch factor | MIPBarrierSwitchFactor | MIP_SwitchFac_Sim_Ipm | 345 | int | -1 | -1 | MAXINT |
| Optimization method if no basis | MIPOptMethodNoBasis | MIP_TopOpt | 327 | list | 0 | 0 | 3 |
Indicates which algorithm type to use when solving LPs.
| Automatic (0) | LINDO chooses the algorithm based on model characteristics. |
| Primal Simplex (1) | Use the Primal Simplex method. |
| Dual Simplex (2) | Use the Dual Simplex method. |
| Barrier (3) | Use the Barrier Interior point method. |
This refers to the simplex iterations between two consecutive basis re-factorizations. For numerically unstable models, setting this parameter to smaller values may help. The default is 100.
This is the pricing option to be used by the primal simplex method. Possible values are:
| Automatic (-1) | Solver decides the primal pricing method. |
| Partial (0) | Uses partial pricing. |
| Devex (1) | Uses the Devex pricing method. |
This is the pricing option to be used by the dual simplex method. Possible values are:
| Automatic (-1) | Solver decides the dual pricing method. |
| Partial (0) | Uses partial pricing. |
| Steepest edge (2) | Uses the Steepest edge pricing method. |
This flag controls whether a basis crossover will be performed when solving LPs with the barrier solver. A value of 0 indicates that a crossover to a basic solution will be performed. If the value is 1, then the barrier solution will be left intact. For example, if alternate optima exist, the barrier method will return a solution that is, loosely speaking, the average of all alternate optima. The default is 0.
This controls the dual simplex strategy, possible options are:
| Automatic (0) | Solver decides. |
| Single-phase (1) | Uses single-phase strategy. |
| Two-phase (2) | Uses two-phase strategy. |
This specifies the (positive) factor that multiplies the number of constraints to impose an iteration limit to simplex method and trigger a switch over to the barrier method. The default value is -1, which means that no iteration limit is imposed.
This specifies which optimization method to use when there is no previous basis. Possible values are:
| Automatic (0) | Solver decides. |
| Primal Simplex (1) | Use the primal simplex method. |
| Dual Simplex (2) | Use the dual simplex method. |
| Barrier (3) | Use the barrier solver. |