quadratically constrained programming problems For linear programming  the algorithms include primal simplex algorithm  the dual simplex algorithm  the network simplex algorithm  as well as a barrier method For mixed integer programming models  CPLEX uses branch-and-cut algorithm