XKTR_PARAM_MIP_LPALG

Specifies which algorithm to use for any linear programming (LP) subproblem solves that may occur in the MIP branch and bound procedure.

Integer

0	(auto) Let Knitro automatically choose an algorithm, based on the problem characteristics.
1	(direct) Use the Interior/Direct (barrier) algorithm.
2	(cg) Use the Interior/CG (barrier) algorithm.
3	(active) Use the Active Set (simplex) algorithm.

0

LP subproblems may arise if the problem is a mixed integer linear program (MILP), or if using XKTR_PARAM_MIP_METHOD = HQG. (Nonlinear programming subproblems use the algorithm specified by the algorithm option.)