Package cplex :: Package _internal :: Module _parameters_auto
[frames] | no frames]
 

Module _parameters_auto

Variables
  BarrierAlgorithm = [3007, 'barrier algorithm choice:\n 0 = default\n 1 = infeasibility - estimate start\n 2 = infeasibility - constant start\n ...
  BarrierColNonzeros = [3009, 'minimum number of entries to consider a column dense:\n 0 = dynamically calculated\n >0 = specific number of column ...
  BarrierConvergeTol = [3002, 'tolerance on complementarity for convergence', 2]
  BarrierCrossover = [3018, 'barrier crossover choice:\n -1 = no crossover\n 0 = automatic\n 1 = primal crossover\n 2 = dual crossover', 1]
  BarrierDisplay = [3010, 'barrier display level:\n 0 = no display\n 1 = display normal information\n 2 = display detailed (diagnostic) output', 1]
  BarrierLimitsCorrections = [3013, 'maximum correction limit:\n -1 = automatically determined\n 0 = none\n >0 = maximum correction limit', 4]
  BarrierLimitsGrowth = [3003, 'factor used to determine unbounded optimal face', 2]
  BarrierLimitsIteration = [3012, 'barrier iteration limit', 4]
  BarrierLimitsObjRange = [3004, 'barrier objective range (above and below zero)', 2]
  BarrierOrdering = [3014, 'barrier ordering algorithm:\n 0 = automatic\n 1 = approximate minimum degree\n 2 = approximate minimum fill\n 3 = nes...
  BarrierQCPConvergeTol = [3020, 'tolerance on complementarity for QCP convergence', 2]
  BarrierStartAlg = [3017, 'barrier starting point algorithm:\n 1 = dual is 0\n 2 = estimate dual\n 3 = primal avg, dual is 0\n 4 = primal avg, d...
  BendersStrategy = [1501, 'choice of benders decomposition to use:\n -1 = do not use benders decomposition\n 0 = automatic\n 1 = use the decompos...
  BendersTolerancesfeasibilitycut = [1509, 'tolerance for considering a feasibility cut violated', 2]
  BendersTolerancesoptimalitycut = [1510, 'tolerance for considering an optimality cut violated', 2]
  BendersWorkerAlgorithm = [1500, 'method for optimizing benders subproblems:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = netwo...
  CPXIIS_AT_LOWER = 0
  CPXIIS_AT_UPPER = 2
  CPXIIS_COMPLETE = 1
  CPXIIS_FIXED = 1
  CPXIIS_PARTIAL = 2
  CPXMIP_ABORT_FEAS = 113
  CPXMIP_ABORT_INFEAS = 114
  CPXMIP_ABORT_RELAXATION_UNBOUNDED = 133
  CPXMIP_ABORT_RELAXED = 126
  CPXMIP_BENDERS_MASTER_UNBOUNDED = 134
  CPXMIP_DETTIME_LIM_FEAS = 131
  CPXMIP_DETTIME_LIM_INFEAS = 132
  CPXMIP_FAIL_FEAS = 109
  CPXMIP_FAIL_FEAS_NO_TREE = 116
  CPXMIP_FAIL_INFEAS = 110
  CPXMIP_FAIL_INFEAS_NO_TREE = 117
  CPXMIP_FEASIBLE = 127
  CPXMIP_FEASIBLE_RELAXED_INF = 122
  CPXMIP_FEASIBLE_RELAXED_QUAD = 124
  CPXMIP_FEASIBLE_RELAXED_SUM = 120
  CPXMIP_INFEASIBLE = 103
  CPXMIP_INForUNBD = 119
  CPXMIP_MEM_LIM_FEAS = 111
  CPXMIP_MEM_LIM_INFEAS = 112
  CPXMIP_NODE_LIM_FEAS = 105
  CPXMIP_NODE_LIM_INFEAS = 106
  CPXMIP_OPTIMAL = 101
  CPXMIP_OPTIMAL_INFEAS = 115
  CPXMIP_OPTIMAL_POPULATED = 129
  CPXMIP_OPTIMAL_POPULATED_TOL = 130
  CPXMIP_OPTIMAL_RELAXED_INF = 123
  CPXMIP_OPTIMAL_RELAXED_QUAD = 125
  CPXMIP_OPTIMAL_RELAXED_SUM = 121
  CPXMIP_OPTIMAL_TOL = 102
  CPXMIP_POPULATESOL_LIM = 128
  CPXMIP_SOL_LIM = 104
  CPXMIP_TIME_LIM_FEAS = 107
  CPXMIP_TIME_LIM_INFEAS = 108
  CPXMIP_UNBOUNDED = 118
  CPXMI_BIGM_COEF = 1040
  CPXMI_BIGM_TO_IND = 1041
  CPXMI_BIGM_VARBOUND = 1042
  CPXMI_CANCEL_TOL = 1045
  CPXMI_EPGAP_LARGE = 1038
  CPXMI_EPGAP_OBJOFFSET = 1037
  CPXMI_FEAS_TOL = 1043
  CPXMI_FRACTION_SCALING = 1047
  CPXMI_IND_NZ_LARGE_NUM = 1019
  CPXMI_IND_NZ_SMALL_NUM = 1020
  CPXMI_IND_RHS_LARGE_NUM = 1021
  CPXMI_IND_RHS_SMALL_NUM = 1022
  CPXMI_KAPPA_ILLPOSED = 1035
  CPXMI_KAPPA_SUSPICIOUS = 1033
  CPXMI_KAPPA_UNSTABLE = 1034
  CPXMI_LB_LARGE_NUM = 1003
  CPXMI_LB_SMALL_NUM = 1004
  CPXMI_LC_NZ_LARGE_NUM = 1023
  CPXMI_LC_NZ_SMALL_NUM = 1024
  CPXMI_LC_RHS_LARGE_NUM = 1025
  CPXMI_LC_RHS_SMALL_NUM = 1026
  CPXMI_MULTIOBJ_COEFFS = 1062
  CPXMI_MULTIOBJ_LARGE_NUM = 1058
  CPXMI_MULTIOBJ_MIX = 1063
  CPXMI_MULTIOBJ_OPT_TOL = 1060
  CPXMI_MULTIOBJ_SMALL_NUM = 1059
  CPXMI_NZ_LARGE_NUM = 1009
  CPXMI_NZ_SMALL_NUM = 1010
  CPXMI_OBJ_LARGE_NUM = 1001
  CPXMI_OBJ_SMALL_NUM = 1002
  CPXMI_OPT_TOL = 1044
  CPXMI_QC_LINNZ_LARGE_NUM = 1015
  CPXMI_QC_LINNZ_SMALL_NUM = 1016
  CPXMI_QC_QNZ_LARGE_NUM = 1017
  CPXMI_QC_QNZ_SMALL_NUM = 1018
  CPXMI_QC_RHS_LARGE_NUM = 1013
  CPXMI_QC_RHS_SMALL_NUM = 1014
  CPXMI_QOBJ_LARGE_NUM = 1011
  CPXMI_QOBJ_SMALL_NUM = 1012
  CPXMI_QOPT_TOL = 1046
  CPXMI_RHS_LARGE_NUM = 1007
  CPXMI_RHS_SMALL_NUM = 1008
  CPXMI_SAMECOEFF_COL = 1050
  CPXMI_SAMECOEFF_IND = 1051
  CPXMI_SAMECOEFF_LAZY = 1054
  CPXMI_SAMECOEFF_MULTIOBJ = 1061
  CPXMI_SAMECOEFF_OBJ = 1057
  CPXMI_SAMECOEFF_QLIN = 1052
  CPXMI_SAMECOEFF_QUAD = 1053
  CPXMI_SAMECOEFF_RHS = 1056
  CPXMI_SAMECOEFF_ROW = 1049
  CPXMI_SAMECOEFF_UCUT = 1055
  CPXMI_SINGLE_PRECISION = 1036
  CPXMI_SYMMETRY_BREAKING_INEQ = 1039
  CPXMI_UB_LARGE_NUM = 1005
  CPXMI_UB_SMALL_NUM = 1006
  CPXMI_UC_NZ_LARGE_NUM = 1027
  CPXMI_UC_NZ_SMALL_NUM = 1028
  CPXMI_UC_RHS_LARGE_NUM = 1029
  CPXMI_UC_RHS_SMALL_NUM = 1030
  CPXMI_WIDE_COEFF_RANGE = 1048
  CPXNET_NO_DISPLAY_OBJECTIVE = 0
  CPXNET_PENALIZED_OBJECTIVE = 2
  CPXNET_PRICE_AUTO = 0
  CPXNET_PRICE_MULT_PART = 2
  CPXNET_PRICE_PARTIAL = 1
  CPXNET_PRICE_SORT_MULT_PART = 3
  CPXNET_TRUE_OBJECTIVE = 1
  CPXPROB_FIXEDMILP = 3
  CPXPROB_FIXEDMIQP = 8
  CPXPROB_LP = 0
  CPXPROB_MILP = 1
  CPXPROB_MIQCP = 11
  CPXPROB_MIQP = 7
  CPXPROB_NODELP = 4
  CPXPROB_NODEQCP = 12
  CPXPROB_NODEQP = 9
  CPXPROB_QCP = 10
  CPXPROB_QP = 5
  CPX_ALG_AUTOMATIC = 0
  CPX_ALG_BAROPT = 7
  CPX_ALG_BARRIER = 4
  CPX_ALG_BENDERS = 13
  CPX_ALG_CONCURRENT = 6
  CPX_ALG_DUAL = 2
  CPX_ALG_FEASOPT = 11
  CPX_ALG_MIP = 12
  CPX_ALG_MULTIOBJ = 14
  CPX_ALG_NET = 3
  CPX_ALG_NONE = -1
  CPX_ALG_PIVOT = 10
  CPX_ALG_PIVOTIN = 8
  CPX_ALG_PIVOTOUT = 9
  CPX_ALG_PRIMAL = 1
  CPX_ALG_ROBUST = 15
  CPX_ALG_SIFTING = 5
  CPX_ANNOTATIONDATA_DOUBLE = 2
  CPX_ANNOTATIONDATA_LONG = 1
  CPX_ANNOTATIONOBJ_COL = 1
  CPX_ANNOTATIONOBJ_IND = 4
  CPX_ANNOTATIONOBJ_LAST = 6
  CPX_ANNOTATIONOBJ_OBJ = 0
  CPX_ANNOTATIONOBJ_QC = 5
  CPX_ANNOTATIONOBJ_ROW = 2
  CPX_ANNOTATIONOBJ_SOS = 3
  CPX_AT_LOWER = 0
  CPX_AT_UPPER = 2
  CPX_AUTO = -1
  CPX_AUTO_SOLN = 0
  CPX_BARORDER_AMD = 1
  CPX_BARORDER_AMF = 2
  CPX_BARORDER_AUTO = 0
  CPX_BARORDER_ND = 3
  CPX_BASIC = 1
  CPX_BASIC_SOLN = 1
  CPX_BENDERSSTRATEGY_AUTO = 0
  CPX_BENDERSSTRATEGY_FULL = 3
  CPX_BENDERSSTRATEGY_OFF = -1
  CPX_BENDERSSTRATEGY_USER = 1
  CPX_BENDERSSTRATEGY_WORKERS = 2
  CPX_BENDERS_ANNOTATION = 'cpxBendersPartition'
  CPX_BENDERS_MASTERVALUE = 0
  CPX_BIGINT = 2100000000
  CPX_BIGLONG = 9223372036800000000
  CPX_BINARY = 'B'
  CPX_BRANCH_DOWN = -1
  CPX_BRANCH_GLOBAL = 0
  CPX_BRANCH_UP = 1
  CPX_BRDIR_AUTO = 0
  CPX_BRDIR_DOWN = -1
  CPX_BRDIR_UP = 1
  CPX_CALLBACKCONTEXT_CANDIDATE = 32
  CPX_CALLBACKCONTEXT_GLOBAL_PROGRESS = 16
  CPX_CALLBACKCONTEXT_LOCAL_PROGRESS = 8
  CPX_CALLBACKCONTEXT_RELAXATION = 64
  CPX_CALLBACKCONTEXT_THREAD_DOWN = 4
  CPX_CALLBACKCONTEXT_THREAD_UP = 2
  CPX_CALLBACK_ABORT_CUT_LOOP = 3
  CPX_CALLBACK_BARRIER = 6
  CPX_CALLBACK_DEFAULT = 0
  CPX_CALLBACK_DUAL = 2
  CPX_CALLBACK_DUAL_CROSSOVER = 5
  CPX_CALLBACK_FAIL = 1
  CPX_CALLBACK_INFO_BENDERS_COUNT = 137
  CPX_CALLBACK_INFO_BEST_INTEGER = 101
  CPX_CALLBACK_INFO_BEST_REMAINING = 102
  CPX_CALLBACK_INFO_CLIQUE_COUNT = 107
  CPX_CALLBACK_INFO_COVER_COUNT = 108
  CPX_CALLBACK_INFO_CROSSOVER_DEXCH = 11
  CPX_CALLBACK_INFO_CROSSOVER_DEXCH_LONG = 24
  CPX_CALLBACK_INFO_CROSSOVER_DPUSH = 10
  CPX_CALLBACK_INFO_CROSSOVER_DPUSH_LONG = 23
  CPX_CALLBACK_INFO_CROSSOVER_PEXCH = 9
  CPX_CALLBACK_INFO_CROSSOVER_PEXCH_LONG = 22
  CPX_CALLBACK_INFO_CROSSOVER_PPUSH = 8
  CPX_CALLBACK_INFO_CROSSOVER_PPUSH_LONG = 21
  CPX_CALLBACK_INFO_CROSSOVER_SBCNT = 12
  CPX_CALLBACK_INFO_CUTOFF = 106
  CPX_CALLBACK_INFO_DISJCUT_COUNT = 117
  CPX_CALLBACK_INFO_DISJCUT_PROGRESS = 118
  CPX_CALLBACK_INFO_DUAL_FEAS = 6
  CPX_CALLBACK_INFO_DUAL_INFMEAS = 4
  CPX_CALLBACK_INFO_DUAL_OBJ = 2
  CPX_CALLBACK_INFO_ENDDETTIME = 27
  CPX_CALLBACK_INFO_ENDTIME = 19
  CPX_CALLBACK_INFO_FLOWCOVER_COUNT = 110
  CPX_CALLBACK_INFO_FLOWMIR_PROGRESS = 121
  CPX_CALLBACK_INFO_FLOWPATH_COUNT = 119
  CPX_CALLBACK_INFO_FRACCUT_COUNT = 115
  CPX_CALLBACK_INFO_FRACCUT_PROGRESS = 116
  CPX_CALLBACK_INFO_GUBCOVER_COUNT = 111
  CPX_CALLBACK_INFO_IC_COMPL = 264
  CPX_CALLBACK_INFO_IC_IMPLIED_VAR = 262
  CPX_CALLBACK_INFO_IC_IMPLYING_VAR = 261
  CPX_CALLBACK_INFO_IC_IS_FEASIBLE = 266
  CPX_CALLBACK_INFO_IC_NUM = 260
  CPX_CALLBACK_INFO_IC_RHS = 265
  CPX_CALLBACK_INFO_IC_SENSE = 263
  CPX_CALLBACK_INFO_IMPLBD_COUNT = 112
  CPX_CALLBACK_INFO_ITCOUNT = 7
  CPX_CALLBACK_INFO_ITCOUNT_LONG = 20
  CPX_CALLBACK_INFO_KAPPA_ATTENTION = 132
  CPX_CALLBACK_INFO_KAPPA_ILLPOSED = 130
  CPX_CALLBACK_INFO_KAPPA_MAX = 131
  CPX_CALLBACK_INFO_KAPPA_STABLE = 127
  CPX_CALLBACK_INFO_KAPPA_SUSPICIOUS = 128
  CPX_CALLBACK_INFO_KAPPA_UNSTABLE = 129
  CPX_CALLBACK_INFO_LANDPCUT_COUNT = 133
  CPX_CALLBACK_INFO_LAZY_SOURCE = 143
  CPX_CALLBACK_INFO_MCFCUT_COUNT = 126
  CPX_CALLBACK_INFO_MIP_FEAS = 109
  CPX_CALLBACK_INFO_MIP_ITERATIONS = 105
  CPX_CALLBACK_INFO_MIP_ITERATIONS_LONG = 142
  CPX_CALLBACK_INFO_MIP_REL_GAP = 125
  CPX_CALLBACK_INFO_MIRCUT_COUNT = 120
  CPX_CALLBACK_INFO_MY_THREAD_NUM = 123
  CPX_CALLBACK_INFO_NODES_LEFT = 104
  CPX_CALLBACK_INFO_NODES_LEFT_LONG = 141
  CPX_CALLBACK_INFO_NODE_COUNT = 103
  CPX_CALLBACK_INFO_NODE_COUNT_LONG = 140
  CPX_CALLBACK_INFO_NODE_DEPTH = 204
  CPX_CALLBACK_INFO_NODE_DEPTH_LONG = 222
  CPX_CALLBACK_INFO_NODE_ESTIMATE = 203
  CPX_CALLBACK_INFO_NODE_NIINF = 202
  CPX_CALLBACK_INFO_NODE_NODENUM = 211
  CPX_CALLBACK_INFO_NODE_NODENUM_LONG = 221
  CPX_CALLBACK_INFO_NODE_OBJVAL = 205
  CPX_CALLBACK_INFO_NODE_SEQNUM = 209
  CPX_CALLBACK_INFO_NODE_SEQNUM_LONG = 220
  CPX_CALLBACK_INFO_NODE_SIINF = 201
  CPX_CALLBACK_INFO_NODE_SOS = 208
  CPX_CALLBACK_INFO_NODE_TYPE = 206
  CPX_CALLBACK_INFO_NODE_USERHANDLE = 210
  CPX_CALLBACK_INFO_NODE_VAR = 207
  CPX_CALLBACK_INFO_PRESOLVE_AGGSUBST = 15
  CPX_CALLBACK_INFO_PRESOLVE_AGGSUBST_LONG = 25
  CPX_CALLBACK_INFO_PRESOLVE_COEFFS = 16
  CPX_CALLBACK_INFO_PRESOLVE_COEFFS_LONG = 26
  CPX_CALLBACK_INFO_PRESOLVE_COLSGONE = 14
  CPX_CALLBACK_INFO_PRESOLVE_ROWSGONE = 13
  CPX_CALLBACK_INFO_PRIMAL_FEAS = 5
  CPX_CALLBACK_INFO_PRIMAL_INFMEAS = 3
  CPX_CALLBACK_INFO_PRIMAL_OBJ = 1
  CPX_CALLBACK_INFO_PROBE_PHASE = 113
  CPX_CALLBACK_INFO_PROBE_PROGRESS = 114
  CPX_CALLBACK_INFO_SOLNPOOLCUT_COUNT = 136
  CPX_CALLBACK_INFO_SOS_IS_FEASIBLE = 242
  CPX_CALLBACK_INFO_SOS_MEMBER_INDEX = 244
  CPX_CALLBACK_INFO_SOS_MEMBER_REFVAL = 246
  CPX_CALLBACK_INFO_SOS_NUM = 247
  CPX_CALLBACK_INFO_SOS_SIZE = 241
  CPX_CALLBACK_INFO_SOS_TYPE = 240
  CPX_CALLBACK_INFO_STARTDETTIME = 29
  CPX_CALLBACK_INFO_STARTTIME = 28
  CPX_CALLBACK_INFO_TABLECUT_COUNT = 135
  CPX_CALLBACK_INFO_TUNING_PROGRESS = 18
  CPX_CALLBACK_INFO_USERCUT_COUNT = 134
  CPX_CALLBACK_INFO_USER_PROBLEM = 17
  CPX_CALLBACK_INFO_USER_THREADS = 124
  CPX_CALLBACK_INFO_ZEROHALFCUT_COUNT = 122
  CPX_CALLBACK_MIP = 101
  CPX_CALLBACK_MIP_BRANCH = 102
  CPX_CALLBACK_MIP_BRANCH_NOSOLN = 113
  CPX_CALLBACK_MIP_CUT_FEAS = 115
  CPX_CALLBACK_MIP_CUT_LAST = 114
  CPX_CALLBACK_MIP_CUT_LOOP = 106
  CPX_CALLBACK_MIP_CUT_UNBD = 116
  CPX_CALLBACK_MIP_DELETENODE = 112
  CPX_CALLBACK_MIP_DISJCUT = 109
  CPX_CALLBACK_MIP_FLOWMIR = 110
  CPX_CALLBACK_MIP_FRACCUT = 108
  CPX_CALLBACK_MIP_HEURISTIC = 104
  CPX_CALLBACK_MIP_INCUMBENT_HEURSOLN = 117
  CPX_CALLBACK_MIP_INCUMBENT_MIPSTART = 119
  CPX_CALLBACK_MIP_INCUMBENT_NODESOLN = 111
  CPX_CALLBACK_MIP_INCUMBENT_USERSOLN = 118
  CPX_CALLBACK_MIP_NODE = 103
  CPX_CALLBACK_MIP_PROBE = 107
  CPX_CALLBACK_MIP_SOLVE = 105
  CPX_CALLBACK_NETWORK = 3
  CPX_CALLBACK_PRESOLVE = 7
  CPX_CALLBACK_PRIMAL = 1
  CPX_CALLBACK_PRIMAL_CROSSOVER = 4
  CPX_CALLBACK_QPBARRIER = 8
  CPX_CALLBACK_QPSIMPLEX = 9
  CPX_CALLBACK_SET = 2
  CPX_CALLBACK_TUNING = 10
  CPX_CONFLICTALG_AUTO = 0
  CPX_CONFLICTALG_FAST = 1
  CPX_CONFLICTALG_IIS = 4
  CPX_CONFLICTALG_LIMITSOLVE = 5
  CPX_CONFLICTALG_PRESOLVE = 3
  CPX_CONFLICTALG_PROPAGATE = 2
  CPX_CONFLICTALG_SOLVE = 6
  CPX_CONFLICT_EXCLUDED = -1
  CPX_CONFLICT_LB = 4
  CPX_CONFLICT_MEMBER = 3
  CPX_CONFLICT_POSSIBLE_LB = 1
  CPX_CONFLICT_POSSIBLE_MEMBER = 0
  CPX_CONFLICT_POSSIBLE_UB = 2
  CPX_CONFLICT_UB = 5
  CPX_CONTINUOUS = 'C'
  CPX_CON_ABS = 7
  CPX_CON_INDICATOR = 6
  CPX_CON_LAST_CONTYPE = 10
  CPX_CON_LINEAR = 3
  CPX_CON_LOWER_BOUND = 1
  CPX_CON_MAXEXPR = 9
  CPX_CON_MINEXPR = 8
  CPX_CON_PWL = 7
  CPX_CON_QUADRATIC = 4
  CPX_CON_SOS = 5
  CPX_CON_UPPER_BOUND = 2
  CPX_CUT_BENDERS = 21
  CPX_CUT_BQP = 19
  CPX_CUT_CLIQUE = 3
  CPX_CUT_COVER = 0
  CPX_CUT_DISJ = 7
  CPX_CUT_FLOWCOVER = 2
  CPX_CUT_FLOWPATH = 6
  CPX_CUT_FRAC = 4
  CPX_CUT_GUBCOVER = 1
  CPX_CUT_IMPLBD = 8
  CPX_CUT_LANDP = 14
  CPX_CUT_LOCALCOVER = 11
  CPX_CUT_LOCALIMPLBD = 18
  CPX_CUT_MCF = 10
  CPX_CUT_MIR = 5
  CPX_CUT_NUM_TYPES = 22
  CPX_CUT_OBJDISJ = 13
  CPX_CUT_RLT = 20
  CPX_CUT_SOLNPOOL = 17
  CPX_CUT_TABLE = 16
  CPX_CUT_TIGHTEN = 12
  CPX_CUT_USER = 15
  CPX_CUT_ZEROHALF = 9
  CPX_DATACHECK_ASSIST = 2
  CPX_DATACHECK_OFF = 0
  CPX_DATACHECK_WARN = 1
  CPX_DPRIIND_AUTO = 0
  CPX_DPRIIND_DEVEX = 5
  CPX_DPRIIND_FULL = 1
  CPX_DPRIIND_FULLSTEEP = 3
  CPX_DPRIIND_STEEP = 2
  CPX_DPRIIND_STEEPQSTART = 4
  CPX_DUAL_OBJ = 41
  CPX_EXACT_KAPPA = 51
  CPX_FEASOPT_MIN_INF = 2
  CPX_FEASOPT_MIN_QUAD = 4
  CPX_FEASOPT_MIN_SUM = 0
  CPX_FEASOPT_OPT_INF = 3
  CPX_FEASOPT_OPT_QUAD = 5
  CPX_FEASOPT_OPT_SUM = 1
  CPX_FEATURES_H = 1
  CPX_FREE_SUPER = 3
  CPX_IMPLIED_INTEGER_FEASIBLE = 2
  CPX_INCUMBENT_ID = -1
  CPX_INDICATOR_IF = 1
  CPX_INDICATOR_IFANDONLYIF = 3
  CPX_INDICATOR_ONLYIF = 2
  CPX_INFBOUND = 1e+20
  CPX_INTEGER = 'I'
  CPX_INTEGER_FEASIBLE = 0
  CPX_INTEGER_INFEASIBLE = 1
  CPX_KAPPA = 39
  CPX_KAPPA_ATTENTION = 57
  CPX_KAPPA_ILLPOSED = 55
  CPX_KAPPA_MAX = 56
  CPX_KAPPA_STABLE = 52
  CPX_KAPPA_SUSPICIOUS = 53
  CPX_KAPPA_UNSTABLE = 54
  CPX_LAZYCONSTRAINTCALLBACK_HEUR = 117
  CPX_LAZYCONSTRAINTCALLBACK_MIPSTART = 119
  CPX_LAZYCONSTRAINTCALLBACK_NODE = 111
  CPX_LPREADER_LEGACY = 0
  CPX_LPREADER_NEW = 1
  CPX_MAX = -1
  CPX_MAX_COMP_SLACK = 19
  CPX_MAX_DUAL_INFEAS = 5
  CPX_MAX_DUAL_RESIDUAL = 15
  CPX_MAX_INDSLACK_INFEAS = 49
  CPX_MAX_INT_INFEAS = 9
  CPX_MAX_PI = 25
  CPX_MAX_PRIMAL_INFEAS = 1
  CPX_MAX_PRIMAL_RESIDUAL = 11
  CPX_MAX_PWLSLACK_INFEAS = 58
  CPX_MAX_QCPRIMAL_RESIDUAL = 43
  CPX_MAX_QCSLACK = 47
  CPX_MAX_QCSLACK_INFEAS = 45
  CPX_MAX_RED_COST = 29
  CPX_MAX_SCALED_DUAL_INFEAS = 6
  CPX_MAX_SCALED_DUAL_RESIDUAL = 16
  CPX_MAX_SCALED_PI = 26
  CPX_MAX_SCALED_PRIMAL_INFEAS = 2
  CPX_MAX_SCALED_PRIMAL_RESIDUAL = 12
  CPX_MAX_SCALED_RED_COST = 30
  CPX_MAX_SCALED_SLACK = 28
  CPX_MAX_SCALED_X = 24
  CPX_MAX_SLACK = 27
  CPX_MAX_X = 23
  CPX_MIN = 1
  CPX_MINBOUND = 1e-13
  CPX_MIPEMPHASIS_BALANCED = 0
  CPX_MIPEMPHASIS_BESTBOUND = 3
  CPX_MIPEMPHASIS_FEASIBILITY = 1
  CPX_MIPEMPHASIS_HIDDENFEAS = 4
  CPX_MIPEMPHASIS_OPTIMALITY = 2
  CPX_MIPKAPPA_AUTO = 0
  CPX_MIPKAPPA_FULL = 2
  CPX_MIPKAPPA_OFF = -1
  CPX_MIPKAPPA_SAMPLE = 1
  CPX_MIPORDER_BOUNDS = 2
  CPX_MIPORDER_COST = 1
  CPX_MIPORDER_SCALEDCOST = 3
  CPX_MIPSEARCH_AUTO = 0
  CPX_MIPSEARCH_DYNAMIC = 2
  CPX_MIPSEARCH_TRADITIONAL = 1
  CPX_MIPSTART_AUTO = 0
  CPX_MIPSTART_CHECKFEAS = 1
  CPX_MIPSTART_NOCHECK = 5
  CPX_MIPSTART_REPAIR = 4
  CPX_MIPSTART_SOLVEFIXED = 2
  CPX_MIPSTART_SOLVEMIP = 3
  CPX_MULTIOBJ_BARITCNT = 4
  CPX_MULTIOBJ_BESTOBJVAL = 15
  CPX_MULTIOBJ_BLEND = 20
  CPX_MULTIOBJ_DEGCNT = 7
  CPX_MULTIOBJ_DETTIME = 3
  CPX_MULTIOBJ_DEXCH = 13
  CPX_MULTIOBJ_DPUSH = 12
  CPX_MULTIOBJ_ERROR = 0
  CPX_MULTIOBJ_ITCNT = 8
  CPX_MULTIOBJ_METHOD = 18
  CPX_MULTIOBJ_NODECNT = 16
  CPX_MULTIOBJ_NODELEFTCNT = 19
  CPX_MULTIOBJ_OBJVAL = 14
  CPX_MULTIOBJ_PEXCH = 11
  CPX_MULTIOBJ_PHASE1CNT = 9
  CPX_MULTIOBJ_PPUSH = 10
  CPX_MULTIOBJ_PRIORITY = 17
  CPX_MULTIOBJ_SIFTITCNT = 5
  CPX_MULTIOBJ_SIFTPHASE1CNT = 6
  CPX_MULTIOBJ_STATUS = 1
  CPX_MULTIOBJ_TIME = 2
  CPX_NETFIND_PURE = 1
  CPX_NETFIND_REFLECT = 2
  CPX_NETFIND_SCALE = 3
  CPX_NODESEL_BESTBOUND = 1
  CPX_NODESEL_BESTEST = 2
  CPX_NODESEL_BESTEST_ALT = 3
  CPX_NODESEL_DFS = 0
  CPX_NONBASIC_SOLN = 2
  CPX_NO_ABSTOL_CHANGE = nan
  CPX_NO_OFFSET_CHANGE = nan
  CPX_NO_PRIORITY_CHANGE = -1
  CPX_NO_RELTOL_CHANGE = nan
  CPX_NO_SOLN = 0
  CPX_NO_VARIABLE = 2100000000
  CPX_NO_WEIGHT_CHANGE = nan
  CPX_OBJ_GAP = 40
  CPX_OFF = 0
  CPX_ON = 1
  CPX_OPTIMALITYTARGET_AUTO = 0
  CPX_OPTIMALITYTARGET_FIRSTORDER = 2
  CPX_OPTIMALITYTARGET_OPTIMALCONVEX = 1
  CPX_OPTIMALITYTARGET_OPTIMALGLOBAL = 3
  CPX_PARALLEL_AUTO = 0
  CPX_PARALLEL_DETERMINISTIC = 1
  CPX_PARALLEL_OPPORTUNISTIC = -1
  CPX_PARAMTYPE_DOUBLE = 2
  CPX_PARAMTYPE_INT = 1
  CPX_PARAMTYPE_LONG = 4
  CPX_PARAMTYPE_NONE = 0
  CPX_PARAMTYPE_STRING = 3
  CPX_PARAM_ADVIND = 1001
  CPX_PARAM_AGGCUTLIM = 2054
  CPX_PARAM_AGGFILL = 1002
  CPX_PARAM_AGGIND = 1003
  CPX_PARAM_ALL_MAX = 6000
  CPX_PARAM_ALL_MIN = 1000
  CPX_PARAM_APIENCODING = 1130
  CPX_PARAM_AUXROOTTHREADS = 2139
  CPX_PARAM_BARALG = 3007
  CPX_PARAM_BARCOLNZ = 3009
  CPX_PARAM_BARCROSSALG = 3018
  CPX_PARAM_BARDISPLAY = 3010
  CPX_PARAM_BAREPCOMP = 3002
  CPX_PARAM_BARGROWTH = 3003
  CPX_PARAM_BARITLIM = 3012
  CPX_PARAM_BARMAXCOR = 3013
  CPX_PARAM_BAROBJRNG = 3004
  CPX_PARAM_BARORDER = 3014
  CPX_PARAM_BARQCPEPCOMP = 3020
  CPX_PARAM_BARSTARTALG = 3017
  CPX_PARAM_BBINTERVAL = 2039
  CPX_PARAM_BENDERSFEASCUTTOL = 1509
  CPX_PARAM_BENDERSOPTCUTTOL = 1510
  CPX_PARAM_BENDERSSTRATEGY = 1501
  CPX_PARAM_BNDSTRENIND = 2029
  CPX_PARAM_BQPCUTS = 2195
  CPX_PARAM_BRDIR = 2001
  CPX_PARAM_BTTOL = 2002
  CPX_PARAM_CALCQCPDUALS = 4003
  CPX_PARAM_CLIQUES = 2003
  CPX_PARAM_CLOCKTYPE = 1006
  CPX_PARAM_CLONELOG = 1132
  CPX_PARAM_COEREDIND = 2004
  CPX_PARAM_COLREADLIM = 1023
  CPX_PARAM_CONFLICTALG = 1073
  CPX_PARAM_CONFLICTDISPLAY = 1074
  CPX_PARAM_COVERS = 2005
  CPX_PARAM_CPUMASK = 1144
  CPX_PARAM_CRAIND = 1007
  CPX_PARAM_CUTLO = 2006
  CPX_PARAM_CUTPASS = 2056
  CPX_PARAM_CUTSFACTOR = 2033
  CPX_PARAM_CUTUP = 2007
  CPX_PARAM_DATACHECK = 1056
  CPX_PARAM_DEPIND = 1008
  CPX_PARAM_DETTILIM = 1127
  CPX_PARAM_DISJCUTS = 2053
  CPX_PARAM_DIVETYPE = 2060
  CPX_PARAM_DPRIIND = 1009
  CPX_PARAM_DYNAMICROWS = 1161
  CPX_PARAM_EACHCUTLIM = 2102
  CPX_PARAM_EPAGAP = 2008
  CPX_PARAM_EPGAP = 2009
  CPX_PARAM_EPINT = 2010
  CPX_PARAM_EPLIN = 2068
  CPX_PARAM_EPMRK = 1013
  CPX_PARAM_EPOPT = 1014
  CPX_PARAM_EPPER = 1015
  CPX_PARAM_EPRELAX = 2073
  CPX_PARAM_EPRHS = 1016
  CPX_PARAM_FEASOPTMODE = 1084
  CPX_PARAM_FILEENCODING = 1129
  CPX_PARAM_FLOWCOVERS = 2040
  CPX_PARAM_FLOWPATHS = 2051
  CPX_PARAM_FOLDING = 1164
  CPX_PARAM_FPHEUR = 2098
  CPX_PARAM_FRACCAND = 2048
  CPX_PARAM_FRACCUTS = 2049
  CPX_PARAM_FRACPASS = 2050
  CPX_PARAM_GUBCOVERS = 2044
  CPX_PARAM_HEURFREQ = 2031
  CPX_PARAM_IMPLBD = 2041
  CPX_PARAM_INTSOLFILEPREFIX = 2143
  CPX_PARAM_INTSOLLIM = 2015
  CPX_PARAM_ITLIM = 1020
  CPX_PARAM_LANDPCUTS = 2152
  CPX_PARAM_LBHEUR = 2063
  CPX_PARAM_LOCALIMPLBD = 2181
  CPX_PARAM_LPMETHOD = 1062
  CPX_PARAM_MCFCUTS = 2134
  CPX_PARAM_MEMORYEMPHASIS = 1082
  CPX_PARAM_MIPCBREDLP = 2055
  CPX_PARAM_MIPDISPLAY = 2012
  CPX_PARAM_MIPEMPHASIS = 2058
  CPX_PARAM_MIPINTERVAL = 2013
  CPX_PARAM_MIPKAPPASTATS = 2137
  CPX_PARAM_MIPORDIND = 2020
  CPX_PARAM_MIPORDTYPE = 2032
  CPX_PARAM_MIPSEARCH = 2109
  CPX_PARAM_MIQCPSTRAT = 2110
  CPX_PARAM_MIRCUTS = 2052
  CPX_PARAM_MPSLONGNUM = 1081
  CPX_PARAM_MULTIOBJDISPLAY = 1600
  CPX_PARAM_NETDISPLAY = 5005
  CPX_PARAM_NETEPOPT = 5002
  CPX_PARAM_NETEPRHS = 5003
  CPX_PARAM_NETFIND = 1022
  CPX_PARAM_NETITLIM = 5001
  CPX_PARAM_NETPPRIIND = 5004
  CPX_PARAM_NODEFILEIND = 2016
  CPX_PARAM_NODELIM = 2017
  CPX_PARAM_NODESEL = 2018
  CPX_PARAM_NUMERICALEMPHASIS = 1083
  CPX_PARAM_NZREADLIM = 1024
  CPX_PARAM_OBJDIF = 2019
  CPX_PARAM_OBJLLIM = 1025
  CPX_PARAM_OBJULIM = 1026
  CPX_PARAM_OPTIMALITYTARGET = 1131
  CPX_PARAM_PARALLELMODE = 1109
  CPX_PARAM_PARAMDISPLAY = 1163
  CPX_PARAM_PERIND = 1027
  CPX_PARAM_PERLIM = 1028
  CPX_PARAM_POLISHAFTERDETTIME = 2151
  CPX_PARAM_POLISHAFTEREPAGAP = 2126
  CPX_PARAM_POLISHAFTEREPGAP = 2127
  CPX_PARAM_POLISHAFTERINTSOL = 2129
  CPX_PARAM_POLISHAFTERNODE = 2128
  CPX_PARAM_POLISHAFTERTIME = 2130
  CPX_PARAM_POLISHTIME = 2066
  CPX_PARAM_POPULATELIM = 2108
  CPX_PARAM_PPRIIND = 1029
  CPX_PARAM_PREDUAL = 1044
  CPX_PARAM_PREIND = 1030
  CPX_PARAM_PRELINEAR = 1058
  CPX_PARAM_PREPASS = 1052
  CPX_PARAM_PRESLVND = 2037
  CPX_PARAM_PRICELIM = 1010
  CPX_PARAM_PROBE = 2042
  CPX_PARAM_PROBEDETTIME = 2150
  CPX_PARAM_PROBETIME = 2065
  CPX_PARAM_QPMAKEPSDIND = 4010
  CPX_PARAM_QPMETHOD = 1063
  CPX_PARAM_QPNZREADLIM = 4001
  CPX_PARAM_QTOLININD = 4012
  CPX_PARAM_RAMPUPDETTILIM = 2164
  CPX_PARAM_RAMPUPDURATION = 2163
  CPX_PARAM_RAMPUPTILIM = 2165
  CPX_PARAM_RANDOMSEED = 1124
  CPX_PARAM_RECORD = 1162
  CPX_PARAM_REDUCE = 1057
  CPX_PARAM_REINV = 1031
  CPX_PARAM_RELAXPREIND = 2034
  CPX_PARAM_RELOBJDIF = 2022
  CPX_PARAM_REPAIRTRIES = 2067
  CPX_PARAM_REPEATPRESOLVE = 2064
  CPX_PARAM_RINSHEUR = 2061
  CPX_PARAM_RLTCUTS = 2196
  CPX_PARAM_ROWREADLIM = 1021
  CPX_PARAM_SCAIND = 1034
  CPX_PARAM_SCRIND = 1035
  CPX_PARAM_SIFTALG = 1077
  CPX_PARAM_SIFTDISPLAY = 1076
  CPX_PARAM_SIFTITLIM = 1078
  CPX_PARAM_SIFTSIM = 1158
  CPX_PARAM_SIMDISPLAY = 1019
  CPX_PARAM_SINGLIM = 1037
  CPX_PARAM_SOLNPOOLAGAP = 2106
  CPX_PARAM_SOLNPOOLCAPACITY = 2103
  CPX_PARAM_SOLNPOOLGAP = 2105
  CPX_PARAM_SOLNPOOLINTENSITY = 2107
  CPX_PARAM_SOLNPOOLREPLACE = 2104
  CPX_PARAM_SOLUTIONTYPE = 1147
  CPX_PARAM_STARTALG = 2025
  CPX_PARAM_STRONGCANDLIM = 2045
  CPX_PARAM_STRONGITLIM = 2046
  CPX_PARAM_SUBALG = 2026
  CPX_PARAM_SUBMIPNODELIMIT = 2212
  CPX_PARAM_SUBMIPSCAIND = 2207
  CPX_PARAM_SUBMIPSTARTALG = 2205
  CPX_PARAM_SUBMIPSUBALG = 2206
  CPX_PARAM_SYMMETRY = 2059
  CPX_PARAM_THREADS = 1067
  CPX_PARAM_TILIM = 1039
  CPX_PARAM_TRELIM = 2027
  CPX_PARAM_TUNINGDETTILIM = 1139
  CPX_PARAM_TUNINGDISPLAY = 1113
  CPX_PARAM_TUNINGMEASURE = 1110
  CPX_PARAM_TUNINGREPEAT = 1111
  CPX_PARAM_TUNINGTILIM = 1112
  CPX_PARAM_VARSEL = 2028
  CPX_PARAM_WARNLIM = 1157
  CPX_PARAM_WORKDIR = 1064
  CPX_PARAM_WORKERALG = 1500
  CPX_PARAM_WORKMEM = 1065
  CPX_PARAM_WRITELEVEL = 1114
  CPX_PARAM_ZEROHALFCUTS = 2111
  CPX_PPRIIND_AUTO = 0
  CPX_PPRIIND_DEVEX = 1
  CPX_PPRIIND_FULL = 4
  CPX_PPRIIND_PARTIAL = -1
  CPX_PPRIIND_STEEP = 2
  CPX_PPRIIND_STEEPQSTART = 3
  CPX_PRECOL_AGG = -4
  CPX_PRECOL_FIX = -3
  CPX_PRECOL_LOW = -1
  CPX_PRECOL_OTHER = -5
  CPX_PRECOL_UP = -2
  CPX_PREREDUCE_DUALONLY = 2
  CPX_PREREDUCE_NOPRIMALORDUAL = 0
  CPX_PREREDUCE_PRIMALANDDUAL = 3
  CPX_PREREDUCE_PRIMALONLY = 1
  CPX_PREROW_AGG = -2
  CPX_PREROW_OTHER = -3
  CPX_PREROW_RED = -1
  CPX_PRIMAL_OBJ = 42
  CPX_PRIMAL_SOLN = 3
  CPX_QCPDUALS_FORCE = 2
  CPX_QCPDUALS_IFPOSSIBLE = 1
  CPX_QCPDUALS_NO = 0
  CPX_RAMPUP_AUTO = 0
  CPX_RAMPUP_DISABLED = -1
  CPX_RAMPUP_DYNAMIC = 1
  CPX_RAMPUP_INFINITE = 2
  CPX_SEMICONT = 'S'
  CPX_SEMIINT = 'N'
  CPX_SOLNPOOL_DIV = 2
  CPX_SOLNPOOL_FIFO = 0
  CPX_SOLNPOOL_FILTER_DIVERSITY = 1
  CPX_SOLNPOOL_FILTER_RANGE = 2
  CPX_SOLNPOOL_OBJ = 1
  CPX_STAT_ABORT_DETTIME_LIM = 25
  CPX_STAT_ABORT_DUAL_OBJ_LIM = 22
  CPX_STAT_ABORT_IT_LIM = 10
  CPX_STAT_ABORT_OBJ_LIM = 12
  CPX_STAT_ABORT_PRIM_OBJ_LIM = 21
  CPX_STAT_ABORT_TIME_LIM = 11
  CPX_STAT_ABORT_USER = 13
  CPX_STAT_BENDERS_MASTER_UNBOUNDED = 40
  CPX_STAT_BENDERS_NUM_BEST = 41
  CPX_STAT_CONFLICT_ABORT_CONTRADICTION = 32
  CPX_STAT_CONFLICT_ABORT_DETTIME_LIM = 39
  CPX_STAT_CONFLICT_ABORT_IT_LIM = 34
  CPX_STAT_CONFLICT_ABORT_MEM_LIM = 37
  CPX_STAT_CONFLICT_ABORT_NODE_LIM = 35
  CPX_STAT_CONFLICT_ABORT_OBJ_LIM = 36
  CPX_STAT_CONFLICT_ABORT_TIME_LIM = 33
  CPX_STAT_CONFLICT_ABORT_USER = 38
  CPX_STAT_CONFLICT_FEASIBLE = 30
  CPX_STAT_CONFLICT_MINIMAL = 31
  CPX_STAT_FEASIBLE = 23
  CPX_STAT_FEASIBLE_RELAXED_INF = 16
  CPX_STAT_FEASIBLE_RELAXED_QUAD = 18
  CPX_STAT_FEASIBLE_RELAXED_SUM = 14
  CPX_STAT_FIRSTORDER = 24
  CPX_STAT_INFEASIBLE = 3
  CPX_STAT_INForUNBD = 4
  CPX_STAT_MULTIOBJ_INFEASIBLE = 302
  CPX_STAT_MULTIOBJ_INForUNBD = 303
  CPX_STAT_MULTIOBJ_NON_OPTIMAL = 305
  CPX_STAT_MULTIOBJ_OPTIMAL = 301
  CPX_STAT_MULTIOBJ_STOPPED = 306
  CPX_STAT_MULTIOBJ_UNBOUNDED = 304
  CPX_STAT_NUM_BEST = 6
  CPX_STAT_OPTIMAL = 1
  CPX_STAT_OPTIMAL_FACE_UNBOUNDED = 20
  CPX_STAT_OPTIMAL_INFEAS = 5
  CPX_STAT_OPTIMAL_RELAXED_INF = 17
  CPX_STAT_OPTIMAL_RELAXED_QUAD = 19
  CPX_STAT_OPTIMAL_RELAXED_SUM = 15
  CPX_STAT_UNBOUNDED = 2
  CPX_STR_PARAM_MAX = 512
  CPX_SUM_COMP_SLACK = 21
  CPX_SUM_DUAL_INFEAS = 7
  CPX_SUM_DUAL_RESIDUAL = 17
  CPX_SUM_INDSLACK_INFEAS = 50
  CPX_SUM_INT_INFEAS = 10
  CPX_SUM_PI = 33
  CPX_SUM_PRIMAL_INFEAS = 3
  CPX_SUM_PRIMAL_RESIDUAL = 13
  CPX_SUM_PWLSLACK_INFEAS = 59
  CPX_SUM_QCPRIMAL_RESIDUAL = 44
  CPX_SUM_QCSLACK = 48
  CPX_SUM_QCSLACK_INFEAS = 46
  CPX_SUM_RED_COST = 37
  CPX_SUM_SCALED_DUAL_INFEAS = 8
  CPX_SUM_SCALED_DUAL_RESIDUAL = 18
  CPX_SUM_SCALED_PI = 34
  CPX_SUM_SCALED_PRIMAL_INFEAS = 4
  CPX_SUM_SCALED_PRIMAL_RESIDUAL = 14
  CPX_SUM_SCALED_RED_COST = 38
  CPX_SUM_SCALED_SLACK = 36
  CPX_SUM_SCALED_X = 32
  CPX_SUM_SLACK = 35
  CPX_SUM_X = 31
  CPX_TUNE_ABORT = 1
  CPX_TUNE_AVERAGE = 1
  CPX_TUNE_DETTILIM = 3
  CPX_TUNE_MINMAX = 2
  CPX_TUNE_TILIM = 2
  CPX_TYPE_ANY = 'A'
  CPX_TYPE_SOS1 = '1'
  CPX_TYPE_SOS2 = '2'
  CPX_TYPE_USER = 'X'
  CPX_TYPE_VAR = '0'
  CPX_USECUT_FILTER = 2
  CPX_USECUT_FORCE = 0
  CPX_USECUT_PURGE = 1
  CPX_VARSEL_DEFAULT = 0
  CPX_VARSEL_MAXINFEAS = 1
  CPX_VARSEL_MININFEAS = -1
  CPX_VARSEL_PSEUDO = 2
  CPX_VARSEL_PSEUDOREDUCED = 4
  CPX_VARSEL_STRONG = 3
  CPX_WRITELEVEL_ALLVARS = 1
  CPX_WRITELEVEL_AUTO = 0
  CPX_WRITELEVEL_DISCRETEVARS = 2
  CPX_WRITELEVEL_NONZERODISCRETEVARS = 4
  CPX_WRITELEVEL_NONZEROVARS = 3
  ConflictAlgorithm = [1073, 'algorithm used to find minimal conflicts:\n 0 = automatic\n 1 = fast\n 2 = propagation\n 3 = presolve\n 4 = IIS\n ...
  ConflictDisplay = [1074, 'level of the conflict display:\n 0 = no display\n 1 = summary display\n 2 = display every model being solved', 1]
  DistMIPRampupDetTimeLimit = [2164, 'deterministic time limit on rampup', 2]
  DistMIPRampupDuration = [2163, 'duration of the rampup phase in distributed MIP:\n -1 = rampup is disabled\n 0 = automatic\n 1 = rampup is follo...
  DistMIPRampupTimeLimit = [2165, 'wall-clock time limit on rampup', 2]
  EmphasisMIP = [2058, 'emphasis for MIP optimization:\n 0 = balance optimality and integer feasibility\n 1 = integer feasibility\n 2 = optimality...
  EmphasisMemory = [1082, 'reduced memory emphasis', 1]
  EmphasisNumerical = [1083, 'extreme numerical caution emphasis', 1]
  FeasoptMode = [1084, 'relaxation measure:\n 0 = find minimum-sum relaxation\n 1 = find optimal minimum-sum relaxation\n 2 = find minimum number ...
  FeasoptTolerance = [2073, 'minimum amount of accepted relaxation', 2]
  MIPCutsBQP = [2195, 'type of BQP cut generation (only applies to non-convex models solved to global optimality):\n -1 = do not generate\n 0 = aut...
  MIPCutsCliques = [2003, 'type of clique cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive\n 3 = very aggr...
  MIPCutsCovers = [2005, 'type of cover cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive\n 3 = very aggres...
  MIPCutsDisjunctive = [2053, 'type of disjunctive cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive\n 3 = ...
  MIPCutsFlowCovers = [2040, 'type of flow cover cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPCutsGUBCovers = [2044, 'type of GUB cover cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPCutsGomory = [2049, 'type of Gomory fractional cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPCutsImplied = [2041, 'type of implied bound cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPCutsLiftProj = [2152, 'type of Lift and Project cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive\n 3 ...
  MIPCutsLocalImplied = [2181, 'type of local implied bound cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressiv...
  MIPCutsMCFCut = [2134, 'type of MCF cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPCutsMIRCut = [2052, 'type of mixed integer rounding cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPCutsPathCut = [2051, 'type of flow path cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPCutsRLT = [2196, 'type of RLT cut generation (only applies to non-convex models solved to global optimality):\n -1 = do not generate\n 0 = aut...
  MIPCutsZeroHalfCut = [2111, 'type of zero-half cut generation:\n -1 = do not generate\n 0 = automatic\n 1 = moderate\n 2 = aggressive', 1]
  MIPDisplay = [2012, 'level of mixed integer node display:\n 0 = no display\n 1 = display integer feasible solutions\n 2 = display nodes under \'...
  MIPInterval = [2013, 'interval for printing mixed integer node display:\n 0 = automatic (equivalent to -1000)\n n>0 = display every n nodes and n...
  MIPLimitsAggForCut = [2054, 'constraint aggregation limit for cut generation:\n 0 = no constraint aggregation for cut generation\n positive value...
  MIPLimitsAuxRootThreads = [2139, 'number of threads to use for auxiliary root tasks:\n -1 = off\n 0 = automatic\n n>0 = use n threads for auxili...
  MIPLimitsCutPasses = [2056, 'number of cutting plane passes:\n -1 = none\n 0 = automatic\n positive values give number of passes to perform', 4]
  MIPLimitsCutsFactor = [2033, 'rows multiplier factor to limit cuts:\n -1 = automatic (dynamically calculated)\n 0<=n<=1 = disable cutting plane g...
  MIPLimitsEachCutLimit = [2102, 'limit on number of cuts for each type per pass', 1]
  MIPLimitsGomoryCand = [2048, 'candidate limit for generating Gomory fractional cuts', 1]
  MIPLimitsGomoryPass = [2050, 'pass limit for generating Gomory fractional cuts:\n 0 = automatic\n positive values at this limit', 4]
  MIPLimitsNodes = [2017, 'branch and cut node limit', 4]
  MIPLimitsPolishTime = [2066, 'time limit for polishing best solution', 2]
  MIPLimitsPopulate = [2108, 'solutions limit for each populate call', 1]
  MIPLimitsProbeDetTime = [2150, 'deterministic time limit for probing', 2]
  MIPLimitsProbeTime = [2065, 'time limit for probing', 2]
  MIPLimitsRepairTries = [2067, 'number of times to try repair heuristic:\n -1 = none\n 0 = automatic\n positive values give number of repair atte...
  MIPLimitsSolutions = [2015, 'mixed integer solutions limit', 4]
  MIPLimitsStrongCand = [2045, 'strong branching candidate limit', 1]
  MIPLimitsStrongIt = [2046, 'strong branching iteration limit:\n 0 = automatic\n positive values at this limit', 4]
  MIPLimitsTreeMemory = [2027, 'upper limit on size of tree in megabytes', 2]
  MIPOrderType = [2032, 'type of generated priority order:\n 0 = none\n 1 = decreasing cost\n 2 = increasing bound range\n 3 = increasing cost pe...
  MIPPolishAfterAbsMIPGap = [2126, 'absolute MIP gap after which to start solution polishing', 2]
  MIPPolishAfterDetTime = [2151, 'deterministic time after which to start solution polishing', 2]
  MIPPolishAfterMIPGap = [2127, 'relative MIP gap after which to start solution polishing', 2]
  MIPPolishAfterNodes = [2128, 'node count after which to start solution polishing', 4]
  MIPPolishAfterSolutions = [2129, 'solution count after which to start solution polishing', 4]
  MIPPolishAfterTime = [2130, 'time after which to start solution polishing', 2]
  MIPPoolAbsGap = [2106, 'absolute objective gap', 2]
  MIPPoolCapacity = [2103, 'capacity of solution pool', 1]
  MIPPoolIntensity = [2107, 'intensity for populating the MIP solution pool:\n 0 = automatic\n 1 = mild: generate few solutions quickly\n 2 = mode...
  MIPPoolRelGap = [2105, 'relative objective gap', 2]
  MIPPoolReplace = [2104, 'solution pool replacement strategy:\n 0 = replace oldest solutions\n 1 = replace solutions with worst objective\n 2 = r...
  MIPStrategyBBInterval = [2039, 'interval to select best bound node', 4]
  MIPStrategyBacktrack = [2002, 'factor for backtracking, lower values give more', 2]
  MIPStrategyBranch = [2001, 'direction of first branch:\n -1 = down branch first\n 0 = automatic\n 1 = up branch first ', 1]
  MIPStrategyDive = [2060, 'dive strategy:\n 0 = automatic\n 1 = traditional dive\n 2 = probing dive\n 3 = guided dive ', 1]
  MIPStrategyFPHeur = [2098, 'feasibility pump heuristic:\n -1 = none\n 0 = automatic\n 1 = feasibility\n 2 = objective and feasibility', 1]
  MIPStrategyFile = [2016, 'file for node storage when tree memory limit is reached:\n 0 = no node file\n 1 = node file in memory and compressed\n ...
  MIPStrategyHeuristicFreq = [2031, 'frequency to apply periodic heuristic algorithm:\n -1 = none\n 0 = automatic\n positive values at this freque...
  MIPStrategyKappaStats = [2137, 'strategy to gather statistics on the kappa of subproblems:\n -1 = never\n 0 = automatic\n 1 = sample\n 2 = alwa...
  MIPStrategyLBHeur = [2063, 'indicator for local branching heuristic', 1]
  MIPStrategyMIQCPStrat = [2110, 'MIQCP strategy:\n 0 = automatic\n 1 = solve QCP relaxation at each node\n 2 = solve LP relaxation at each node', 1]
  MIPStrategyNodeSelect = [2018, 'node selection strategy:\n 0 = depth-first search\n 1 = best-bound search\n 2 = best-estimate search\n 3 = alte...
  MIPStrategyOrder = [2020, 'indicator to use priority orders', 1]
  MIPStrategyPresolveNode = [2037, 'node presolve strategy:\n -1 = no node presolve\n 0 = automatic\n 1 = force node presolve\n 2 = node probing\...
  MIPStrategyProbe = [2042, 'probing strategy:\n -1 = no probing\n 0 = automatic\n 1 = moderate\n 2 = aggressive\n 3 = very aggressive', 1]
  MIPStrategyRINSHeur = [2061, 'frequency to apply RINS heuristic:\n -1 = none\n 0 = automatic\n positive values at this frequency', 4]
  MIPStrategySearch = [2109, 'indicator for search method:\n 0 = automatic\n 1 = traditional branch-and-cut search\n 2 = dynamic search', 1]
  MIPStrategyStartAlgorithm = [2025, 'algorithm to solve initial relaxation:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = networ...
  MIPStrategySubAlgorithm = [2026, 'algorithm to solve subproblems:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = network simplex...
  MIPStrategyVariableSelect = [2028, 'variable selection strategy:\n -1 = minimum integer infeasibility\n 0 = automatic\n 1 = maximum integer infe...
  MIPSubMIPNodeLimit = [2212, 'sub-MIP node limit', 4]
  MIPSubMIPScale = [2207, 'type of scaling used for sub-MIPs:\n -1 = no scaling\n 0 = equilibration scaling\n 1 = aggressive scaling', 1]
  MIPSubMIPStartAlg = [2205, 'algorithm to solve initial relaxation for sub-MIPs:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = n...
  MIPSubMIPSubAlg = [2206, 'algorithm to solve subproblems for sub-MIPs:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = network si...
  MIPTolerancesAbsMIPGap = [2008, 'absolute mixed integer optimality gap tolerance', 2]
  MIPTolerancesIntegrality = [2010, 'integrality tolerance', 2]
  MIPTolerancesLowerCutoff = [2006, 'lower objective cutoff', 2]
  MIPTolerancesMIPGap = [2009, 'mixed integer optimality gap tolerance', 2]
  MIPTolerancesObjDifference = [2019, 'absolute amount successive objective values should differ', 2]
  MIPTolerancesRelObjDifference = [2022, 'relative amount successive objective values should differ', 2]
  MIPTolerancesUpperCutoff = [2007, 'upper objective cutoff', 2]
  MultiObjectiveDisplay = [1600, 'level of display during multi-objective optimization:\n 0 = no display\n 1 = summary display after each sub-probl...
  NetworkDisplay = [5005, 'level of the network iteration display:\n 0 = no display\n 1 = display true objective values\n 2 = display penalized ob...
  NetworkIterations = [5001, 'network simplex iteration limit', 4]
  NetworkNetFind = [1022, 'level of network extraction:\n 1 = natural network only\n 2 = reflection scaling\n 3 = general scaling ', 1]
  NetworkPricing = [5004, 'pricing strategy index:\n 0 = let cplex select pricing strategy\n 1 = partial pricing\n 2 = multiple partial pricing (n...
  NetworkTolerancesFeasibility = [5003, 'feasibility tolerance', 2]
  NetworkTolerancesOptimality = [5002, 'reduced cost optimality tolerance', 2]
  OutputCloneLog = [1132, 'control the creation of clone log files:\n 0 = no clone log\n 1 = create clone log', 1]
  OutputIntSolFilePrefix = [2143, 'file name prefix for storing incumbents when they arrive', 3]
  OutputMPSLong = [1081, 'indicator for long numbers in MPS output files', 1]
  OutputWriteLevel = [1114, 'variables to include in .sol and .mst files:\n 0 = auto\n 1 = all values\n 2 = discrete values\n 3 = non-zero values...
  PreprocessingAggregator = [1003, 'limit on applications of the aggregator:\n -1 = automatic (1 for LP, infinite for MIP)\n 0 = none\n >0 = aggre...
  PreprocessingBoundStrength = [2029, 'type of bound strengthening:\n -1 = automatic\n 0 = off\n 1 = on', 1]
  PreprocessingCoeffReduce = [2004, 'level of coefficient reduction:\n -1 = automatic\n 0 = none\n 1 = reduce only to integral coefficients\n 2 =...
  PreprocessingDependency = [1008, 'indicator for preprocessing dependency checker:\n -1 = automatic\n 0 = off\n 1 = at beginning\n 2 = at end\n ...
  PreprocessingDual = [1044, 'take dual in preprocessing:\n -1 = no\n 0 = automatic\n 1 = yes', 1]
  PreprocessingFill = [1002, 'limit on fill in aggregation', 4]
  PreprocessingFolding = [1164, 'indicator for folding of LPs:\n -1 = automatic\n 0 = off\n 1-5 = increasing aggressive levels', 1]
  PreprocessingLinear = [1058, 'indicator for linear reductions:\n 0 = only linear reductions\n 1 = full reductions', 1]
  PreprocessingNumPass = [1052, 'limit on applications of presolve:\n -1 = automatic\n 0 = none\n >0 = presolve application limit', 1]
  PreprocessingPresolve = [1030, 'presolve indicator', 1]
  PreprocessingQCPDuals = [4003, 'dual calculation for QCPs:\n 0 = do not calculate\n 1 = calculate only if it does not interfere with presolve red...
  PreprocessingQPMakePSD = [4010, 'indicator to make a binary qp psd or tighter', 1]
  PreprocessingQToLin = [4012, 'indicator to linearize products in the objective involving binary variables (for convex MIQP), or all products of bou...
  PreprocessingReduce = [1057, 'type of primal and dual reductions:\n 0 = no primal and dual reductions\n 1 = only primal reductions\n 2 = only du...
  PreprocessingRelax = [2034, 'indicator for additional presolve of lp relaxation of mip:\n -1 = automatic\n 0 = off\n 1 = on', 1]
  PreprocessingRepeatPresolve = [2064, 'repeat mip presolve:\n -1 = automatic\n 0 = off\n 1 = repeat presolve without cuts\n 2 = repeat presolve ...
  PreprocessingSymmetry = [2059, 'indicator for symmetric reductions:\n -1 = automatic\n 0 = off\n 1-5 = increasing aggressive levels', 1]
  ReadAPIEncoding = [1130, 'code page for API strings', 3]
  ReadConstraints = [1021, 'constraint read size', 1]
  ReadDataCheck = [1056, 'indicator to check data consistency:\n 0 = data checking off\n 1 = data checking on input\n 2 = provide modeling assista...
  ReadFileEncoding = [1129, 'code page for file reading and writing', 3]
  ReadNonzeros = [1024, 'constraint nonzero read size', 4]
  ReadQPNonzeros = [4001, 'quadratic nonzero read size', 4]
  ReadScale = [1034, 'type of scaling used:\n -1 = no scaling\n 0 = equilibration scaling\n 1 = aggressive scaling', 1]
  ReadVariables = [1023, 'variable read size', 1]
  ReadWarningLimit = [1157, 'max number of warnings to display', 4]
  SiftingAlgorithm = [1077, 'algorithm used to solve sifting subproblems:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = network s...
  SiftingDisplay = [1076, 'level of the sifting iteration display:\n 0 = no display\n 1 = display major sifting iterations\n 2 = display work LP l...
  SiftingIterations = [1078, 'sifting iteration limit', 4]
  SiftingSimplex = [1158, 'allow sifting to be called from simplex', 1]
  SimplexCrash = [1007, 'type of crash used:\n LP primal: 0 = ignore objective coefficients during crash\n LP primal: 1 or -1 = alternate ways of u...
  SimplexDGradient = [1009, 'type of dual gradient used in pricing:\n 0 = determined automatically\n 1 = standard dual pricing\n 2 = steepest-edge...
  SimplexDisplay = [1019, 'level of the iteration display:\n 0 = no display\n 1 = display after refactorization\n 2 = display every iteration', 1]
  SimplexDynamicRows = [1161, 'indicator for dynamic management of rows:\n -1 = automatic\n 0 = keep all rows\n 1 = manage rows', 1]
  SimplexLimitsIterations = [1020, 'upper limit on primal and dual simplex iterations', 4]
  SimplexLimitsLowerObj = [1025, 'lower limit on value of objective', 2]
  SimplexLimitsPerturbation = [1028, 'upper limit on iterations with no progress:\n 0 = automatic\n >0 = user specified limit', 1]
  SimplexLimitsSingularity = [1037, 'upper limit on repaired singularities', 1]
  SimplexLimitsUpperObj = [1026, 'upper limit on value of objective', 2]
  SimplexPGradient = [1029, 'type of primal gradient used in pricing:\n -1 = reduced-cost pricing\n 0 = hybrid reduced-cost and devex pricing\n 1 ...
  SimplexPerturbationConstant = [1015, 'perturbation constant', 2]
  SimplexPerturbationIndicator = [1027, 'perturbation indicator', 1]
  SimplexPricing = [1010, 'size of the pricing candidate list', 1]
  SimplexRefactor = [1031, 'refactorization interval', 1]
  SimplexTolerancesFeasibility = [1016, 'feasibility tolerance', 2]
  SimplexTolerancesMarkowitz = [1013, 'Markowitz threshold tolerance', 2]
  SimplexTolerancesOptimality = [1014, 'reduced cost optimality tolerance', 2]
  TuneDetTimeLimit = [1139, 'deterministic time limit per model and per test setting', 2]
  TuneDisplay = [1113, 'level of the tuning display:\n 0 = no display\n 1 = minimal display\n 2 = display settings being tried\n 3 = display sett...
  TuneMeasure = [1110, 'method used to compare across multiple problems:\n 1 = average\n 2 = minmax', 1]
  TuneRepeat = [1111, 'number of times to permute the model and repeat', 1]
  TuneTimeLimit = [1112, 'time limit per model and per test setting', 2]
  setAdvance = [1001, 'indicator for advanced starting information:\n 0 = no advanced start\n 1 = standard advanced start\n 2 = alternate advanced...
  setCPUmask = [1144, 'cpubinding mask (off, auto, or a hex mask)', 3]
  setClockType = [1006, 'type of clock used to measure time:\n 0 = automatic\n 1 = CPU time\n 2 = wall-clock time', 1]
  setDetTimeLimit = [1127, 'deterministic time limit in ticks', 2]
  setLPMethod = [1062, 'method for linear optimization:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = network simplex\n 4 = barr...
  setOptimalityTarget = [1131, 'type of solution CPLEX will attempt to compute:\n 0 = auto\n 1 = optimal solution to convex problem\n 2 = first-or...
  setParallel = [1109, 'parallel optimization mode:\n -1 = opportunistic\n 0 = automatic\n 1 = deterministic', 1]
  setParamDisplay = [1163, 'whether to display changed parameters before optimization', 1]
  setQPMethod = [1063, 'method for quadratic optimization:\n 0 = automatic\n 1 = primal simplex\n 2 = dual simplex\n 3 = network simplex\n 4 = b...
  setRandomSeed = [1124, 'seed to initialize the random number generator', 1]
  setRecord = [1162, 'record calls to C API', 1]
  setSolutionType = [1147, 'solution information CPLEX will attempt to compute:\n 0 = auto\n 1 = basic solution\n 2 = primal dual vector pair', 1]
  setThreads = [1067, 'default parallel thread count:\n 0 = automatic\n 1 = sequential\n >1 = parallel', 1]
  setTimeLimit = [1039, 'time limit in seconds', 2]
  setWorkDir = [1064, 'directory for CPLEX working files', 3]
  setWorkMem = [1065, 'memory available for working storage (in megabytes)', 2]
Variables Details

BarrierAlgorithm

Value:
[3007,
 '''barrier algorithm choice:
  0 = default
  1 = infeasibility - estimate start
  2 = infeasibility - constant start
  3 = standard barrier''',
 1]

BarrierColNonzeros

Value:
[3009,
 '''minimum number of entries to consider a column dense:
  0 = dynamically calculated
  >0 = specific number of column entries''',
 1]

BarrierOrdering

Value:
[3014,
 '''barrier ordering algorithm:
  0 = automatic
  1 = approximate minimum degree
  2 = approximate minimum fill
  3 = nested dissection''',
 1]

BarrierStartAlg

Value:
[3017,
 '''barrier starting point algorithm:
  1 = dual is 0
  2 = estimate dual
  3 = primal avg, dual is 0
  4 = primal avg, dual estimate''',
 1]

BendersStrategy

Value:
[1501,
 '''choice of benders decomposition to use:
  -1 = do not use benders decomposition
  0 = automatic
  1 = use the decomposition specified by annotation
  2 = auto-decompose workers specified by annotation
  3 = ignore annotation and auto-decompose model (for MIP only)''',
 1]

BendersWorkerAlgorithm

Value:
[1500,
 '''method for optimizing benders subproblems:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier
  5 = sifting''',
...

ConflictAlgorithm

Value:
[1073,
 '''algorithm used to find minimal conflicts:
  0 = automatic
  1 = fast
  2 = propagation
  3 = presolve
  4 = IIS
  5 = limited solve
...

DistMIPRampupDuration

Value:
[2163,
 '''duration of the rampup phase in distributed MIP:
  -1 = rampup is disabled
  0 = automatic
  1 = rampup is followed by distributed tree search
  2 = infinite horizon rampup''',
 1]

EmphasisMIP

Value:
[2058,
 '''emphasis for MIP optimization:
  0 = balance optimality and integer feasibility
  1 = integer feasibility
  2 = optimality
  3 = moving best bound
  4 = finding hidden feasible solutions''',
 1]

FeasoptMode

Value:
[1084,
 '''relaxation measure:
  0 = find minimum-sum relaxation
  1 = find optimal minimum-sum relaxation
  2 = find minimum number of relaxations
  3 = find optimal relaxation with minimum number of relaxations
  4 = find minimum quadratic-sum relaxation
  5 = find optimal minimum quadratic-sum relaxation''',
...

MIPCutsBQP

Value:
[2195,
 '''type of BQP cut generation (only applies to non-convex models solv\
ed to global optimality):
  -1 = do not generate
  0 = automatic
  1 = moderate
  2 = aggressive
  3 = very aggressive''',
...

MIPCutsCliques

Value:
[2003,
 '''type of clique cut generation:
  -1 = do not generate
  0 = automatic
  1 = moderate
  2 = aggressive
  3 = very aggressive''',
 1]

MIPCutsCovers

Value:
[2005,
 '''type of cover cut generation:
  -1 = do not generate
  0 = automatic
  1 = moderate
  2 = aggressive
  3 = very aggressive''',
 1]

MIPCutsDisjunctive

Value:
[2053,
 '''type of disjunctive cut generation:
  -1 = do not generate
  0 = automatic
  1 = moderate
  2 = aggressive
  3 = very aggressive''',
 1]

MIPCutsLiftProj

Value:
[2152,
 '''type of Lift and Project cut generation:
  -1 = do not generate
  0 = automatic
  1 = moderate
  2 = aggressive
  3 = very aggressive''',
 1]

MIPCutsLocalImplied

Value:
[2181,
 '''type of local implied bound cut generation:
  -1 = do not generate
  0 = automatic
  1 = moderate
  2 = aggressive
  3 = very aggressive''',
 1]

MIPCutsRLT

Value:
[2196,
 '''type of RLT cut generation (only applies to non-convex models solv\
ed to global optimality):
  -1 = do not generate
  0 = automatic
  1 = moderate
  2 = aggressive
  3 = very aggressive''',
...

MIPDisplay

Value:
[2012,
 '''level of mixed integer node display:
  0 = no display
  1 = display integer feasible solutions
  2 = display nodes under \'mip interval\' control
  3 = same as 2, but add information on node cuts and solution times
  4 = same as 3, but add LP display for root node
  5 = same as 3, but add LP display for all nodes''',
...

MIPInterval

Value:
[2013,
 '''interval for printing mixed integer node display:
  0 = automatic (equivalent to -1000)
  n>0 = display every n nodes and new incumbents
  n<0 = progressively less log output over time (closer to 0: more fre\
quent)''',
 4]

MIPLimitsAggForCut

Value:
[2054,
 '''constraint aggregation limit for cut generation:
  0 = no constraint aggregation for cut generation
  positive values at this limit''',
 1]

MIPLimitsAuxRootThreads

Value:
[2139,
 '''number of threads to use for auxiliary root tasks:
  -1 = off
  0 = automatic
  n>0 = use n threads for auxiliary root tasks''',
 1]

MIPLimitsCutsFactor

Value:
[2033,
 '''rows multiplier factor to limit cuts:
  -1 = automatic (dynamically calculated)
  0<=n<=1 = disable cutting plane generation
  n>1 = number of cuts limited to (n-1) times the original number of r\
ows''',
 2]

MIPLimitsRepairTries

Value:
[2067,
 '''number of times to try repair heuristic:
  -1 = none
  0 = automatic
  positive values give number of repair attempts''',
 4]

MIPOrderType

Value:
[2032,
 '''type of generated priority order:
  0 = none
  1 = decreasing cost
  2 = increasing bound range
  3 = increasing cost per coefficient count''',
 1]

MIPPoolIntensity

Value:
[2107,
 '''intensity for populating the MIP solution pool:
  0 = automatic
  1 = mild: generate few solutions quickly
  2 = moderate: generate a larger number of solutions
  3 = aggressive: generate many solutions and expect performance penal\
ty
  4 = very aggressive: enumerate all practical solutions''',
...

MIPPoolReplace

Value:
[2104,
 '''solution pool replacement strategy:
  0 = replace oldest solutions
  1 = replace solutions with worst objective
  2 = replace least diverse solutions''',
 1]

MIPStrategyFile

Value:
[2016,
 '''file for node storage when tree memory limit is reached:
  0 = no node file
  1 = node file in memory and compressed
  2 = node file on disk
  3 = node file on disk and compressed''',
 1]

MIPStrategyHeuristicFreq

Value:
[2031,
 '''frequency to apply periodic heuristic algorithm:
  -1 = none
  0 = automatic
  positive values at this frequency''',
 4]

MIPStrategyKappaStats

Value:
[2137,
 '''strategy to gather statistics on the kappa of subproblems:
  -1 = never
  0 = automatic
  1 = sample
  2 = always''',
 1]

MIPStrategyNodeSelect

Value:
[2018,
 '''node selection strategy:
  0 = depth-first search
  1 = best-bound search
  2 = best-estimate search
  3 = alternate best-estimate search''',
 1]

MIPStrategyPresolveNode

Value:
[2037,
 '''node presolve strategy:
  -1 = no node presolve
  0 = automatic
  1 = force node presolve
  2 = node probing
  3 = aggressive node probing''',
 1]

MIPStrategyStartAlgorithm

Value:
[2025,
 '''algorithm to solve initial relaxation:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier
  5 = sifting
...

MIPStrategySubAlgorithm

Value:
[2026,
 '''algorithm to solve subproblems:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier
  5 = sifting''',
...

MIPStrategyVariableSelect

Value:
[2028,
 '''variable selection strategy:
  -1 = minimum integer infeasibility
  0 = automatic
  1 = maximum integer infeasibility
  2 = pseudo costs
  3 = strong branching
  4 = pseudo reduced costs''',
...

MIPSubMIPStartAlg

Value:
[2205,
 '''algorithm to solve initial relaxation for sub-MIPs:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier
  5 = sifting''',
...

MIPSubMIPSubAlg

Value:
[2206,
 '''algorithm to solve subproblems for sub-MIPs:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier
  5 = sifting''',
...

MultiObjectiveDisplay

Value:
[1600,
 '''level of display during multi-objective optimization:
  0 = no display
  1 = summary display after each sub-problem
  2 = same as 1, but add sub-problem logs''',
 1]

NetworkDisplay

Value:
[5005,
 '''level of the network iteration display:
  0 = no display
  1 = display true objective values
  2 = display penalized objective values''',
 1]

NetworkPricing

Value:
[5004,
 '''pricing strategy index:
  0 = let cplex select pricing strategy
  1 = partial pricing
  2 = multiple partial pricing (no sorting)
  3 = multiple partial pricing (with sorting)''',
 1]

OutputWriteLevel

Value:
[1114,
 '''variables to include in .sol and .mst files:
  0 = auto
  1 = all values
  2 = discrete values
  3 = non-zero values
  4 = non-zero discrete values''',
 1]

PreprocessingAggregator

Value:
[1003,
 '''limit on applications of the aggregator:
  -1 = automatic (1 for LP, infinite for MIP)
  0 = none
  >0 = aggregator application limit''',
 1]

PreprocessingCoeffReduce

Value:
[2004,
 '''level of coefficient reduction:
  -1 = automatic
  0 = none
  1 = reduce only to integral coefficients
  2 = reduce any potential coefficient
  3 = aggressive reduction with tilting''',
 1]

PreprocessingDependency

Value:
[1008,
 '''indicator for preprocessing dependency checker:
  -1 = automatic
  0 = off
  1 = at beginning
  2 = at end
  3 = at both beginning and end''',
 1]

PreprocessingQCPDuals

Value:
[4003,
 '''dual calculation for QCPs:
  0 = do not calculate
  1 = calculate only if it does not interfere with presolve reductions
  2 = calculate and disable interfering presolve reductions''',
 1]

PreprocessingQToLin

Value:
[4012,
 '''indicator to linearize products in the objective involving binary \
variables (for convex MIQP), or all products of bounded variables (for\
 global QP):
  -1 = automatic
  0 = off
  1 = on''',
 1]

PreprocessingReduce

Value:
[1057,
 '''type of primal and dual reductions:
  0 = no primal and dual reductions
  1 = only primal reductions
  2 = only dual reductions
  3 = both primal and dual reductions''',
 1]

PreprocessingRepeatPresolve

Value:
[2064,
 '''repeat mip presolve:
  -1 = automatic
  0 = off
  1 = repeat presolve without cuts
  2 = repeat presolve with cuts
  3 = repeat presolve with cuts and allow new root cuts''',
 1]

ReadDataCheck

Value:
[1056,
 '''indicator to check data consistency:
  0 = data checking off
  1 = data checking on input
  2 = provide modeling assistance''',
 1]

SiftingAlgorithm

Value:
[1077,
 '''algorithm used to solve sifting subproblems:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier''',
 1]

SiftingDisplay

Value:
[1076,
 '''level of the sifting iteration display:
  0 = no display
  1 = display major sifting iterations
  2 = display work LP logs''',
 1]

SimplexCrash

Value:
[1007,
 '''type of crash used:
  LP primal: 0 = ignore objective coefficients during crash
  LP primal: 1 or -1 = alternate ways of using objective coefficients
  LP dual: 1 = default starting basis
  LP dual: 0 or -1 = aggressive starting basis
  QP primal: -1 = slack basis
  QP primal: 0 = ignore Q terms and use LP solver for crash
...

SimplexDGradient

Value:
[1009,
 '''type of dual gradient used in pricing:
  0 = determined automatically
  1 = standard dual pricing
  2 = steepest-edge pricing
  3 = steepest-edge pricing in slack space
  4 = steepest-edge pricing, unit initial norms
  5 = devex pricing''',
...

SimplexPGradient

Value:
[1029,
 '''type of primal gradient used in pricing:
  -1 = reduced-cost pricing
  0 = hybrid reduced-cost and devex pricing
  1 = devex pricing
  2 = steepest-edge pricing
  3 = steepest-edge pricing, 1 initial norms
  4 = full pricing''',
...

TuneDisplay

Value:
[1113,
 '''level of the tuning display:
  0 = no display
  1 = minimal display
  2 = display settings being tried
  3 = display settings and logs''',
 1]

setAdvance

Value:
[1001,
 '''indicator for advanced starting information:
  0 = no advanced start
  1 = standard advanced start
  2 = alternate advanced start''',
 1]

setLPMethod

Value:
[1062,
 '''method for linear optimization:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier
  5 = sifting
...

setOptimalityTarget

Value:
[1131,
 '''type of solution CPLEX will attempt to compute:
  0 = auto
  1 = optimal solution to convex problem
  2 = first-order optimal solution
  3 = global optimal solution''',
 1]

setQPMethod

Value:
[1063,
 '''method for quadratic optimization:
  0 = automatic
  1 = primal simplex
  2 = dual simplex
  3 = network simplex
  4 = barrier
  5 = sifting
...