In a mixed linear integer programming model, LINGO’s branch-and-bound solver solves a linear programming model at each node of the solution tree. LINGO has a choice of using the primal simplex, dual simplex, or barrier solver (assuming the barrier option was purchased with your license) for handling these linear programs. The LP Solver box on the Integer Solver tab:

contains the following two options for controlling this choice of linear program solver: