algorithm   4                   # KN_ALG_ACT_SQP
gradopt     2                   # forward differences
mip_method  1                   # branch and bound
mip_rootalg 4                   # KN_MIP_ROOTALG_ACT_SQP
mip_nodealg 4                   # KN_MIP_NODEALG_ACT_SQP
mip_heuristic none              # no heuristics
mip_outlevel 3                  # detailed output
outmode     1                   # print to file

mip_selectrule 2                # select the node with the best relaxation bound
mip_branchrule 1
findiff_relstepsize 1e-3        # step size for forward differences
findiff_terminate 0             # no stopping criterion based on gradients
mip_knapsack 0                  # do not use knapsack cuts
act_qpalg 3                     # Active Set algorithm for SQP algorithms
mip_multistart 1
#ms_enable 1                     # use multistart
#ms_terminate 1                  # terminate after the first local optimal solution
ms_maxsolves  12                # max 12 multistarts
#ms_startptrange 1               # maximum range that each variable can take when determining new starting points
#ms_maxtime_real 120             # max 2 minutes for multistart
#concurrent_evals 1              # allow concurrent callback evaluations
#ms_numthreads 1                 # number of threads for multistart
mip_numthreads 1                # number of threads for B&B