The interior-point optimizer exploits the dual solution only. The interior-point optimizer exploits the primal solution only. The interior-point optimizer performs a coldstart. Hot-start type employed by the interior-point optimizers. Only the status keys of the constraints and variables are used to choose the type of hot-start. The simplex optimize chooses the hot-start type. The simplex optimizer performs a coldstart. Hot-start type employed by the simplex optimizer simhotstart.none ¶ simdupvec.off ¶ĭisallow the simplex optimizer to exploit duplicated columns. simdupvec.on ¶Īllow the simplex optimizer to exploit duplicated columns.

The simplex optimizer should use an aggressive reformulation strategy. simreform.off ¶ĭisallow the simplex optimizer to reformulate the problem. uplo.lo ¶Īllow the simplex optimizer to reformulate the problem. The simplex optimizer should use a minimum degeneration strategy. The simplex optimizer should use a moderate degeneration strategy. The simplex optimizer should use an aggressive degeneration strategy. The simplex optimizer chooses the degeneration strategy. The simplex optimizer should use no degeneration strategy. The upper bound is selected for sensitivity analysis. The lower bound is selected for sensitivity analysis. The constraint or variable has an infinite lower bound and an finite upper bound. The constraint or variable has a finite lower bound and an infinite upper bound. basindtype.if_feasible ¶īasis identification is not performed if the interior-point optimizer terminates with a problem status saying that the problem is primal or dual infeasible. basindtype.no_error ¶īasis identification is performed if the interior-point optimizer terminates without an error. basindtype.always ¶īasis identification is always performed even if the interior-point optimizer terminates abnormally.

Free instal Optimizer 15.4