XPRSconstants

All Known Implementing Classes:

XPRS
```
public interface XPRSconstants
```
Misc constants used in XPRS (as defined in xprs.h in Optimizer C library)

Field Summary

Modifier and Type	Field and Description
`static int`	`ACTIVENODES` Number of outstanding nodes.
`static int`	`ACTIVESET` Control of type Integer.
`static int`	`ALG_BARRIER` Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_DEFAULT` Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_DUAL` Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_NETWORK` Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_PRIMAL` Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_PULL_CHOLESKY` Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_PUSH_CHOLESKY` Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALGAFTERCROSSOVER` The algorithm to be used for the final clean up step after the crossover.
`static int`	`ALGAFTERNETWORK` The algorithm to be used for the clean up step after the network simplex solver.
`static int`	`ALGORITHM` The algorithm the optimizer currently is running / was running just before completition.
`static int`	`ALLOW_COMPUTE_ALWAYS` Constant used in enumeration 'enum_allow_compute'
`static int`	`ALLOW_COMPUTE_DEFAULT` Constant used in enumeration 'enum_allow_compute'
`static int`	`ALLOW_COMPUTE_NEVER` Constant used in enumeration 'enum_allow_compute'
`static int`	`ANA_ALWAYS` Constant used in enumeration 'ALWAYSNEVERAUTOMATIC'
`static int`	`ANA_AUTOMATIC` Constant used in enumeration 'ALWAYSNEVERAUTOMATIC'
`static int`	`ANA_NEVER` Constant used in enumeration 'ALWAYSNEVERAUTOMATIC'
`static int`	`ATTENTIONLEVEL` A measure between 0 and 1 for how numerically unstable the problem is.
`static int`	`AUTOCUTTING` Should the Optimizer automatically decide whether to generate cutting planes at local nodes in the tree or not? If the `CUTFREQ` control is set, no automatic selection will be made and local cutting will be enabled.
`static int`	`AUTOPERTURB` Simplex: This indicates whether automatic perturbation is performed.
`static int`	`AUTOSCALING` Whether the Optimizer should automatically select between different scaling algorithms.
`static int`	`AVAILABLEMEMORY` The amount of heap memory detected by Xpress as free.
`static int`	`BACKTRACK` Branch and Bound: Specifies how to select the next node to work on when a full backtrack is performed.
`static int`	`BACKTRACKALG_BEST_BOUND` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_BEST_ESTIMATE` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_BEST_ESTIMATE_MIN_INFEAS` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_DEEPEST_BEST_ESTIMATE` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_DEEPEST_NODE` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_EARLIEST_NODE` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_HIGHEST_NODE` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_LATEST_NODE` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_MIN_INFEAS` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKALG_RANDOM` Constant used in enumeration 'BACKTRACKALG'
`static int`	`BACKTRACKTIE` Branch and Bound: Specifies how to break ties when selecting the next node to work on when a full backtrack is performed.
`static int`	`BAR_DEFAULT` Constant used in enumeration 'BARORDER'
`static int`	`BAR_MIN_DEGREE` Constant used in enumeration 'BARORDER'
`static int`	`BAR_MIN_LOCAL_FILL` Constant used in enumeration 'BARORDER'
`static int`	`BAR_NESTED_DISSECTION` Constant used in enumeration 'BARORDER'
`static int`	`BARAASIZE` Number of nonzeros in AA ^T.
`static int`	`BARALG` This control determines which barrier algorithm is to be used to solve the problem.
`static int`	`BARCGAP` Convergence criterion for the Newton barrier algorithm.
`static int`	`BARCONDA` Absolute condition measure calculated in the last iteration of the barrier algorithm.
`static int`	`BARCONDD` Condition measure calculated in the last iteration of the barrier algorithm.
`static int`	`BARCORES` If set to a positive integer it determines the number of physical CPU cores assumed to be present in the system by the barrier algorithm.
`static int`	`BARCRASH` Newton barrier: This determines the type of crash used for the crossover.
`static int`	`BARCROSSOVER` Indicates whether or not the basis crossover phase has been entered.
`static int`	`BARDENSECOL` Number of dense columns found in the matrix.
`static int`	`BARDUALINF` Sum of the dual infeasibilities for the Newton barrier algorithm.
`static int`	`BARDUALOBJ` Dual objective value calculated by the Newton barrier algorithm.
`static int`	`BARDUALSTOP` Newton barrier: This is a convergence parameter, representing the tolerance for dual infeasibilities.
`static int`	`BARFAILITERLIMIT` Newton barrier: The maximum number of consecutive iterations that fail to improve the solution in the barrier algorithm.
`static int`	`BARFREESCALE` Defines how the barrier algorithm scales free variables.
`static int`	`BARGAPSTOP` Newton barrier: This is a convergence parameter, representing the tolerance for the relative duality gap.
`static int`	`BARGAPTARGET` Newton barrier: The target tolerance for the relative duality gap.
`static int`	`BARINDEFLIMIT` Newton Barrier.
`static int`	`BARITER` Number of Newton barrier iterations.
`static int`	`BARITERLIMIT` Newton barrier: The maximum number of iterations.
`static int`	`BARKERNEL` Newton barrier: Defines how centrality is weighted in the barrier algorithm.
`static int`	`BARLARGEBOUND` Control of type Double.
`static int`	`BARLSIZE` Number of nonzeros in L resulting from the Cholesky factorization.
`static int`	`BARNUMSTABILITY` Control of type Integer.
`static int`	`BAROBJPERTURB` Defines how the barrier perturbs the objective.
`static int`	`BAROBJSCALE` Defines how the barrier scales the objective.
`static int`	`BARORDER` Newton barrier: This controls the Cholesky factorization in the Newton-Barrier.
`static int`	`BARORDERTHREADS` If set to a positive integer it determines the number of concurrent threads for the sparse matrix ordering algorithm in the Newton-barrier method.
`static int`	`BAROUTPUT` Newton barrier: This specifies the level of solution output provided.
`static int`	`BARPERTURB` Newton barrier: In numerically challenging cases it is often advantageous to apply perturbations on the KKT system to improve its numerical properties.
`static int`	`BARPRESOLVEOPS` Newton barrier: This controls the Newton-Barrier specific presolve operations.
`static int`	`BARPRESOLVEOPS_EXTRA_BARRIER_PRESOLVE` Constant used in enumeration 'BARPRESOLVEOPS'
`static int`	`BARPRESOLVEOPS_STANDARD_PRESOLVE` Constant used in enumeration 'BARPRESOLVEOPS'
`static int`	`BARPRIMALINF` Sum of the primal infeasibilities for the Newton barrier algorithm.
`static int`	`BARPRIMALOBJ` Primal objective value calculated by the Newton barrier algorithm.
`static int`	`BARPRIMALSTOP` Newton barrier: This is a convergence parameter, indicating the tolerance for primal infeasibilities.
`static int`	`BARREFITER` Newton barrier: After terminating the barrier algorithm, further refinement steps can be performed.
`static int`	`BARREGULARIZE` This control determines how the barrier algorithm applies regularization on the KKT system.
`static int`	`BARRHSSCALE` Defines how the barrier scales the right hand side.
`static int`	`BARSING` Number of linearly dependent binding constraints at the optimal barrier solution.
`static int`	`BARSINGR` Regularized number of linearly dependent binding constraints at the optimal barrier solution.
`static int`	`BARSOLUTION` This determines whether the barrier has to decide which is the best solution found or return the solution computed by te last barrier iteration.
`static int`	`BARSTART` Newton barrier: Controls the computation of the starting point for the barrier algorithm.
`static int`	`BARSTARTWEIGHT` Newton barrier: This sets a weight for the warm-start point when warm-start is set for the barrier algorithm.
`static int`	`BARSTEPSTOP` Newton barrier: A convergence parameter, representing the minimal step size.
`static int`	`BARTHREADS` If set to a positive integer it determines the number of threads implemented to run the Newton-barrier algorithm.
`static int`	`BESTBOUND` Value of the best bound determined so far by the global search.
`static int`	`BIGM` The infeasibility penalty used if the "Big M" method is implemented.
`static int`	`BIGMMETHOD` Simplex: This specifies whether to use the "Big M" method, or the standard phase I (achieving feasibility) and phase II (achieving optimality).
`static int`	`BOOL_OFF` Constant used in enumeration 'ONOFF'
`static int`	`BOOL_ON` Constant used in enumeration 'ONOFF'
`static int`	`BOUNDNAME` Active bound name.
`static int`	`BRANCH_MAX_EST_FIRST` Constant used in enumeration 'BRANCHCHOICE'
`static int`	`BRANCH_MIN_EST_FIRST` Constant used in enumeration 'BRANCHCHOICE'
`static int`	`BRANCHCHOICE` Once a global entity has been selected for branching, this control determines which of the branches is solved first.
`static int`	`BRANCHDISJ` Branch and Bound: Determines whether the optimizer should attempt to branch on general split disjunctions during the branch and bound search.
`static int`	`BRANCHSTRUCTURAL` Branch and Bound: Determines whether the optimizer should search for special structure in the problem to branch on during the branch and bound search.
`static int`	`BRANCHVALUE` The value of the branching variable at a node of the Branch and Bound tree.
`static int`	`BRANCHVAR` The branching variable at a node of the Branch and Bound tree.
`static int`	`BREADTHFIRST` The number of nodes to include in the best-first search before switching to the local first search ( `NODESELECTION` `=` `4`).
`static int`	`CACHESIZE` Newton Barrier: L2 or L3 (see notes) cache size in kB (kilobytes) of the CPU.
`static int`	`CALLBACKCOUNT_CUTMGR` This attribute counts the number of times the cut manager callback set by `XPRSaddcbcutmgr` has been called for the current node, including the current callback call.
`static int`	`CALLBACKCOUNT_OPTNODE` This attribute counts the number of times the optimal node callback set by `XPRSaddcboptnode` has been called for the current node, including the current callback call.
`static int`	`CALLBACKFROMMASTERTHREAD` Branch and Bound: specifies whether the MIP callbacks should only be called on the master thread.
`static int`	`CHECKSONMAXCUTTIME` This attribute is used to set the value of the `MAXCHECKSONMAXCUTTIME` control.
`static int`	`CHECKSONMAXTIME` This attribute is used to set the value of the `MAXCHECKSONMAXTIME` control.
`static int`	`CHOLESKYALG` Newton barrier: type of Cholesky factorization used.
`static int`	`CHOLESKYTOL` Newton barrier: The tolerance for pivot elements in the Cholesky decomposition of the normal equations coefficient matrix, computed at each iteration of the barrier algorithm.
`static int`	`CLAMPING` This control allows for the adjustment of returned solution values such that they are always within bounds.
`static int`	`CLAMPING_DUAL` Constant used in enumeration 'CLAMPING'
`static int`	`CLAMPING_PRIMAL` Constant used in enumeration 'CLAMPING'
`static int`	`CLAMPING_RDJ` Constant used in enumeration 'CLAMPING'
`static int`	`CLAMPING_SLACKS` Constant used in enumeration 'CLAMPING'
`static int`	`COLS` Number of columns (i.e.
`static int`	`COMPUTE` Controls whether the next solve is performed directly or on an Insight Compute Interface.
`static int`	`COMPUTEEXECSERVICE` Selects the Insight execution service that will be used for solving remote optimizations.
`static int`	`COMPUTEEXECUTIONS` The number of solves executed on a compute server.
`static int`	`COMPUTEJOBPRIORITY` Selects the priority that will be used for remote optimization jobs.
`static int`	`COMPUTELOG` Controls how the run log is fetched when a solve is performed on an Insight Compute Interface.
`static int`	`COMPUTELOG_NEVER` Constant used in enumeration 'enum_compute_log'
`static int`	`COMPUTELOG_ONCOMPLETION` Constant used in enumeration 'enum_compute_log'
`static int`	`COMPUTELOG_ONERROR` Constant used in enumeration 'enum_compute_log'
`static int`	`COMPUTELOG_REALTIME` Constant used in enumeration 'enum_compute_log'
`static int`	`COMPUTEMATX` Control of type Integer.
`static int`	`COMPUTEMATX_IIS` Control of type Integer.
`static int`	`COMPUTEMATX_IISMAXTIME` Control of type Integer.
`static int`	`CONCURRENTTHREADS` Determines the number of threads used by the concurrent solver.
`static int`	`CONEELEMS` Number of second order cone coefficients in the problem.
`static int`	`CONES` Number of second order and rotated second order cones in the problem.
`static int`	`CONFLICTCUTS` Branch and Bound: Specifies how cautious or aggressive the optimizer should be when searching for and applying conflict cuts.
`static int`	`CORESDETECTED` Number of logical cores detected by the optimizer, which is the total number of threads the hardware can execute across all CPUs.
`static int`	`CORESPERCPU` Used to override the detected value of the number of cores on a CPU.
`static int`	`CORESPERCPUDETECTED` Number of logical cores per CPU unit detected by the optimizer, which is the number of threads each CPU can execute.
`static int`	`COVERCUTS` Branch and Bound: The number of rounds of lifted cover inequalities at the top node.
`static int`	`CPUPLATFORM` Newton Barrier: Selects the AMD or Intel x86 vectorization instruction set that Barrier should run optimized code for.
`static int`	`CPUSDETECTED` Number of CPU units detected by the optimizer.
`static int`	`CPUTIME` How time should be measured when timings are reported in the log and when checking against time limits
`static int`	`CRASH` Simplex: This determines the type of crash used when the algorithm begins.
`static int`	`CROSSOVER` Newton barrier: This control determines whether the barrier method will cross over to the simplex method when at optimal solution has been found, to provide an end basis (see `XPRSgetbasis`, `XPRSwritebasis`) and advanced sensitivity analysis information (see `XPRSobjsa`, `XPRSrhssa`, `XPRSbndsa`).
`static int`	`CROSSOVERACCURACYTOL` Newton barrier: This control determines how crossover adjusts the default relative pivot tolerance.
`static int`	`CROSSOVERDRP` Control of type Integer.
`static int`	`CROSSOVERFEASWEIGHT` Control of type Double.
`static int`	`CROSSOVERITERLIMIT` Newton barrier: The maximum number of iterations that will be performed in the crossover procedure before the optimization process terminates.
`static int`	`CROSSOVEROPS` Newton barrier: a bit vector for adjusting the behavior of the crossover procedure.
`static int`	`CROSSOVERRELPIVOTTOL` Control of type Double.
`static int`	`CROSSOVERRELPIVOTTOLSAFE` Control of type Double.
`static int`	`CROSSOVERTHREADS` Determines the maximum number of threads that parallel crossover is allowed to use.
`static int`	`CSTYLE` Deprecated.
`static int`	`CURRENTMEMORY` The amount of dynamically allocated heap memory by the problem being solved.
`static int`	`CURRENTNODE` The unique identifier of the current node in the tree search.
`static int`	`CURRMIPCUTOFF` The current MIP cut off.
`static int`	`CUTDEPTH` Branch and Bound: Sets the maximum depth in the tree search at which cuts will be generated.
`static int`	`CUTFACTOR` Limit on the number of cuts and cut coefficients the optimizer is allowed to add to the matrix during global search.
`static int`	`CUTFREQ` Branch and Bound: This specifies the frequency at which cuts are generated in the tree search.
`static int`	`CUTS` Number of cuts being added to the matrix.
`static int`	`CUTSELECT` A bit vector providing detailed control of the cuts created for the root node of a global solve.
`static int`	`CUTSELECT_CLIQUE` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_COVER` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_DEFAULT` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_DISABLE_CUT_ROWS` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_FLOWPATH` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_GUB_COVER` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_IMPLICATION` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_LIFT_AND_PROJECT` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSELECT_MIR` Constant used in enumeration 'CUTSELECT'
`static int`	`CUTSTRATEGY` Branch and Bound: This specifies the cut strategy.
`static int`	`CUTSTRATEGY_AGGRESSIVE` Constant used in enumeration 'CUTSTRATEGY'
`static int`	`CUTSTRATEGY_CONSERVATIVE` Constant used in enumeration 'CUTSTRATEGY'
`static int`	`CUTSTRATEGY_DEFAULT` Constant used in enumeration 'CUTSTRATEGY'
`static int`	`CUTSTRATEGY_MODERATE` Constant used in enumeration 'CUTSTRATEGY'
`static int`	`CUTSTRATEGY_NONE` Constant used in enumeration 'CUTSTRATEGY'
`static int`	`DEFAULTALG` This selects the algorithm that will be used to solve the LP if no algorithm flag is passed to the optimization routines.
`static int`	`DENSECOLLIMIT` Newton barrier: Columns with more than `DENSECOLLIMIT` elements are considered to be dense.
`static int`	`DETERMINISTIC` Branch and Bound: Specifies whether the parallel MIP search should be deterministic.
`static int`	`DETLOGFREQ` Control of type Double.
`static int`	`DUALGRADIENT` Simplex: This specifies the dual simplex pricing method.
`static int`	`DUALGRADIENT_AUTOMATIC` Constant used in enumeration 'DUALGRADIENT'
`static int`	`DUALGRADIENT_DEVEX` Constant used in enumeration 'DUALGRADIENT'
`static int`	`DUALGRADIENT_STEEPESTEDGE` Constant used in enumeration 'DUALGRADIENT'
`static int`	`DUALINFEAS` Number of dual infeasibilities.
`static int`	`DUALIZE` This specifies whether presolve should form the dual of the problem.
`static int`	`DUALIZEOPS` Bit-vector control for adjusting the behavior when a problem is dualized.
`static int`	`DUALIZEOPS_SWITCHALGORITHM` Constant used in enumeration 'DUALIZEOPS'
`static int`	`DUALPERTURB` The factor by which the problem will be perturbed prior to optimization by dual simplex.
`static int`	`DUALSTRATEGY` This bit-vector control specifies the dual simplex strategy.
`static int`	`DUALSTRATEGY_REMOVE_INFEAS_WITH_DUAL` Constant used in enumeration 'DUALSTRATEGY'
`static int`	`DUALSTRATEGY_REMOVE_INFEAS_WITH_PRIMAL` Constant used in enumeration 'DUALSTRATEGY'
`static int`	`DUALTHREADS` Determines the maximum number of threads that dual simplex is allowed to use.
`static int`	`EIGENVALUETOL` A quadratic matrix is considered not to be positive semi-definite, if its smallest eigenvalue is smaller than the negative of this value.
`static int`	`ELEMS` Number of matrix nonzeros (elements).
`static int`	`ELIMFILLIN` Amount of fill-in allowed when performing an elimination in presolve .
`static int`	`ELIMTOL` The Markowitz tolerance for the elimination phase of the presolve.
`static int`	`ERRORCODE` The most recent Optimizer error number that occurred.
`static int`	`ESCAPENAMES` If characters illegal to an mps or lp file should be escaped to guarantee readability, and whether escaped characters should be transformed back when reading such a file.
`static int`	`ETATOL` Tolerance on eta elements.
`static int`	`EXTRACOLS` The initial number of extra columns to allow for in the matrix.
`static int`	`EXTRAELEMS` The initial number of extra matrix elements to allow for in the matrix, including coefficients for cuts.
`static int`	`EXTRAMIPENTS` The initial number of extra global entities to allow for.
`static int`	`EXTRAPRESOLVE` This control no longer has any effect and will be removed from future releases.
`static int`	`EXTRAQCELEMENTS` Deprecated.
`static int`	`EXTRAQCROWS` Deprecated.
`static int`	`EXTRAROWS` The initial number of extra rows to allow for in the matrix, including cuts.
`static int`	`EXTRASETELEMS` The initial number of extra elements in sets to allow for in the matrix.
`static int`	`EXTRASETS` The initial number of extra sets to allow for in the matrix.
`static int`	`FEASIBILITYPUMP` Branch and Bound: Decides if the Feasibility Pump heuristic should be run at the top node.
`static int`	`FEASIBILITYPUMP_ALWAYS` Constant used in enumeration 'FEASIBILITYPUMP'
`static int`	`FEASIBILITYPUMP_AUTOMATIC` Constant used in enumeration 'FEASIBILITYPUMP'
`static int`	`FEASIBILITYPUMP_LASTRESORT` Constant used in enumeration 'FEASIBILITYPUMP'
`static int`	`FEASIBILITYPUMP_NEVER` Constant used in enumeration 'FEASIBILITYPUMP'
`static int`	`FEASTOL` This tolerance determines when a solution is treated as feasible.
`static int`	`FEASTOLPERTURB` This tolerance determines how much a feasible primal basic solution is allowed to be perturbed when performing basis changes.
`static int`	`FEASTOLTARGET` This specifies the target feasibility tolerance for the solution refiner.
`static int`	`FORCEOUTPUT` Certain names in the problem object may be incompatible with different file formats (such as names containing spaces for LP files).
`static int`	`FORCEPARALLELDUAL` Dual simplex: specifies whether the dual simplex solver should always use the parallel simplex algorithm.
`static int`	`GENCONCOLS` Number of input variables in general constraints in the problem.
`static int`	`GENCONS` Number of general constraints in the problem.
`static int`	`GENCONS_ABS` Constant used in enumeration 'GENCONSTYPE'
`static int`	`GENCONS_AND` Constant used in enumeration 'GENCONSTYPE'
`static int`	`GENCONS_MAX` Constant used in enumeration 'GENCONSTYPE'
`static int`	`GENCONS_MIN` Constant used in enumeration 'GENCONSTYPE'
`static int`	`GENCONS_OR` Constant used in enumeration 'GENCONSTYPE'
`static int`	`GENCONSABSTRANSFORMATION` This control specifies the reformulation method for absolute value general constraints at the beginning of the search.
`static int`	`GENCONSDUALREDUCTIONS` This parameter specifies whether dual reductions should be applied to reduce the number of columns and rows added when transforming general constraints to MIP structs.
`static int`	`GENCONVALS` Number of constant values in general constraints in the problem.
`static int`	`GLOBALFILEBIAS` Deprecated.
`static int`	`GLOBALFILELOGINTERVAL` This control sets the interval between progress messages output while writing tree data to the global file, in seconds.
`static int`	`GLOBALFILESIZE` The allocated size of the global file, in megabytes.
`static int`	`GLOBALFILEUSAGE` The number of megabytes of data from the branch-and-bound tree that have been saved to the global file.
`static int`	`GOMCUTS` Branch and Bound: The number of rounds of Gomory or lift-and-project cuts at the top node.
`static int`	`HEURBEFORELP` Branch and Bound: Determines whether primal heuristics should be run before the initial LP relaxation has been solved.
`static int`	`HEURDEPTH` Branch and Bound: Sets the maximum depth in the tree search at which heuristics will be used to find MIP solutions.
`static int`	`HEURDIVEITERLIMIT` Branch and Bound: Simplex iteration limit for reoptimizing during the diving heuristic.
`static int`	`HEURDIVERANDOMIZE` The level of randomization to apply in the diving heuristic.
`static int`	`HEURDIVESOFTROUNDING` Branch and Bound: Enables a more cautious strategy for the diving heuristic, where it tries to push binaries and integer variables to their bounds using the objective, instead of directly fixing them.
`static int`	`HEURDIVESPEEDUP` Branch and Bound: Changes the emphasis of the diving heuristic from solution quality to diving speed.
`static int`	`HEURDIVESTRATEGY` Branch and Bound: Chooses the strategy for the diving heuristic.
`static int`	`HEUREMPHASIS` Branch and Bound: This control specifies an emphasis for the search w.r.t.
`static int`	`HEURFORCESPECIALOBJ` Branch and Bound: This specifies whether local search heuristics without objective or with an auxiliary objective should always be used, despite the automatic selection of the Optimiezr.
`static int`	`HEURFREQ` Branch and Bound: This specifies the frequency at which heuristics are used in the tree search.
`static int`	`HEURMAXSOL` Branch and Bound: This specifies the maximum number of heuristic solutions that will be found in the tree search.
`static int`	`HEURNODES` Branch and Bound: This specifies the maximum number of nodes at which heuristics are used in the tree search.
`static int`	`HEURSEARCH_LOCAL_SEARCH_LARGE_NEIGHBOURHOOD` Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCH_LOCAL_SEARCH_NODE_NEIGHBOURHOOD` Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCH_LOCAL_SEARCH_SOLUTION_NEIGHBOURHOOD` Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCHEFFORT` Adjusts the overall level of the local search heuristics.
`static int`	`HEURSEARCHFREQ` Branch and Bound: This specifies how often the local search heuristic should be run in the tree.
`static int`	`HEURSEARCHROOTCUTFREQ` How frequently to run the local search heuristic during root cutting.
`static int`	`HEURSEARCHROOTSELECT` A bit vector control for selecting which local search heuristics to apply on the root node of a global solve.
`static int`	`HEURSEARCHTARGETSIZE` Control of type Double.
`static int`	`HEURSEARCHTREESELECT` A bit vector control for selecting which local search heuristics to apply during the tree search of a global solve.
`static int`	`HEURSELECT` Control of type Integer.
`static int`	`HEURSTRATEGY` Deprecated. Values are from enumeration 'HEURSTRATEGY'
`static int`	`HEURSTRATEGY_AUTOMATIC` Constant used in enumeration 'HEURSTRATEGY'
`static int`	`HEURSTRATEGY_BASIC` Constant used in enumeration 'HEURSTRATEGY'
`static int`	`HEURSTRATEGY_ENHANCED` Constant used in enumeration 'HEURSTRATEGY'
`static int`	`HEURSTRATEGY_EXTENSIVE` Constant used in enumeration 'HEURSTRATEGY'
`static int`	`HEURSTRATEGY_NONE` Constant used in enumeration 'HEURSTRATEGY'
`static int`	`HEURTHREADS` Branch and Bound: The number of threads to dedicate to running heuristics on the root node.
`static int`	`HISTORYCOSTS` Branch and Bound: How to update the pseudo cost for a global entity when a strong branch or a regular branch is applied.
`static int`	`IFCHECKCONVEXITY` Determines if the convexity of the problem is checked before optimization.
`static int`	`IGNORECONTAINERCPULIMIT` Control of type Integer.
`static int`	`IGNORECONTAINERMEMORYLIMIT` Control of type Integer.
`static int`	`INDICATORS` Number of indicator constrains in the problem.
`static int`	`INDLINBIGM` During presolve, indicator constraints will be linearized using a BigM coefficient whenever that BigM coefficient is small enough.
`static int`	`INDPRELINBIGM` During presolve, indicator constraints will be linearized using a BigM coefficient whenever that BigM coefficient is small enough.
`static int`	`INPUTTOL` The tolerance on input values elements.
`static int`	`INVERTFREQ` Simplex: The frequency with which the basis will be inverted.
`static int`	`INVERTMIN` Simplex: The minimum number of iterations between full inversions of the basis matrix.
`static int`	`IOTIMEOUT` The maximum number of seconds to wait for an I/O operation before it is cancelled.
`static int`	`ISREPROCESSEDUSERSOLUTION` Bit field flag 'IsReprocessedUserSolution' for MipSolPool Solution
`static int`	`ISUSERSOLUTION` Bit field flag 'IsUserSolution' for MipSolPool Solution
`static java.lang.String`	`JAVAXPRS_VERSION`
`static int`	`KEEPBASIS` Simplex: This determines which basis to use for the next iteration.
`static int`	`KEEPNROWS` How nonbinding rows should be handled by the MPS reader.
`static int`	`L1CACHE` Newton barrier: L1 cache size in kB (kilo bytes) of the CPU.
`static int`	`LINELENGTH` Deprecated.
`static int`	`LNPBEST` Number of infeasible global entities to create lift-and-project cuts for during each round of Gomory cuts at the top node (see `GOMCUTS`).
`static int`	`LNPITERLIMIT` Number of iterations to perform in improving each lift-and-project cut.
`static int`	`LOCALBACKTRACK` Control of type Integer.
`static int`	`LOCALCHOICE` Controls when to perform a local backtrack between the two child nodes during a dive in the branch and bound tree.
`static int`	`LP_CUTOFF` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_CUTOFF_IN_DUAL` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_INFEAS` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_NONCONVEX` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_OPTIMAL` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_UNBOUNDED` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_UNFINISHED` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_UNSOLVED` Constant used in enumeration 'LPSTATUS'
`static int`	`LP_UNSTARTED` Constant used in enumeration 'LPSTATUS'
`static int`	`LPFLAGS` A bit-vector control which defines the algorithm for solving an LP problem or the initial LP relaxation of a MIP problem.
`static int`	`LPFLAGS_BARRIER` Constant used in enumeration 'LPFLAGS'
`static int`	`LPFLAGS_DUAL` Constant used in enumeration 'LPFLAGS'
`static int`	`LPFLAGS_NETWORK` Constant used in enumeration 'LPFLAGS'
`static int`	`LPFLAGS_PRIMAL` Constant used in enumeration 'LPFLAGS'
`static int`	`LPFOLDING` Simplex and barrier: whether to fold an LP problem before solving it.
`static int`	`LPITERLIMIT` The maximum number of iterations that will be performed by primal simplex or dual simplex before the optimization process terminates.
`static int`	`LPLOG` Simplex: The frequency at which the simplex log is printed.
`static int`	`LPLOGDELAY` Time interval between two LP log lines.
`static int`	`LPLOGSTYLE` Simplex: The style of the simplex log.
`static int`	`LPOBJVAL` Value of the objective function of the last LP solved.
`static int`	`LPREFINEITERLIMIT` This specifies the simplex iteration limit the solution refiner can spend in attempting to increase the accuracy of an LP solution.
`static int`	`LPSTATUS` LP solution status.
`static int`	`LPTHREADS` Deprecated.
`static int`	`LUPIVOTTOL` Control of type Double.
`static int`	`MARKOWITZTOL` The Markowitz tolerance used for the factorization of the basis matrix.
`static int`	`MATRIXNAME` The matrix name.
`static int`	`MATRIXTOL` The zero tolerance on matrix elements.
`static int`	`MAXABSDUALINFEAS` Maximum calculated absolute dual infeasibility in the unscaled original problem.
`static int`	`MAXABSPRIMALINFEAS` Maximum calculated absolute primal infeasibility in the unscaled original problem.
`static int`	`MAXCHECKSONMAXCUTTIME` This control is intended for use where optimization runs that are terminated using the `MAXCUTTIME` control are required to be reproduced exactly.
`static int`	`MAXCHECKSONMAXTIME` This control is intended for use where optimization runs that are terminated using the `MAXTIME` control are required to be reproduced exactly.
`static int`	`MAXCUTTIME` The maximum amount of time allowed for generation of cutting planes and reoptimization.
`static int`	`MAXGLOBALFILESIZE` The maximum size, in megabytes, to which the global file may grow, or 0 for no limit.
`static int`	`MAXIIS` This function controls the number of Irreducible Infeasible Sets to be found using the `XPRSiisall` ( `IIS` `-a`).
`static int`	`MAXIMPLIEDBOUND` Presolve: When tighter bounds are calculated during MIP preprocessing, only bounds whose absolute value are smaller than `MAXIMPLIEDBOUND` will be applied to the problem.
`static int`	`MAXINT` Deprecated. Use `Integer.MAX_VALUE` instead.
`static int`	`MAXKAPPA` Largest basis condition number (also known as kappa) calculated through all nodes sampled by `MIPKAPPAFREQ`.
`static int`	`MAXLOCALBACKTRACK` Branch-and-Bound: How far back up the current dive path the optimizer is allowed to look for a local backtrack candidate node.
`static int`	`MAXMCOEFFBUFFERELEMS` The maximum number of matrix coefficients to buffer before flushing into the internal representation of the problem.
`static int`	`MAXMEMORYHARD` This control sets the maximum amount of memory in megabytes the optimizer should allocate.
`static int`	`MAXMEMORYSOFT` When `RESOURCESTRATEGY` is enabled, this control sets the maximum amount of memory in megabytes the optimizer targets to allocate.
`static int`	`MAXMIPINFEAS` Maximum integer fractionality in the solution.
`static int`	`MAXMIPSOL` Branch and Bound: This specifies a limit on the number of integer solutions to be found by the Optimizer.
`static int`	`MAXMIPTASKS` Branch-and-Bound: The maximum number of tasks to run in parallel during a MIP solve.
`static int`	`MAXNODE` Branch and Bound: The maximum number of nodes that will be explored.
`static int`	`MAXPAGELINES` Number of lines between page breaks in printable output.
`static int`	`MAXPROBNAMELENGTH` Maximum size of the problem name and also the maximum allowed length of the file or path string for any function that accepts such an argument.
`static int`	`MAXRELDUALINFEAS` Maximum calculated relative dual infeasibility in the unscaled original problem.
`static int`	`MAXRELPRIMALINFEAS` Maximum calculated relative primal infeasibility in the unscaled original problem.
`static int`	`MAXSCALEFACTOR` This determines the maximum scaling factor that can be applied during scaling.
`static int`	`MAXSTALLTIME` The maximum time in seconds that the Optimizer will continue to search for improving solution after finding a new incumbent.
`static int`	`MAXTIME` The maximum time in seconds that the Optimizer will run before it terminates, including the problem setup time and solution time.
`static double`	`MINUSINFINITY`
`static int`	`MIP_INFEAS` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIP_LP_NOT_OPTIMAL` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIP_LP_OPTIMAL` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIP_NO_SOL_FOUND` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIP_NOT_LOADED` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIP_OPTIMAL` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIP_SOLUTION` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIP_UNBOUNDED` Constant used in enumeration 'MIPSTATUS'
`static int`	`MIPABSCUTOFF` Branch and Bound: If the user knows that they are interested only in values of the objective function which are better than some value, this can be assigned to `MIPABSCUTOFF`.
`static int`	`MIPABSGAPNOTIFY` Branch and bound: if the `gapnotify` callback has been set using `XPRSaddcbgapnotify`, then this callback will be triggered during the global search when the absolute gap reaches or passes the value you set of the `MIPRELGAPNOTIFY` control.
`static int`	`MIPABSGAPNOTIFYBOUND` Branch and bound: if the `gapnotify` callback has been set using `XPRSaddcbgapnotify`, then this callback will be triggered during the global search when the best bound reaches or passes the value you set of the `MIPRELGAPNOTIFYBOUND` control.
`static int`	`MIPABSGAPNOTIFYOBJ` Branch and bound: if the `gapnotify` callback has been set using `XPRSaddcbgapnotify`, then this callback will be triggered during the global search when the best solution value reaches or passes the value you set of the `MIPRELGAPNOTIFYOBJ` control.
`static int`	`MIPABSSTOP` Branch and Bound: The absolute tolerance determining whether the global search will continue or not.
`static int`	`MIPADDCUTOFF` Branch and Bound: The amount to add to the objective function of the best integer solution found to give the new `CURRMIPCUTOFF`.
`static int`	`MIPBESTOBJVAL` Objective function value of the best integer solution found.
`static int`	`MIPCOMPONENTS` Determines whether disconnected components in a MIP should be solved as separate MIPs.
`static int`	`MIPCONCURRENTNODES` Sets the node limit for when a winning solve is selected when concurrent MIP solves are enabled.
`static int`	`MIPCONCURRENTSOLVES` Selects the number of concurrent solves to start for a MIP.
`static int`	`MIPDUALREDUCTIONS` Branch and Bound: Limits operations that can reduce the MIP solution space.
`static int`	`MIPENTS` Number of global entities (i.e.
`static int`	`MIPFRACREDUCE` Branch and Bound: Specifies how often the optimizer should run a heuristic to reduce the number of fractional integer variables in the node LP solutions.
`static int`	`MIPINFEAS` Number of integer infeasibilities, including violations of special ordered sets, at the current node.
`static int`	`MIPKAPPAFREQ` Branch and Bound: Specifies how frequently the basis condition number (also known as kappa) should be calculated during the branch-and-bound search.
`static int`	`MIPLOG` Global print control.
`static int`	`MIPOBJVAL` Objective function value of the last integer solution found.
`static int`	`MIPPRESOLVE` Branch and Bound: Type of integer processing to be performed.
`static int`	`MIPPRESOLVE_ALLOW_CHANGE_BOUNDS` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_ALLOW_TREE_RESTART` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_DUAL_REDUCTIONS` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_GLOBAL_COEFFICIENT_TIGHTENING` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_LOGIC_PREPROCESSING` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_OBJECTIVE_BASED_REDUCTIONS` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_REDUCED_COST_FIXING` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_SYMMETRY_REDUCTIONS` Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPRAMPUP` Controls the strategy used by the parallel MIP solver during the ramp-up phase of a branch-and-bound tree search.
`static int`	`MIPREFINEITERLIMIT` This defines an effort limit expressed as simplex iterations for the MIP solution refiner.
`static int`	`MIPRELCUTOFF` Branch and Bound: Percentage of the LP solution value to be added to the value of the objective function when an integer solution is found, to give the new value of `CURRMIPCUTOFF`.
`static int`	`MIPRELGAPNOTIFY` Branch and bound: if the `gapnotify` callback has been set using `XPRSaddcbgapnotify`, then this callback will be triggered during the global search when the relative gap reaches or passes the value you set of the `MIPRELGAPNOTIFY` control.
`static int`	`MIPRELSTOP` Branch and Bound: This determines when the global search will terminate.
`static int`	`MIPRESTART` Branch and Bound: controls strategy for in-tree restarts.
`static int`	`MIPRESTART_AGGRESSIVE` Constant used in enumeration 'MIPRESTART'
`static int`	`MIPRESTART_DEFAULT` Constant used in enumeration 'MIPRESTART'
`static int`	`MIPRESTART_MODERATE` Constant used in enumeration 'MIPRESTART'
`static int`	`MIPRESTART_OFF` Constant used in enumeration 'MIPRESTART'
`static int`	`MIPRESTARTFACTOR` Branch and Bound: Fine tune initial conditions to trigger an in-tree restart.
`static int`	`MIPRESTARTGAPTHRESHOLD` Branch and Bound: Initial gap threshold to delay in-tree restart.
`static int`	`MIPSOLNODE` Node at which the last integer feasible solution was found.
`static int`	`MIPSOLS` Number of integer solutions that have been found.
`static int`	`MIPSOLTIME` Time at which the last integer feasible solution was found.
`static int`	`MIPSTATUS` Global (MIP) solution status.
`static int`	`MIPTERMINATIONMETHOD` Branch and Bound: How a MIP solve should be stopped on early termination when there are still active tasks in the system.
`static int`	`MIPTHREADID` The ID for the MIP thread.
`static int`	`MIPTHREADS` If set to a positive integer it determines the number of threads implemented to run the parallel MIP code.
`static int`	`MIPTOL` Branch and Bound: This is the tolerance within which a decision variable's value is considered to be integral.
`static int`	`MIPTOLTARGET` Target MIPTOL value used by the automatic MIP solution refiner as defined by `REFINEOPS`.
`static int`	`MIQCPALG` This control determines which algorithm is to be used to solve mixed integer quadratic constrained and mixed integer second order cone problems.
`static int`	`MPS18COMPATIBLE` Provides compatibility of MPS file output for older MPS readers.
`static int`	`MPSBOUNDNAME` The bound name sought in the MPS file.
`static int`	`MPSECHO` Determines whether comments in MPS matrix files are to be printed out during matrix input.
`static int`	`MPSFORMAT` Specifies the format of MPS files.
`static int`	`MPSNAMELENGTH` Control of type Integer.
`static int`	`MPSOBJNAME` The objective function name sought in the MPS file.
`static int`	`MPSRANGENAME` The range name sought in the MPS file.
`static int`	`MPSRHSNAME` The right hand side name sought in the MPS file.
`static int`	`MSE_CALLBACKCULLSOLS_DIVERSITY` Control of type Integer.
`static int`	`MSE_CALLBACKCULLSOLS_MIPOBJECT` Control of type Integer.
`static int`	`MSE_CALLBACKCULLSOLS_MODOBJECT` Control of type Integer.
`static int`	`MSE_DIVERSITYSUM` Attribute of type Double.
`static int`	`MSE_METRIC_DIVERSITY` Attribute of type Integer.
`static int`	`MSE_METRIC_MIPOBJECT` Attribute of type Integer.
`static int`	`MSE_METRIC_MODOBJECT` Attribute of type Integer.
`static int`	`MSE_OPTIMIZEDIVERSITY` Control of type Integer.
`static int`	`MSE_OUTPUTLOG` Control of type Integer.
`static int`	`MSE_OUTPUTTOL` Control of type Double.
`static int`	`MSE_SOLUTIONS` Attribute of type Integer.
`static int`	`MSP_DEFAULTUSERSOLFEASTOL` Control of type Double.
`static int`	`MSP_DEFAULTUSERSOLMIPTOL` Control of type Double.
`static int`	`MSP_DUPLICATESOLUTIONSPOLICY` Control of type Integer.
`static int`	`MSP_ENABLESLACKSTORAGE` Control of type Integer.
`static int`	`MSP_INCLUDEPROBNAMEINLOGGING` Control of type Integer.
`static int`	`MSP_OUTPUTLOG` Control of type Integer.
`static int`	`MSP_PRB_FEASIBLESOLS` Attribute of type Integer.
`static int`	`MSP_PRB_VALIDSOLS` Attribute of type Integer.
`static int`	`MSP_SOL_BITFIELDSSYS` Attribute of type Integer.
`static int`	`MSP_SOL_BITFIELDSUSR` Control of type Integer.
`static int`	`MSP_SOL_COLS` Attribute of type Integer.
`static int`	`MSP_SOL_FEASTOL` Control of type Double.
`static int`	`MSP_SOL_ISREPROCESSEDUSERSOLUTION` Attribute of type Integer.
`static int`	`MSP_SOL_ISUSERSOLUTION` Attribute of type Integer.
`static int`	`MSP_SOL_MIPTOL` Control of type Double.
`static int`	`MSP_SOL_NONZEROS` Attribute of type Integer.
`static int`	`MSP_SOLPRB_INFCNT_MIP` Attribute of type Integer.
`static int`	`MSP_SOLPRB_INFCNT_PRIMAL` Attribute of type Integer.
`static int`	`MSP_SOLPRB_INFEASCOUNT` Attribute of type Integer.
`static int`	`MSP_SOLPRB_INFSUM_MIP` Attribute of type Double.
`static int`	`MSP_SOLPRB_INFSUM_PRIMAL` Attribute of type Double.
`static int`	`MSP_SOLPRB_OBJ` Attribute of type Double.
`static int`	`MSP_SOLUTIONS` Attribute of type Integer.
`static int`	`MSP_WRITESLXSOLLOGGING` Control of type Integer.
`static int`	`MUTEXCALLBACKS` Branch and Bound: This determines whether the callback routines are mutexed from within the optimizer.
`static int`	`N_BNDNAM`
`static int`	`NAMELENGTH` The length (in 8 character units) of row and column names in the matrix.
`static int`	`NETCUTS` Determines the addition of multi-commodity network cuts to a problem.
`static int`	`NETSTALLLIMIT` Limit the number of degenerate pivots of the network simplex algorithm, before switching to either primal or dual simplex, depending on `ALGAFTERNETWORK`.
`static int`	`NODEDEPTH` Depth of the current node.
`static int`	`NODEPROBINGEFFORT` Adjusts the overall level of node probing.
`static int`	`NODES` Number of nodes solved so far in the global search.
`static int`	`NODESELECTION` Branch and Bound: This determines which nodes will be considered for solution once the current node has been solved.
`static int`	`NODESELECTION_BEST_FIRST` Constant used in enumeration 'NODESELECTION'
`static int`	`NODESELECTION_BEST_FIRST_THEN_LOCAL_FIRST` Constant used in enumeration 'NODESELECTION'
`static int`	`NODESELECTION_DEPTH_FIRST` Constant used in enumeration 'NODESELECTION'
`static int`	`NODESELECTION_LOCAL_DEPTH_FIRST` Constant used in enumeration 'NODESELECTION'
`static int`	`NODESELECTION_LOCAL_FIRST` Constant used in enumeration 'NODESELECTION'
`static int`	`NUMIIS` Number of IISs found.
`static int`	`OBJ_MAXIMIZE` Constant used in enumeration 'enum_obj_sense'
`static int`	`OBJ_MINIMIZE` Constant used in enumeration 'enum_obj_sense'
`static int`	`OBJNAME` Active objective function row name.
`static int`	`OBJRHS` Fixed part of the objective function.
`static int`	`OBJSCALEFACTOR` Custom global objective scaling factor, expressed as a power of 2.
`static int`	`OBJSENSE` Sense of the optimization being performed.
`static int`	`OPTIMALITYTOL` Simplex: This is the zero tolerance for reduced costs.
`static int`	`OPTIMALITYTOLTARGET` This specifies the target optimality tolerance for the solution refiner.
`static int`	`ORIGINALCOLS` Number of columns (i.e.
`static int`	`ORIGINALGENCONCOLS` Number of input variables in general constraints in the original problem before presolving.
`static int`	`ORIGINALGENCONS` Number of general constraints in the original problem before presolving.
`static int`	`ORIGINALGENCONVALS` Number of constant values in general constraints in the original problem before presolving.
`static int`	`ORIGINALINDICATORS` Number of indicator constraints in the original matrix before presolving.
`static int`	`ORIGINALMIPENTS` Number of global entities (i.e.
`static int`	`ORIGINALPWLPOINTS` Number of breakpoints of piecewise linear constraints in the original problem before presolving.
`static int`	`ORIGINALPWLS` Number of piecewise linear constraints in the original problem before presolving.
`static int`	`ORIGINALQCELEMS` Number of quadratic row coefficients in the original matrix before presolving.
`static int`	`ORIGINALQCONSTRAINTS` Number of rows with quadratic coefficients in the original matrix before presolving.
`static int`	`ORIGINALQELEMS` Number of quadratic elements in the original matrix before presolving.
`static int`	`ORIGINALROWS` Number of rows (i.e.
`static int`	`ORIGINALSETMEMBERS` Number of variables within special ordered sets (set members) in the original matrix before presolving.
`static int`	`ORIGINALSETS` Number of special ordered sets in the original matrix before presolving.
`static int`	`OUTPUTCONTROLS` This control toggles the printing of all control settings at the beginning of the search.
`static int`	`OUTPUTLOG` This controls the level of output produced by the Optimizer during optimization.
`static int`	`OUTPUTLOG_ERRORS` Constant used in enumeration 'OUTPUTLOG'
`static int`	`OUTPUTLOG_ERRORS_AND_WARNINGS` Constant used in enumeration 'OUTPUTLOG'
`static int`	`OUTPUTLOG_FULL_OUTPUT` Constant used in enumeration 'OUTPUTLOG'
`static int`	`OUTPUTLOG_NO_OUTPUT` Constant used in enumeration 'OUTPUTLOG'
`static int`	`OUTPUTMASK` Mask to restrict the row and column names written to file.
`static int`	`OUTPUTTOL` Zero tolerance on print values.
`static int`	`PARENTNODE` The parent node of the current node in the tree search.
`static int`	`PEAKMEMORY` An estimate of the peak amount of dynamically allocated heap memory by the problem.
`static int`	`PEAKTOTALTREEMEMORYUSAGE` The peak size, in megabytes, that the branch-and-bound search tree reached during the solve.
`static int`	`PENALTY` Minimum absolute penalty variable coefficient.
`static int`	`PENALTYVALUE` The weighted sum of violations in the solution to the relaxed problem identified by the infeasibility repair function.
`static int`	`PERTURB` Deprecated.
`static int`	`PHYSICALCORESDETECTED` The total number of physical cores across all CPUs detected by the optimizer.
`static int`	`PHYSICALCORESPERCPUDETECTED` The number of physical cores per CPU detected by the optimizer.
`static int`	`PIVOTTOL` Simplex: The zero tolerance for matrix elements.
`static double`	`PLUSINFINITY`
`static int`	`PPFACTOR` The partial pricing candidate list sizing parameter.
`static int`	`PREANALYTICCENTER` Determines if analytic centers should be computed and used for variable fixing and the generation of alternative reduced costs (-1: Auto 0: Off, 1: Fixing, 2: Redcost, 3: Both)
`static int`	`PREBASISRED` Determines if a lattice basis reduction algorithm should be attempted as part of presolve
`static int`	`PREBNDREDCONE` Determines if second order cone constraints should be used for inferring bound reductions on variables when solving a MIP.
`static int`	`PREBNDREDQUAD` Determines if convex quadratic contraints should be used for inferring bound reductions on variables when solving a MIP.
`static int`	`PRECLIQUESTRATEGY` Determines how much effort to spend on clique covers in presolve.
`static int`	`PRECOEFELIM` Presolve: Specifies whether the optimizer should attempt to recombine constraints in order to reduce the number of non zero coefficients when presolving a mixed integer problem.
`static int`	`PRECOEFELIM_AGGRESSIVE` Constant used in enumeration 'PRECOEFELIM'
`static int`	`PRECOEFELIM_CAUTIOUS` Constant used in enumeration 'PRECOEFELIM'
`static int`	`PRECOEFELIM_DISABLED` Constant used in enumeration 'PRECOEFELIM'
`static int`	`PRECOMPONENTS` Presolve: determines whether small independent components should be detected and solved as individual subproblems during root node processing.
`static int`	`PRECOMPONENTSEFFORT` Presolve: adjusts the overall effort for the independent component presolver.
`static int`	`PRECONEDECOMP` Presolve: decompose regular and rotated cones with more than two elements and apply Outer Approximation on the resulting components.
`static int`	`PRECONVERTSEPARABLE` Presolve: reformulate problem with non-diagonal quadratic objective and/or constraints as diagonal quadratic or second-order conic constraints.
`static int`	`PREDICTEDATTLEVEL` A measure between 0 and 1 to predict how numerically unstable the current MIP solve can be expected to be.
`static int`	`PREDOMCOL` Presolve: Determines the level of dominated column removal reductions to perform when presolving a mixed integer problem.
`static int`	`PREDOMCOL_AGGRESSIVE` Constant used in enumeration 'PREDOMCOL'
`static int`	`PREDOMCOL_AUTOMATIC` Constant used in enumeration 'PREDOMCOL'
`static int`	`PREDOMCOL_CAUTIOUS` Constant used in enumeration 'PREDOMCOL'
`static int`	`PREDOMCOL_DISABLED` Constant used in enumeration 'PREDOMCOL'
`static int`	`PREDOMROW` Presolve: Determines the level of dominated row removal reductions to perform when presolving a problem.
`static int`	`PREDOMROW_AGGRESSIVE` Constant used in enumeration 'PREDOMROW'
`static int`	`PREDOMROW_AUTOMATIC` Constant used in enumeration 'PREDOMROW'
`static int`	`PREDOMROW_CAUTIOUS` Constant used in enumeration 'PREDOMROW'
`static int`	`PREDOMROW_DISABLED` Constant used in enumeration 'PREDOMROW'
`static int`	`PREDOMROW_MEDIUM` Constant used in enumeration 'PREDOMROW'
`static int`	`PREDUPROW` Presolve: Determines the type of duplicate rows to look for and eliminate when presolving a problem.
`static int`	`PREELIMQUAD` Presolve: Allows for elimination of quadratic variables via doubleton rows.
`static int`	`PREFOLDING` Presolve: Determines if a folding procedure should be used to aggregate continuous columns in an equitable partition.
`static int`	`PREIMPLICATIONS` Presolve: Determines whether to use implication structures to remove redundant rows.
`static int`	`PRELINDEP` Presolve: Determines whether to check for and remove linearly dependent equality constraints when presolving a problem.
`static int`	`PREOBJCUTDETECT` Presolve: Determines whether to check for constraints that are parallel or near parallel to a linear objective function, and which can safely be removed.
`static int`	`PREPERMUTE` This bit vector control specifies whether to randomly permute rows, columns and global information when starting the presolve.
`static int`	`PREPERMUTESEED` This control sets the seed for the pseudo-random number generator for permuting the problem when starting the presolve.
`static int`	`PREPROBING` Presolve: Amount of probing to perform on binary variables during presolve.
`static int`	`PREPROBING_AUTOMATIC` Constant used in enumeration 'PREPROBING'
`static int`	`PREPROBING_DISABLED` Constant used in enumeration 'PREPROBING'
`static int`	`PREPROBING_FULL` Constant used in enumeration 'PREPROBING'
`static int`	`PREPROBING_FULL_AND_REPEAT` Constant used in enumeration 'PREPROBING'
`static int`	`PREPROBING_LIGHT` Constant used in enumeration 'PREPROBING'
`static int`	`PREPROTECTDUAL` Presolve: specifies whether the presolver should protect a given dual solution by maintaining the same level of dual feasibility.
`static int`	`PRESOLVE` This control determines whether presolving should be performed prior to starting the main algorithm.
`static int`	`PRESOLVE_DEFAULT` Constant used in enumeration 'PRESOLVE'
`static int`	`PRESOLVE_KEEPREDUNDANTBOUNDS` Constant used in enumeration 'PRESOLVE'
`static int`	`PRESOLVE_NONE` Constant used in enumeration 'PRESOLVE'
`static int`	`PRESOLVE_NOPRIMALINFEASIBILITY` Constant used in enumeration 'PRESOLVE'
`static int`	`PRESOLVEINDEX` Presolve: The row or column index on which presolve detected a problem to be infeasible or unbounded.
`static int`	`PRESOLVEMAXGROW` Limit on how much the number of non-zero coefficients is allowed to grow during presolve, specified as a ratio of the number of non-zero coefficients in the original problem.
`static int`	`PRESOLVEOPS` This bit vector control specifies the operations which are performed during the presolve.
`static int`	`PRESOLVEOPS_DUALREDUCTIONS` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_DUPLICATECOLUMNREMOVAL` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_DUPLICATEROWREMOVAL` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_FORCINGROWREMOVAL` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_LINEARLYDEPENDANTROWREMOVAL` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NOADVANCEDIPREDUCTIONS` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NODUALREDONGLOBALS` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NOGLOBALDOMAINCHANGE` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NOINTEGERVARIABLEANDSOSDETECTION` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NOIPREDUCTIONS` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_REDUNDANTROWREMOVAL` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_SINGLETONCOLUMNREMOVAL` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_SINGLETONROWREMOVAL` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_STRONGDUALREDUCTIONS` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_VARIABLEELIMINATIONS` Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEPASSES` Number of reduction rounds to be performed in presolve
`static int`	`PRESOLVESTATE` Problem status as a bit map.
`static int`	`PRESOLVESTATE_PROBLEMLOADED` Constant used in enumeration 'PRESOLVESTATE'
`static int`	`PRESOLVESTATE_PROBLEMLPPRESOLVED` Constant used in enumeration 'PRESOLVESTATE'
`static int`	`PRESOLVESTATE_PROBLEMMIPPRESOLVED` Constant used in enumeration 'PRESOLVESTATE'
`static int`	`PRESOLVESTATE_SOLUTIONVALID` Constant used in enumeration 'PRESOLVESTATE'
`static int`	`PRESORT` This bit vector control specifies whether to sort rows, columns and global information by their names when starting the presolve.
`static int`	`PRICING_DEFAULT` Constant used in enumeration 'PRICING'
`static int`	`PRICING_DEVEX` Constant used in enumeration 'PRICING'
`static int`	`PRICING_PARTIAL` Constant used in enumeration 'PRICING'
`static int`	`PRICINGALG` Simplex: This determines the primal simplex pricing method.
`static int`	`PRIMALDUALINTEGRAL` Value of the primal-dual integral.
`static int`	`PRIMALINFEAS` Number of primal infeasibilities.
`static int`	`PRIMALPERTURB` The factor by which the problem will be perturbed prior to optimization by primal simplex.
`static int`	`PRIMALUNSHIFT` Determines whether primal is allowed to call dual to unshift.
`static int`	`PRIMALUNSHIFT_ALLOW_DUAL_UNSHIFT` Constant used in enumeration 'PRIMALUNSHIFT'
`static int`	`PRIMALUNSHIFT_NO_DUAL_UNSHIFT` Constant used in enumeration 'PRIMALUNSHIFT'
`static int`	`PSEUDOCOST` Branch and Bound: The default pseudo cost used in estimation of the degradation associated with an unexplored node in the tree search.
`static int`	`PWLCONS` Number of piecewise linear constraints in the problem.
`static int`	`PWLDUALREDUCTIONS` This parameter specifies whether dual reductions should be applied to reduce the number of columns, rows and SOS-constraints added when transforming piecewise linear objectives and constraints to MIP structs.
`static int`	`PWLNONCONVEXTRANSFORMATION` This control specifies the reformulation method for piecewise linear constraints at the beginning of the search.
`static int`	`PWLPOINTS` Number of breakpoints of piecewise linear constraints in the problem.
`static int`	`QCCUTS` Branch and Bound: Limit on the number of rounds of outer approximation cuts generated for the root node, when solving a mixed integer quadratic constrained or mixed integer second order conic problem with outer approximation.
`static int`	`QCELEMS` Number of quadratic row coefficients in the matrix.
`static int`	`QCONSTRAINTS` Number of rows with quadratic coefficients in the matrix.
`static int`	`QCONVEXITY_CONECONVERTABLE` Constant used in enumeration 'QCONVEXITY'
`static int`	`QCONVEXITY_CONVEX` Constant used in enumeration 'QCONVEXITY'
`static int`	`QCONVEXITY_CONVEXCONE` Constant used in enumeration 'QCONVEXITY'
`static int`	`QCONVEXITY_NONCONVEX` Constant used in enumeration 'QCONVEXITY'
`static int`	`QCONVEXITY_REPAIRABLE` Constant used in enumeration 'QCONVEXITY'
`static int`	`QCONVEXITY_UNKNOWN` Constant used in enumeration 'QCONVEXITY'
`static int`	`QCROOTALG` This control determines which algorithm is to be used to solve the root of a mixed integer quadratic constrained or mixed integer second order cone problem, when outer approximation is used.
`static int`	`QELEMS` Number of quadratic elements in the matrix.
`static int`	`QSIMPLEXOPS` Controls the behavior of the quadratic simplex solvers.
`static int`	`QUADRATICUNSHIFT` Determines whether an extra solution purification step is called after a solution found by the quadratic simplex (either primal or dual).
`static int`	`RANDOMSEED` Sets the initial seed to use for the pseudo-random number generator in the Optimizer.
`static int`	`RANGENAME` Active range name.
`static int`	`REFACTOR` Indicates whether the optimization should restart using the current representation of the factorization in memory.
`static int`	`REFINEOPS` This specifies when the solution refiner should be executed to reduce solution infeasibilities.
`static int`	`REFINEOPS_ITERATIVEREFINER` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_LPOPTIMAL` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_LPPRESOLVE` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_MIPFIXGLOBALS` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_MIPFIXGLOBALSTARGET` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_MIPNODELP` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_MIPOPTIMAL` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_MIPSOLUTION` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_REFINERPRECISION` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_REFINERUSEDUAL` Constant used in enumeration 'REFINEOPS'
`static int`	`REFINEOPS_REFINERUSEPRIMAL` Constant used in enumeration 'REFINEOPS'
`static int`	`RELAXTREEMEMORYLIMIT` When the memory used by the branch and bound search tree exceeds the target specified by the `TREEMEMORYLIMIT` control, the optimizer will try to reduce this by writing nodes to the global file.
`static int`	`RELPIVOTTOL` Simplex: At each iteration a pivot element is chosen within a given column of the matrix.
`static int`	`REPAIRINDEFINITEQ` Controls if the optimizer should make indefinite quadratic matrices positive definite when it is possible.
`static int`	`REPAIRINDEFINITEQ_NO_REPAIR` Constant used in enumeration 'REPAIRINDEFINITEQ'
`static int`	`REPAIRINDEFINITEQ_REPAIR_IF_POSSIBLE` Constant used in enumeration 'REPAIRINDEFINITEQ'
`static int`	`REPAIRINDEFINITEQMAX` Control of type Double.
`static int`	`REPAIRINFEASMAXTIME` Overall time limit for the repairinfeas tool
`static int`	`RESOURCESTRATEGY` Controls whether the optimizer is allowed to make nondeterministic decisions if memory is running low in an effort to preserve memory and finish the solve.
`static int`	`RHSNAME` Active right hand side name.
`static int`	`ROOTPRESOLVE` Determines if presolving should be performed on the problem after the global search has finished with root cutting and heuristics.
`static int`	`ROWFLAG_DELAYED` Constant used in enumeration 'ROWFLAG'
`static int`	`ROWFLAG_INDICATOR` Constant used in enumeration 'ROWFLAG'
`static int`	`ROWFLAG_MODELCUT` Constant used in enumeration 'ROWFLAG'
`static int`	`ROWFLAG_NONLINEAR` Constant used in enumeration 'ROWFLAG'
`static int`	`ROWFLAG_QUADRATIC` Constant used in enumeration 'ROWFLAG'
`static int`	`ROWS` Number of rows (i.e.
`static int`	`SBBEST` Number of infeasible global entities to initialize pseudo costs for on each node.
`static int`	`SBEFFORT` Adjusts the overall amount of effort when using strong branching to select an infeasible global entity to branch on.
`static int`	`SBESTIMATE` Branch and Bound: How to calculate pseudo costs from the local node when selecting an infeasible global entity to branch on.
`static int`	`SBITERLIMIT` Number of dual iterations to perform the strong branching for each entity.
`static int`	`SBSELECT` The size of the candidate list of global entities for strong branching.
`static int`	`SCALING` This bit vector control determines how the Optimizer will rescale a model internally before optimization.
`static int`	`SCALING_BEFORE_AND_AFTER_PRESOLVE` Constant used in enumeration 'SCALING'
`static int`	`SCALING_BEFORE_PRESOLVE` Constant used in enumeration 'SCALING'
`static int`	`SCALING_BIGM` Constant used in enumeration 'SCALING'
`static int`	`SCALING_BY_MAX_ELEM_NOT_GEO_MEAN` Constant used in enumeration 'SCALING'
`static int`	`SCALING_COLUMN_SCALING` Constant used in enumeration 'SCALING'
`static int`	`SCALING_CURTIS_REID` Constant used in enumeration 'SCALING'
`static int`	`SCALING_DISABLE_GLOBAL_OBJECTIVE_SCALING` Constant used in enumeration 'SCALING'
`static int`	`SCALING_DOGLEG` Constant used in enumeration 'SCALING'
`static int`	`SCALING_IGNORE_QUADRATIC_ROW_PART` Constant used in enumeration 'SCALING'
`static int`	`SCALING_MAXIMUM` Constant used in enumeration 'SCALING'
`static int`	`SCALING_NO_AGGRESSIVE_Q_SCALING` Constant used in enumeration 'SCALING'
`static int`	`SCALING_NO_SCALING_COLUMNS_DOWN` Constant used in enumeration 'SCALING'
`static int`	`SCALING_NO_SCALING_ROWS_UP` Constant used in enumeration 'SCALING'
`static int`	`SCALING_RHS_SCALING` Constant used in enumeration 'SCALING'
`static int`	`SCALING_ROW_SCALING` Constant used in enumeration 'SCALING'
`static int`	`SCALING_ROW_SCALING_AGAIN` Constant used in enumeration 'SCALING'
`static int`	`SCALING_RUIZ` Constant used in enumeration 'SCALING'
`static int`	`SCALING_SIMPLEX_OBJECTIVE_SCALING` Constant used in enumeration 'SCALING'
`static int`	`SCALING_SLACK_SCALING` Constant used in enumeration 'SCALING'
`static int`	`SERIALIZEPREINTSOL` Setting `SERIALIZEPREINTSOL` to 1 will ensure that the `preintsol` callback will always be fired in a deterministic order during a parallel MIP solve.
`static int`	`SETMEMBERS` Number of variables within special ordered sets (set members) in the matrix.
`static int`	`SETS` Number of special ordered sets in the matrix.
`static int`	`SIFTING` Determines whether to enable sifting algorithm with the dual simplex method.
`static int`	`SIFTPASSES` Determines how quickly we allow to grow the worker problems during the sifting algorithm.
`static int`	`SIFTPRESOLVEOPS` Determines the presolve operations for solving the subproblems during the sifting algorithm.
`static int`	`SIFTSWITCH` Determines which algorithm to use for solving the subproblems during sifting.
`static int`	`SIMPLEXITER` Number of simplex iterations performed.
`static int`	`SLEEPONTHREADWAIT` Determines if the threads should be put into a wait state when waiting for work.
`static int`	`SOLINFO_ABSDUALINFEAS` Constant used in enumeration 'SOLINFO'
`static int`	`SOLINFO_ABSMIPINFEAS` Constant used in enumeration 'SOLINFO'
`static int`	`SOLINFO_ABSPRIMALINFEAS` Constant used in enumeration 'SOLINFO'
`static int`	`SOLINFO_MAXMIPFRACTIONAL` Constant used in enumeration 'SOLINFO'
`static int`	`SOLINFO_RELDUALINFEAS` Constant used in enumeration 'SOLINFO'
`static int`	`SOLINFO_RELMIPINFEAS` Constant used in enumeration 'SOLINFO'
`static int`	`SOLINFO_RELPRIMALINFEAS` Constant used in enumeration 'SOLINFO'
`static int`	`SOSREFTOL` The minimum relative gap between the ordering values of elements in a special ordered set.
`static int`	`SPARECOLS` Number of spare columns in the matrix.
`static int`	`SPAREELEMS` Number of spare matrix elements in the matrix.
`static int`	`SPAREMIPENTS` Number of spare global entities in the matrix.
`static int`	`SPAREROWS` Number of spare rows in the matrix.
`static int`	`SPARESETELEMS` Number of spare set elements in the matrix.
`static int`	`SPARESETS` Number of spare sets in the matrix.
`static int`	`STOP_CTRLC` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_GLOBALERROR` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_INFEASIBLE` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_ITERLIMIT` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_LICENSELOST` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_MEMORYERROR` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_MIPGAP` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_NODELIMIT` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_NONE` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_SOLLIMIT` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_TIMELIMIT` Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_USER` Constant used in enumeration 'enum_stop_type'
`static int`	`STOPSTATUS` Status of the optimization process.
`static int`	`SUMPRIMALINF` Scaled sum of primal infeasibilities.
`static int`	`SYMMETRY` Adjusts the overall amount of effort for symmetry detection.
`static int`	`SYMSELECT` Adjusts the overall amount of effort for symmetry detection.
`static int`	`SYSTEMMEMORY` The amount of non problem specific memory used by the solver.
`static int`	`THREADS` The default number of threads used during optimization.
`static int`	`TIME` Time spent solving the problem as measured by the optimizer.
`static int`	`TOTALMEMORY` The amount of dynamically allocated heap memory by the optimizer, including all problems currently exsisting.
`static int`	`TRACE` Display the infeasibility diagnosis during presolve.
`static int`	`TREECOMPLETION` Estimation of the relative completion of the search tree as fraction between 0 and 1.
`static int`	`TREECOMPRESSION` When writing nodes to the gloal file, the optimizer can try to use data-compression techniques to reduce the size of the global file on disk.
`static int`	`TREECOVERCUTS` Branch and Bound: The number of rounds of lifted cover inequalities generated at nodes other than the top node in the tree.
`static int`	`TREECUTSELECT` A bit vector providing detailed control of the cuts created during the tree search of a global solve.
`static int`	`TREEDIAGNOSTICS` A bit vector providing control over how various tree-management-related messages get printed in the global logfile during the branch-and-bound search.
`static int`	`TREEDIAGNOSTICS_MEMORY_SAVED_REPORTS` Constant used in enumeration 'TREEDIAGNOSTICS'
`static int`	`TREEDIAGNOSTICS_MEMORY_USAGE_SUMMARIES` Constant used in enumeration 'TREEDIAGNOSTICS'
`static int`	`TREEGOMCUTS` Branch and Bound: The number of rounds of Gomory cuts generated at nodes other than the first node in the tree.
`static int`	`TREEMEMORYLIMIT` A soft limit, in megabytes, for the amount of memory to use in storing the branch and bound search tree.
`static int`	`TREEMEMORYSAVINGTARGET` When the memory used by the branch-and-bound search tree exceeds the limit specified by the `TREEMEMORYLIMIT` control, the optimizer will try to save memory by writing lower-rated sections of the tree to the global file.
`static int`	`TREEMEMORYUSAGE` The amount of physical memory, in megabytes, currently being used to store the branch-and-bound search tree.
`static int`	`TREEQCCUTS` Branch and Bound: Limit on the number of rounds of outer approximation cuts generated for nodes other than the root node, when solving a mixed integer quadratic constrained or mixed integer second order conic problem with outer approximation.
`static int`	`TREERESTARTS` Number of in-tree restarts performed.
`static int`	`TUNERHISTORY` Tuner: Whether to reuse and append to previous tuner results of the same problem.
`static int`	`TUNERHISTORY_APPEND` Constant used in enumeration 'TUNERHISTORY'
`static int`	`TUNERHISTORY_IGNORE` Constant used in enumeration 'TUNERHISTORY'
`static int`	`TUNERHISTORY_REUSE` Constant used in enumeration 'TUNERHISTORY'
`static int`	`TUNERMAXTIME` Tuner: The maximum time in seconds that the tuner will run before it terminates.
`static int`	`TUNERMETHOD` Tuner: Selects a factory tuner method.
`static int`	`TUNERMETHOD_AUTOMATIC` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_LPNUMERICS` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_LPQUICK` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_MIPCOMPREHENSIVE` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_MIPHEURISTICS` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_MIPQUICK` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_MIPROOTFOCUS` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_MIPSIMPLE` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_MIPTREEFOCUS` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_MISLPQUICK` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHOD_SLPQUICK` Constant used in enumeration 'TUNERMETHOD'
`static int`	`TUNERMETHODFILE` Tuner: Defines a file from which the tuner can read user-defined tuner method.
`static int`	`TUNERMODE` Tuner: Whether to always enable the tuner or disable it.
`static int`	`TUNERMODE_AUTOMATIC` Constant used in enumeration 'TUNERMODE'
`static int`	`TUNERMODE_OFF` Constant used in enumeration 'TUNERMODE'
`static int`	`TUNERMODE_ON` Constant used in enumeration 'TUNERMODE'
`static int`	`TUNEROUTPUT` Tuner: Whether to output tuner results and logs to the file system.
`static int`	`TUNEROUTPUTPATH` Tuner: Defines a root path to which the tuner writes the result file and logs.
`static int`	`TUNERPERMUTE` Tuner: Defines the number of permutations to solve for each control setting.
`static int`	`TUNERROOTALG` Deprecated. Values are from enumeration 'TUNERROOTALG'
`static int`	`TUNERROOTALG_BARRIER` Constant used in enumeration 'TUNERROOTALG'
`static int`	`TUNERROOTALG_DUAL` Constant used in enumeration 'TUNERROOTALG'
`static int`	`TUNERROOTALG_NETWORK` Constant used in enumeration 'TUNERROOTALG'
`static int`	`TUNERROOTALG_PRIMAL` Constant used in enumeration 'TUNERROOTALG'
`static int`	`TUNERSESSIONNAME` Tuner: Defines a session name for the tuner.
`static int`	`TUNERTARGET` Tuner: Defines the tuner target -- what should be evaluated when comparing two runs with different control settings.
`static int`	`TUNERTARGET_AUTOMATIC` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_BOUND` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_GAP` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_INTEGRAL` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_OBJVAL` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_SLPOBJVAL` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_SLPTIME` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_SLPVALIDATION` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_TIMEBOUND` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_TIMEGAP` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTARGET_TIMEOBJVAL` Constant used in enumeration 'TUNERTARGET'
`static int`	`TUNERTHREADS` Tuner: the number of threads used by the tuner.
`static int`	`TUNERVERBOSE` Tuner: whether the tuner should prints detailed information for each run.
`static int`	`TYPE_DOUBLE` Constant used in enumeration 'enum_parameter_type'
`static int`	`TYPE_INT` Constant used in enumeration 'enum_parameter_type'
`static int`	`TYPE_INT64` Constant used in enumeration 'enum_parameter_type'
`static int`	`TYPE_NOTDEFINED` Constant used in enumeration 'enum_parameter_type'
`static int`	`TYPE_STRING` Constant used in enumeration 'enum_parameter_type'
`static int`	`USERSOLHEURISTIC` Determines how much effort to put into running a local search heuristic to find a feasible integer solution from a partial or infeasible user solution.
`static int`	`UUID` Universally Unique Identifier for the problem instance.
`static int`	`VARSELECTION` Branch and Bound: This determines the formula used to calculate the estimate of each integer variable, and thus which integer variable is selected to be branched on at a given node.
`static int`	`VARSELECTION_AUTOMATIC` Constant used in enumeration 'VARSELECTION'
`static int`	`VARSELECTION_DOWN_PSEUDO_COST` Constant used in enumeration 'VARSELECTION'
`static int`	`VARSELECTION_MAX_UPDOWN_PSEUDO_COSTS` Constant used in enumeration 'VARSELECTION'
`static int`	`VARSELECTION_MAX_UPDOWN_PSEUDO_COSTS_PLUS_TWICE_MIN` Constant used in enumeration 'VARSELECTION'
`static int`	`VARSELECTION_MIN_UPDOWN_PSEUDO_COSTS` Constant used in enumeration 'VARSELECTION'
`static int`	`VARSELECTION_SUM_UPDOWN_PSEUDO_COSTS` Constant used in enumeration 'VARSELECTION'
`static int`	`VARSELECTION_UP_PSEUDO_COST` Constant used in enumeration 'VARSELECTION'
`static int`	`VERSION` The Optimizer version number, e.g.
`static int`	`XDRPAGGRESSIVE_BEFORE_CROSSOVER` Constant used in enumeration 'CROSSOVERDRP'
`static int`	`XDRPBEFORE_CROSSOVER` Constant used in enumeration 'CROSSOVERDRP'
`static int`	`XDRPINSIDE_CROSSOVER` Constant used in enumeration 'CROSSOVERDRP'
`static int`	`XPRESSVERSION` The Xpress version number.
`static int`	`XPVERSION`

- Field Detail
  - PLUSINFINITY
```
static final double PLUSINFINITY
```
    See Also:
    
    Constant Field Values
  - MINUSINFINITY
```
static final double MINUSINFINITY
```
    See Also:
    
    Constant Field Values
  - MAXINT
```
@Deprecated
static final int MAXINT
```
    Deprecated. Use Integer.MAX_VALUE instead.
    
    Maximum integer value.
    
    See Also:
    
    Constant Field Values
  - XPVERSION
```
static final int XPVERSION
```
    See Also:
    
    Constant Field Values
  - JAVAXPRS_VERSION
```
static final java.lang.String JAVAXPRS_VERSION
```
    See Also:
    
    Constant Field Values
  - EXTRAROWS
```
static final int EXTRAROWS
```
    The initial number of extra rows to allow for in the matrix, including cuts. If rows are to be added to the matrix, then, for maximum efficiency, space should be reserved for the rows before the matrix is input by setting the EXTRAROWS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
    
    See Also:
    
    Constant Field Values
  - EXTRACOLS
```
static final int EXTRACOLS
```
    The initial number of extra columns to allow for in the matrix. If columns are to be added to the matrix, then, for maximum efficiency, space should be reserved for the columns before the matrix is input by setting the EXTRACOLS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
    
    See Also:
    
    Constant Field Values
  - EXTRAELEMS
```
static final int EXTRAELEMS
```
    The initial number of extra matrix elements to allow for in the matrix, including coefficients for cuts. If rows or columns are to be added to the matrix, then, for maximum efficiency, space should be reserved for the extra matrix elements before the matrix is input by setting the EXTRAELEMS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
    
    See Also:
    
    Constant Field Values
  - LPITERLIMIT
```
static final int LPITERLIMIT
```
    The maximum number of iterations that will be performed by primal simplex or dual simplex before the optimization process terminates. For MIP problems, this is the maximum total number of iterations over all nodes explored by the Branch and Bound method.
    
    See Also:
    
    Constant Field Values
  - LPLOG
```
static final int LPLOG
```
    Simplex: The frequency at which the simplex log is printed.
    
    See Also:
    
    Constant Field Values
  - SCALING
```
static final int SCALING
```
    This bit vector control determines how the Optimizer will rescale a model internally before optimization. If set to 0, no scaling will take place. Values are from enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - PRESOLVE
```
static final int PRESOLVE
```
    This control determines whether presolving should be performed prior to starting the main algorithm. Presolve attempts to simplify the problem by detecting and removing redundant constraints, tightening variable bounds, etc. In some cases, infeasibility may even be determined at this stage, or the optimal solution found. Values are from enumeration 'PRESOLVE'
    
    See Also:
    
    Constant Field Values
  - CRASH
```
static final int CRASH
```
    Simplex: This determines the type of crash used when the algorithm begins. During the crash procedure, an initial basis is determined which is as close to feasibility and triangularity as possible. A good choice at this stage will significantly reduce the number of iterations required to find an optimal solution. The possible values increase proportionally to their time-consumption.
    
    See Also:
    
    Constant Field Values
  - PRICINGALG
```
static final int PRICINGALG
```
    Simplex: This determines the primal simplex pricing method. It is used to select which variable enters the basis on each iteration. In general Devex pricing requires more time on each iteration, but may reduce the total number of iterations, whereas partial pricing saves time on each iteration, but may result in more iterations. Values are from enumeration 'PRICING'
    
    See Also:
    
    Constant Field Values
  - INVERTFREQ
```
static final int INVERTFREQ
```
    Simplex: The frequency with which the basis will be inverted. The basis is maintained in a factorized form and on most simplex iterations it is incrementally updated to reflect the step just taken. This is considerably faster than computing the full inverted matrix at each iteration, although after a number of iterations the basis becomes less well-conditioned and it becomes necessary to compute the full inverted matrix. The value of INVERTFREQ specifies the maximum number of iterations between full inversions.
    
    See Also:
    
    Constant Field Values
  - INVERTMIN
```
static final int INVERTMIN
```
    Simplex: The minimum number of iterations between full inversions of the basis matrix. See the description of INVERTFREQ for details.
    
    See Also:
    
    Constant Field Values
  - MAXNODE
```
static final int MAXNODE
```
    Branch and Bound: The maximum number of nodes that will be explored.
    
    See Also:
    
    Constant Field Values
  - MAXTIME
```
static final int MAXTIME
```
    The maximum time in seconds that the Optimizer will run before it terminates, including the problem setup time and solution time. For MIP problems, this is the total time taken to solve all the nodes.
    
    See Also:
    
    Constant Field Values
  - MAXMIPSOL
```
static final int MAXMIPSOL
```
    Branch and Bound: This specifies a limit on the number of integer solutions to be found by the Optimizer. It is possible that during optimization the Optimizer will find the same objective solution from different nodes. However, MAXMIPSOL refers to the total number of integer solutions found, and not necessarily the number of distinct solutions.
    
    See Also:
    
    Constant Field Values
  - SIFTPASSES
```
static final int SIFTPASSES
```
    Determines how quickly we allow to grow the worker problems during the sifting algorithm. Using larger values can increase the number of columns added to the worker problem which often results in increased solve times for the worker problems but the number of necessary sifting iterations may be reduced. .
    
    See Also:
    
    Constant Field Values
  - DEFAULTALG
```
static final int DEFAULTALG
```
    This selects the algorithm that will be used to solve the LP if no algorithm flag is passed to the optimization routines. Values are from enumeration 'DEFAULTALG'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION
```
static final int VARSELECTION
```
    Branch and Bound: This determines the formula used to calculate the estimate of each integer variable, and thus which integer variable is selected to be branched on at a given node. The variable selected to be branched on is the one with the maximum estimate. Values are from enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - NODESELECTION
```
static final int NODESELECTION
```
    Branch and Bound: This determines which nodes will be considered for solution once the current node has been solved. Values are from enumeration 'NODESELECTION'
    
    See Also:
    
    Constant Field Values
  - BACKTRACK
```
static final int BACKTRACK
```
    Branch and Bound: Specifies how to select the next node to work on when a full backtrack is performed. Values are from enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - MIPLOG
```
static final int MIPLOG
```
    Global print control.
    
    See Also:
    
    Constant Field Values
  - KEEPNROWS
```
static final int KEEPNROWS
```
    How nonbinding rows should be handled by the MPS reader.
    
    See Also:
    
    Constant Field Values
  - MPSECHO
```
static final int MPSECHO
```
    Determines whether comments in MPS matrix files are to be printed out during matrix input.
    
    See Also:
    
    Constant Field Values
  - MAXPAGELINES
```
static final int MAXPAGELINES
```
    Number of lines between page breaks in printable output.
    
    See Also:
    
    Constant Field Values
  - OUTPUTLOG
```
static final int OUTPUTLOG
```
    This controls the level of output produced by the Optimizer during optimization. In the Console Optimizer, OUTPUTLOG controls which messages are sent to the screen ( stdout). When using the Optimizer library, no output is sent to the screen. If the user wishes output to be displayed, they must define a callback function and print messages to the screen themselves. In this case, OUTPUTLOG controls which messages are sent to the user output callback. Values are from enumeration 'OUTPUTLOG'
    
    See Also:
    
    Constant Field Values
  - EXTRAPRESOLVE
```
static final int EXTRAPRESOLVE
```
    This control no longer has any effect and will be removed from future releases. Use PRESOLVEMAXGROW to limit the number of non-zero coefficients in the presolved problem.
    
    See Also:
    
    Constant Field Values
  - BARSOLUTION
```
static final int BARSOLUTION
```
    This determines whether the barrier has to decide which is the best solution found or return the solution computed by te last barrier iteration.
    
    See Also:
    
    Constant Field Values
  - CACHESIZE
```
static final int CACHESIZE
```
    Newton Barrier: L2 or L3 (see notes) cache size in kB (kilobytes) of the CPU. On Intel (or compatible) platforms a value of -1 may be used to determine the cache size automatically. If the CPU model is new then the cache size may not be correctly detected by an older release of the software.
    
    See Also:
    
    Constant Field Values
  - CROSSOVER
```
static final int CROSSOVER
```
    Newton barrier: This control determines whether the barrier method will cross over to the simplex method when at optimal solution has been found, to provide an end basis (see XPRSgetbasis, XPRSwritebasis) and advanced sensitivity analysis information (see XPRSobjsa, XPRSrhssa, XPRSbndsa). Values are from enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - BARITERLIMIT
```
static final int BARITERLIMIT
```
    Newton barrier: The maximum number of iterations. While the simplex method usually performs a number of iterations which is proportional to the number of constraints (rows) in a problem, the barrier method standardly finds the optimal solution to a given accuracy after a number of iterations which is independent of the problem size. The penalty is rather that the time for each iteration increases with the size of the problem. BARITERLIMIT specifies the maximum number of iterations which will be carried out by the barrier.
    
    See Also:
    
    Constant Field Values
  - CHOLESKYALG
```
static final int CHOLESKYALG
```
    Newton barrier: type of Cholesky factorization used. Values are from enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - BAROUTPUT
```
static final int BAROUTPUT
```
    Newton barrier: This specifies the level of solution output provided. Output is provided either after each iteration of the algorithm, or else can be turned off completely by this parameter.
    
    See Also:
    
    Constant Field Values
  - CSTYLE
```
static final int CSTYLE
```
    Deprecated.
    
    See Also:
    
    Constant Field Values
  - EXTRAMIPENTS
```
static final int EXTRAMIPENTS
```
    The initial number of extra global entities to allow for.
    
    See Also:
    
    Constant Field Values
  - REFACTOR
```
static final int REFACTOR
```
    Indicates whether the optimization should restart using the current representation of the factorization in memory.
    
    See Also:
    
    Constant Field Values
  - BARTHREADS
```
static final int BARTHREADS
```
    If set to a positive integer it determines the number of threads implemented to run the Newton-barrier algorithm. If the value is set to the default value ( -1), the THREADS control will determine the number of threads used.
    
    See Also:
    
    Constant Field Values
  - KEEPBASIS
```
static final int KEEPBASIS
```
    Simplex: This determines which basis to use for the next iteration. The choice is between using that determined by the crash procedure at the first iteration, or using the basis from the last iteration.
    
    See Also:
    
    Constant Field Values
  - CROSSOVEROPS
```
static final int CROSSOVEROPS
```
    Newton barrier: a bit vector for adjusting the behavior of the crossover procedure.
    
    See Also:
    
    Constant Field Values
  - VERSION
```
static final int VERSION
```
    The Optimizer version number, e.g. 1301 meaning release 13.01.
    
    See Also:
    
    Constant Field Values
  - CROSSOVERTHREADS
```
static final int CROSSOVERTHREADS
```
    Determines the maximum number of threads that parallel crossover is allowed to use. If CROSSOVERTHREADS is set to the default value ( -1), the BARTHREADS control will determine the number of threads used.
    
    See Also:
    
    Constant Field Values
  - BIGMMETHOD
```
static final int BIGMMETHOD
```
    Simplex: This specifies whether to use the "Big M" method, or the standard phase I (achieving feasibility) and phase II (achieving optimality). In the "Big M" method, the objective coefficients of the variables are considered during the feasibility phase, possibly leading to an initial feasible basis which is closer to optimal. The side-effects involve possible round-off errors due to the presence of the "Big M" factor in the problem.
    
    See Also:
    
    Constant Field Values
  - MPSNAMELENGTH
```
static final int MPSNAMELENGTH
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - ELIMFILLIN
```
static final int ELIMFILLIN
```
    Amount of fill-in allowed when performing an elimination in presolve .
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS
```
static final int PRESOLVEOPS
```
    This bit vector control specifies the operations which are performed during the presolve. Values are from enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE
```
static final int MIPPRESOLVE
```
    Branch and Bound: Type of integer processing to be performed. If set to 0, no processing will be performed. Values are from enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPTHREADS
```
static final int MIPTHREADS
```
    If set to a positive integer it determines the number of threads implemented to run the parallel MIP code. If MIPTHREADS is set to the default value ( -1), the THREADS control will determine the number of threads used.
    
    See Also:
    
    Constant Field Values
  - BARORDER
```
static final int BARORDER
```
    Newton barrier: This controls the Cholesky factorization in the Newton-Barrier. Values are from enumeration 'BARORDER'
    
    See Also:
    
    Constant Field Values
  - BREADTHFIRST
```
static final int BREADTHFIRST
```
    The number of nodes to include in the best-first search before switching to the local first search ( NODESELECTION = 4).
    
    See Also:
    
    Constant Field Values
  - AUTOPERTURB
```
static final int AUTOPERTURB
```
    Simplex: This indicates whether automatic perturbation is performed. If this is set to 1, the problem will be perturbed whenever the simplex method encounters an excessive number of degenerate pivot steps, thus preventing the Optimizer being hindered by degeneracies. Values are from enumeration 'ONOFF'
    
    See Also:
    
    Constant Field Values
  - DENSECOLLIMIT
```
static final int DENSECOLLIMIT
```
    Newton barrier: Columns with more than DENSECOLLIMIT elements are considered to be dense. Such columns will be handled specially in the Cholesky factorization of this matrix.
    
    See Also:
    
    Constant Field Values
  - CALLBACKFROMMASTERTHREAD
```
static final int CALLBACKFROMMASTERTHREAD
```
    Branch and Bound: specifies whether the MIP callbacks should only be called on the master thread.
    
    See Also:
    
    Constant Field Values
  - MAXMCOEFFBUFFERELEMS
```
static final int MAXMCOEFFBUFFERELEMS
```
    The maximum number of matrix coefficients to buffer before flushing into the internal representation of the problem. Buffering coefficients can offer a significant performance gain when you are building a matrix using XPRSchgcoef or XPRSchgmcoef, but can lead to a significant memory overhead for large matrices, which this control allows you to influence.
    
    See Also:
    
    Constant Field Values
  - REFINEOPS
```
static final int REFINEOPS
```
    This specifies when the solution refiner should be executed to reduce solution infeasibilities. The refiner will attempt to satisfy the target tolerances for all original linear constraints before presolve or scaling has been applied.
    
    See Also:
    
    Constant Field Values
  - LPREFINEITERLIMIT
```
static final int LPREFINEITERLIMIT
```
    This specifies the simplex iteration limit the solution refiner can spend in attempting to increase the accuracy of an LP solution.
    
    See Also:
    
    Constant Field Values
  - MIPREFINEITERLIMIT
```
static final int MIPREFINEITERLIMIT
```
    This defines an effort limit expressed as simplex iterations for the MIP solution refiner. The limit is per reoptimizations in the MIP refiner.
    
    See Also:
    
    Constant Field Values
  - DUALIZEOPS
```
static final int DUALIZEOPS
```
    Bit-vector control for adjusting the behavior when a problem is dualized.
    
    See Also:
    
    Constant Field Values
  - CROSSOVERITERLIMIT
```
static final int CROSSOVERITERLIMIT
```
    Newton barrier: The maximum number of iterations that will be performed in the crossover procedure before the optimization process terminates.
    
    See Also:
    
    Constant Field Values
  - PREBASISRED
```
static final int PREBASISRED
```
    Determines if a lattice basis reduction algorithm should be attempted as part of presolve
    
    See Also:
    
    Constant Field Values
  - PRESORT
```
static final int PRESORT
```
    This bit vector control specifies whether to sort rows, columns and global information by their names when starting the presolve. With the default value 0, no sorting will take place.
    
    See Also:
    
    Constant Field Values
  - PREPERMUTE
```
static final int PREPERMUTE
```
    This bit vector control specifies whether to randomly permute rows, columns and global information when starting the presolve. With the default value 0, no permutation will take place.
    
    See Also:
    
    Constant Field Values
  - PREPERMUTESEED
```
static final int PREPERMUTESEED
```
    This control sets the seed for the pseudo-random number generator for permuting the problem when starting the presolve. This control only has effects when PREPERMUTE is enabled.
    
    See Also:
    
    Constant Field Values
  - MAXMEMORYSOFT
```
static final int MAXMEMORYSOFT
```
    When RESOURCESTRATEGY is enabled, this control sets the maximum amount of memory in megabytes the optimizer targets to allocate. This may change the solving path, but will not cause the solve to terminate early. To set a hard version of the same, please set MAXMEMORYHARD.
    
    See Also:
    
    Constant Field Values
  - CUTFREQ
```
static final int CUTFREQ
```
    Branch and Bound: This specifies the frequency at which cuts are generated in the tree search. If the depth of the node modulo CUTFREQ is zero, then cuts will be generated.
    
    See Also:
    
    Constant Field Values
  - SYMSELECT
```
static final int SYMSELECT
```
    Adjusts the overall amount of effort for symmetry detection.
    
    See Also:
    
    Constant Field Values
  - SYMMETRY
```
static final int SYMMETRY
```
    Adjusts the overall amount of effort for symmetry detection.
    
    See Also:
    
    Constant Field Values
  - MAXMEMORYHARD
```
static final int MAXMEMORYHARD
```
    This control sets the maximum amount of memory in megabytes the optimizer should allocate. If this limit is exceeded, the solve will terminate. This control is designed to make the optimizer stop in a controlled manner, so that the problem object is valid once termination occurs. The solve state will be set to incomplete. This is different to an out of memory condition in which case the optimizer returns an error. The optimizer may still allocate memory once the limit is exceeded to be able to finsish the operations and stop in a controlled manner. When RESOURCESTRATEGY is enabled, the control also has the same effect as MAXMEMORYSOFT and will cause the optimizer to try preserving memory when possible.
    
    See Also:
    
    Constant Field Values
  - LPTHREADS
```
static final int LPTHREADS
```
    Deprecated.
    
    See Also:
    
    Constant Field Values
  - MIQCPALG
```
static final int MIQCPALG
```
    This control determines which algorithm is to be used to solve mixed integer quadratic constrained and mixed integer second order cone problems.
    
    See Also:
    
    Constant Field Values
  - QCCUTS
```
static final int QCCUTS
```
    Branch and Bound: Limit on the number of rounds of outer approximation cuts generated for the root node, when solving a mixed integer quadratic constrained or mixed integer second order conic problem with outer approximation.
    
    See Also:
    
    Constant Field Values
  - QCROOTALG
```
static final int QCROOTALG
```
    This control determines which algorithm is to be used to solve the root of a mixed integer quadratic constrained or mixed integer second order cone problem, when outer approximation is used.
    
    See Also:
    
    Constant Field Values
  - PRECONVERTSEPARABLE
```
static final int PRECONVERTSEPARABLE
```
    Presolve: reformulate problem with non-diagonal quadratic objective and/or constraints as diagonal quadratic or second-order conic constraints.
    
    See Also:
    
    Constant Field Values
  - ALGAFTERNETWORK
```
static final int ALGAFTERNETWORK
```
    The algorithm to be used for the clean up step after the network simplex solver.
    
    See Also:
    
    Constant Field Values
  - TRACE
```
static final int TRACE
```
    Display the infeasibility diagnosis during presolve. If non-zero, an explanation of the logical deductions made by presolve to deduce infeasibility or unboundedness will be displayed on screen or sent to the message callback function.
    
    See Also:
    
    Constant Field Values
  - MAXIIS
```
static final int MAXIIS
```
    This function controls the number of Irreducible Infeasible Sets to be found using the XPRSiisall ( IIS -a).
    
    See Also:
    
    Constant Field Values
  - CPUTIME
```
static final int CPUTIME
```
    How time should be measured when timings are reported in the log and when checking against time limits
    
    See Also:
    
    Constant Field Values
  - COVERCUTS
```
static final int COVERCUTS
```
    Branch and Bound: The number of rounds of lifted cover inequalities at the top node. A lifted cover inequality is an additional constraint that can be particularly effective at reducing the size of the feasible region without removing potential integral solutions. The process of generating these can be carried out a number of times, further reducing the feasible region, albeit incurring a time penalty. There is usually a good payoff from generating these at the top node, since these inequalities then apply to every subsequent node in the tree search.
    
    See Also:
    
    Constant Field Values
  - GOMCUTS
```
static final int GOMCUTS
```
    Branch and Bound: The number of rounds of Gomory or lift-and-project cuts at the top node.
    
    See Also:
    
    Constant Field Values
  - LPFOLDING
```
static final int LPFOLDING
```
    Simplex and barrier: whether to fold an LP problem before solving it.
    
    See Also:
    
    Constant Field Values
  - MPSFORMAT
```
static final int MPSFORMAT
```
    Specifies the format of MPS files.
    
    See Also:
    
    Constant Field Values
  - CUTSTRATEGY
```
static final int CUTSTRATEGY
```
    Branch and Bound: This specifies the cut strategy. A more aggressive cut strategy, generating a greater number of cuts, will result in fewer nodes to be explored, but with an associated time cost in generating the cuts. The fewer cuts generated, the less time taken, but the greater subsequent number of nodes to be explored. Values are from enumeration 'CUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTDEPTH
```
static final int CUTDEPTH
```
    Branch and Bound: Sets the maximum depth in the tree search at which cuts will be generated. Generating cuts can take a lot of time, and is often less important at deeper levels of the tree since tighter bounds on the variables have already reduced the feasible region. A value of 0 signifies that no cuts will be generated.
    
    See Also:
    
    Constant Field Values
  - TREECOVERCUTS
```
static final int TREECOVERCUTS
```
    Branch and Bound: The number of rounds of lifted cover inequalities generated at nodes other than the top node in the tree. Compare with the description for COVERCUTS. A value of -1 indicates the number of rounds is determined automatically.
    
    See Also:
    
    Constant Field Values
  - TREEGOMCUTS
```
static final int TREEGOMCUTS
```
    Branch and Bound: The number of rounds of Gomory cuts generated at nodes other than the first node in the tree. Compare with the description for GOMCUTS. A value of -1 indicates the number of rounds is determined automatically.
    
    See Also:
    
    Constant Field Values
  - CUTSELECT
```
static final int CUTSELECT
```
    A bit vector providing detailed control of the cuts created for the root node of a global solve. Use TREECUTSELECT to control cuts during the tree search. Values are from enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - TREECUTSELECT
```
static final int TREECUTSELECT
```
    A bit vector providing detailed control of the cuts created during the tree search of a global solve. Use CUTSELECT to control cuts on the root node.
    
    See Also:
    
    Constant Field Values
  - DUALIZE
```
static final int DUALIZE
```
    This specifies whether presolve should form the dual of the problem. Values are from enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - DUALGRADIENT
```
static final int DUALGRADIENT
```
    Simplex: This specifies the dual simplex pricing method. Values are from enumeration 'DUALGRADIENT'
    
    See Also:
    
    Constant Field Values
  - SBITERLIMIT
```
static final int SBITERLIMIT
```
    Number of dual iterations to perform the strong branching for each entity.
    
    See Also:
    
    Constant Field Values
  - SBBEST
```
static final int SBBEST
```
    Number of infeasible global entities to initialize pseudo costs for on each node.
    
    See Also:
    
    Constant Field Values
  - MAXCUTTIME
```
static final int MAXCUTTIME
```
    The maximum amount of time allowed for generation of cutting planes and reoptimization. The limit is checked during generation and no further cuts are added once this limit has been exceeded.
    
    See Also:
    
    Constant Field Values
  - ACTIVESET
```
static final int ACTIVESET
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - BARINDEFLIMIT
```
static final int BARINDEFLIMIT
```
    Newton Barrier. This limits the number of consecutive indefinite barrier iterations that will be performed. The optimizer will try to minimize (resp. maximize) a QP problem even if the Q matrix is not positive (resp. negative) semi-definite. However, the optimizer may detect that the Q matrix is indefinite and this can result in the optimizer not converging. This control specifies how many indefinite iterations may occur before the optimizer stops and reports that the problem is indefinite. It is usual to specify a value greater than one, and only stop after a series of indefinite matrices, as the problem may be found to be indefinite incorrectly on a few iterations for numerical reasons.
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY
```
static final int HEURSTRATEGY
```
    Deprecated. Values are from enumeration 'HEURSTRATEGY'
    
    Branch and Bound: This specifies the heuristic strategy. On some problems it is worth trying more comprehensive heuristic strategies by setting HEURSTRATEGY to 2 or 3.
    
    See Also:
    
    Constant Field Values
  - HEURFREQ
```
static final int HEURFREQ
```
    Branch and Bound: This specifies the frequency at which heuristics are used in the tree search. Heuristics will only be used at a node if the depth of the node is a multiple of HEURFREQ.
    
    See Also:
    
    Constant Field Values
  - HEURDEPTH
```
static final int HEURDEPTH
```
    Branch and Bound: Sets the maximum depth in the tree search at which heuristics will be used to find MIP solutions. It may be worth stopping the heuristic search for solutions after a certain depth in the tree search. A value of 0 signifies that heuristics will not be used. This control no longer has any effect and will be removed from future releases.
    
    See Also:
    
    Constant Field Values
  - HEURMAXSOL
```
static final int HEURMAXSOL
```
    Branch and Bound: This specifies the maximum number of heuristic solutions that will be found in the tree search. This control no longer has any effect and will be removed from future releases.
    
    See Also:
    
    Constant Field Values
  - HEURNODES
```
static final int HEURNODES
```
    Branch and Bound: This specifies the maximum number of nodes at which heuristics are used in the tree search. This control no longer has any effect and will be removed from future releases.
    
    See Also:
    
    Constant Field Values
  - LNPBEST
```
static final int LNPBEST
```
    Number of infeasible global entities to create lift-and-project cuts for during each round of Gomory cuts at the top node (see GOMCUTS).
    
    See Also:
    
    Constant Field Values
  - LNPITERLIMIT
```
static final int LNPITERLIMIT
```
    Number of iterations to perform in improving each lift-and-project cut.
    
    See Also:
    
    Constant Field Values
  - BRANCHCHOICE
```
static final int BRANCHCHOICE
```
    Once a global entity has been selected for branching, this control determines which of the branches is solved first. Values are from enumeration 'BRANCHCHOICE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE
```
static final int BARREGULARIZE
```
    This control determines how the barrier algorithm applies regularization on the KKT system.
    
    See Also:
    
    Constant Field Values
  - SBSELECT
```
static final int SBSELECT
```
    The size of the candidate list of global entities for strong branching.
    
    See Also:
    
    Constant Field Values
  - LOCALCHOICE
```
static final int LOCALCHOICE
```
    Controls when to perform a local backtrack between the two child nodes during a dive in the branch and bound tree.
    
    See Also:
    
    Constant Field Values
  - LOCALBACKTRACK
```
static final int LOCALBACKTRACK
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY
```
static final int DUALSTRATEGY
```
    This bit-vector control specifies the dual simplex strategy. Values are from enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - L1CACHE
```
static final int L1CACHE
```
    Newton barrier: L1 cache size in kB (kilo bytes) of the CPU. On Intel (or compatible) platforms a value of -1 may be used to determine the cache size automatically.
    
    See Also:
    
    Constant Field Values
  - HEURDIVESTRATEGY
```
static final int HEURDIVESTRATEGY
```
    Branch and Bound: Chooses the strategy for the diving heuristic.
    
    See Also:
    
    Constant Field Values
  - HEURSELECT
```
static final int HEURSELECT
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - BARSTART
```
static final int BARSTART
```
    Newton barrier: Controls the computation of the starting point for the barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - PRESOLVEPASSES
```
static final int PRESOLVEPASSES
```
    Number of reduction rounds to be performed in presolve
    
    See Also:
    
    Constant Field Values
  - BARNUMSTABILITY
```
static final int BARNUMSTABILITY
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - BARORDERTHREADS
```
static final int BARORDERTHREADS
```
    If set to a positive integer it determines the number of concurrent threads for the sparse matrix ordering algorithm in the Newton-barrier method.
    
    See Also:
    
    Constant Field Values
  - EXTRASETS
```
static final int EXTRASETS
```
    The initial number of extra sets to allow for in the matrix. If sets are to be added to the matrix, then, for maximum efficiency, space should be reserved for the sets before the matrix is input by setting the EXTRASETS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
    
    See Also:
    
    Constant Field Values
  - EXTRASETELEMS
```
static final int EXTRASETELEMS
```
    The initial number of extra elements in sets to allow for in the matrix. If sets are to be added to the matrix, then, for maximum efficiency, space should be reserved for the set elements before the matrix is input by setting the EXTRASETELEMS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
    
    See Also:
    
    Constant Field Values
  - FEASIBILITYPUMP
```
static final int FEASIBILITYPUMP
```
    Branch and Bound: Decides if the Feasibility Pump heuristic should be run at the top node. Values are from enumeration 'FEASIBILITYPUMP'
    
    See Also:
    
    Constant Field Values
  - PRECOEFELIM
```
static final int PRECOEFELIM
```
    Presolve: Specifies whether the optimizer should attempt to recombine constraints in order to reduce the number of non zero coefficients when presolving a mixed integer problem. Values are from enumeration 'PRECOEFELIM'
    
    See Also:
    
    Constant Field Values
  - PREDOMCOL
```
static final int PREDOMCOL
```
    Presolve: Determines the level of dominated column removal reductions to perform when presolving a mixed integer problem. Only binary columns will be checked. Values are from enumeration 'PREDOMCOL'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHFREQ
```
static final int HEURSEARCHFREQ
```
    Branch and Bound: This specifies how often the local search heuristic should be run in the tree.
    
    See Also:
    
    Constant Field Values
  - HEURDIVESPEEDUP
```
static final int HEURDIVESPEEDUP
```
    Branch and Bound: Changes the emphasis of the diving heuristic from solution quality to diving speed.
    
    See Also:
    
    Constant Field Values
  - SBESTIMATE
```
static final int SBESTIMATE
```
    Branch and Bound: How to calculate pseudo costs from the local node when selecting an infeasible global entity to branch on. These pseudo costs are used in combination with local strong branching and history costs to select the branch candidate.
    
    See Also:
    
    Constant Field Values
  - BARCORES
```
static final int BARCORES
```
    If set to a positive integer it determines the number of physical CPU cores assumed to be present in the system by the barrier algorithm. If the value is set to the default value ( -1), Xpress will automatically detect the number of cores.
    
    See Also:
    
    Constant Field Values
  - MAXCHECKSONMAXTIME
```
static final int MAXCHECKSONMAXTIME
```
    This control is intended for use where optimization runs that are terminated using the MAXTIME control are required to be reproduced exactly. This control is necessary because of the inherent difficulty in terminating algorithmic software in a consistent way using temporal criteria. The control value relates to the number of times the optimizer checks the MAXTIME criterion up to and including the check when the termination was activated. To use the control the user first must obtain the value of the CHECKSONMAXTIME attribute after the run returns. This attribute value is the number of times the optimizer checked the MAXTIME criterion during the last call to the optimization routine XPRSmipoptimize. Note that this attribute value will be negative if the optimizer terminated on the MAXTIME criterion. To ensure that a reproduction of a run terminates in the same way the user should first ensure that MAXTIME is set to its default value or to a large value so the run does not terminate again on MAXTIME and then simply set the control MAXCHECKSONMAXTIME to the absolute value of the CHECKSONMAXTIME value.
    
    See Also:
    
    Constant Field Values
  - MAXCHECKSONMAXCUTTIME
```
static final int MAXCHECKSONMAXCUTTIME
```
    This control is intended for use where optimization runs that are terminated using the MAXCUTTIME control are required to be reproduced exactly. This control is necessary because of the inherent difficulty in terminating algorithmic software in a consistent way using temporal criteria. The control value relates to the number of times the optimizer checks the MAXCUTTIME criterion up to and including the check when the termination of cutting was activated. To use the control the user first must obtain the value of the CHECKSONMAXCUTTIME attribute after the run returns. This attribute value is the number of times the optimizer checked the MAXCUTTIME criterion during the last call to the optimization routine XPRSmipoptimize. Note that this attribute value will be negative if the optimizer terminated cutting on the MAXCUTTIME criterion. To ensure accurate reproduction of a run the user should first ensure that MAXCUTTIME is set to its default value or to a large value so the run does not terminate again on MAXCUTTIME and then simply set the control MAXCHECKSONMAXCUTTIME to the absolute value of the CHECKSONMAXCUTTIME value.
    
    See Also:
    
    Constant Field Values
  - HISTORYCOSTS
```
static final int HISTORYCOSTS
```
    Branch and Bound: How to update the pseudo cost for a global entity when a strong branch or a regular branch is applied.
    
    See Also:
    
    Constant Field Values
  - ALGAFTERCROSSOVER
```
static final int ALGAFTERCROSSOVER
```
    The algorithm to be used for the final clean up step after the crossover.
    
    See Also:
    
    Constant Field Values
  - LINELENGTH
```
static final int LINELENGTH
```
    Deprecated.
    
    See Also:
    
    Constant Field Values
  - MUTEXCALLBACKS
```
static final int MUTEXCALLBACKS
```
    Branch and Bound: This determines whether the callback routines are mutexed from within the optimizer.
    
    See Also:
    
    Constant Field Values
  - BARCRASH
```
static final int BARCRASH
```
    Newton barrier: This determines the type of crash used for the crossover. During the crash procedure, an initial basis is determined which attempts to speed up the crossover. A good choice at this stage will significantly reduce the number of iterations required to crossover to an optimal solution. The possible values increase proportionally to their time-consumption.
    
    See Also:
    
    Constant Field Values
  - HEURDIVESOFTROUNDING
```
static final int HEURDIVESOFTROUNDING
```
    Branch and Bound: Enables a more cautious strategy for the diving heuristic, where it tries to push binaries and integer variables to their bounds using the objective, instead of directly fixing them. This can be useful when the default diving heuristics fail to find any feasible solutions.
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHROOTSELECT
```
static final int HEURSEARCHROOTSELECT
```
    A bit vector control for selecting which local search heuristics to apply on the root node of a global solve. Use HEURSEARCHTREESELECT to control local search heuristics during the tree search. Values are from enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHTREESELECT
```
static final int HEURSEARCHTREESELECT
```
    A bit vector control for selecting which local search heuristics to apply during the tree search of a global solve. Use HEURSEARCHROOTSELECT to control local search heuristics on the root node. Values are from enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - MPS18COMPATIBLE
```
static final int MPS18COMPATIBLE
```
    Provides compatibility of MPS file output for older MPS readers.
    
    See Also:
    
    Constant Field Values
  - ROOTPRESOLVE
```
static final int ROOTPRESOLVE
```
    Determines if presolving should be performed on the problem after the global search has finished with root cutting and heuristics. Values are from enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - CROSSOVERDRP
```
static final int CROSSOVERDRP
```
    Control of type Integer. Values are from enumeration 'CROSSOVERDRP'
    
    See Also:
    
    Constant Field Values
  - FORCEOUTPUT
```
static final int FORCEOUTPUT
```
    Certain names in the problem object may be incompatible with different file formats (such as names containing spaces for LP files). If the optimizer might be unable to read back a problem because of non-standard names, it will first attempt to write it out using an extended naming convention. If the names would not be possible to extend so that they would be reproducible and recognizable, it will give an error message and won't create the file. If the optimizer might be unable to read back a problem because of non-standard names, it will give an error message and won't create the file. This option may be used to force output anyway.
    
    See Also:
    
    Constant Field Values
  - DETERMINISTIC
```
static final int DETERMINISTIC
```
    Branch and Bound: Specifies whether the parallel MIP search should be deterministic.
    
    See Also:
    
    Constant Field Values
  - PREPROBING
```
static final int PREPROBING
```
    Presolve: Amount of probing to perform on binary variables during presolve. This is done by fixing a binary to each of its values in turn and analyzing the implications. Values are from enumeration 'PREPROBING'
    
    See Also:
    
    Constant Field Values
  - EXTRAQCELEMENTS
```
static final int EXTRAQCELEMENTS
```
    Deprecated.
    
    See Also:
    
    Constant Field Values
  - EXTRAQCROWS
```
static final int EXTRAQCROWS
```
    Deprecated.
    
    See Also:
    
    Constant Field Values
  - TREEMEMORYLIMIT
```
static final int TREEMEMORYLIMIT
```
    A soft limit, in megabytes, for the amount of memory to use in storing the branch and bound search tree. This doesn't include memory used for presolve, heuristics, solving the LP relaxation, etc. When set to 0 (the default), the optimizer will calculate a limit automatically based on the amount of free physical memory detected in the machine. When the memory used by the branch and bound tree exceeds this limit, the optimizer will try to reduce the memory usage by writing lower-rated sections of the tree to a file called the "global file". Though the solve can continue if it cannot bring the tree memory usage below the specified limit, performance will be inhibited and a message will be printed to the log.
    
    See Also:
    
    Constant Field Values
  - TREECOMPRESSION
```
static final int TREECOMPRESSION
```
    When writing nodes to the gloal file, the optimizer can try to use data-compression techniques to reduce the size of the global file on disk. The TREECOMPRESSION control determines the strength of the data-compression algorithm used; higher values give superior data-compression at the affect of decreasing performance, while lower values compress quicker but not as effectively. Where TREECOMPRESSION is set to 0, no data compression will be used on the global file.
    
    See Also:
    
    Constant Field Values
  - TREEDIAGNOSTICS
```
static final int TREEDIAGNOSTICS
```
    A bit vector providing control over how various tree-management-related messages get printed in the global logfile during the branch-and-bound search. Values are from enumeration 'TREEDIAGNOSTICS'
    
    See Also:
    
    Constant Field Values
  - MAXGLOBALFILESIZE
```
static final int MAXGLOBALFILESIZE
```
    The maximum size, in megabytes, to which the global file may grow, or 0 for no limit. When the global file reaches this limit, a second global file will be created. Useful if you are using a filesystem that puts a maximum limit on the size of a file.
    
    See Also:
    
    Constant Field Values
  - PRECLIQUESTRATEGY
```
static final int PRECLIQUESTRATEGY
```
    Determines how much effort to spend on clique covers in presolve.
    
    See Also:
    
    Constant Field Values
  - REPAIRINFEASMAXTIME
```
static final int REPAIRINFEASMAXTIME
```
    Overall time limit for the repairinfeas tool
    
    See Also:
    
    Constant Field Values
  - IFCHECKCONVEXITY
```
static final int IFCHECKCONVEXITY
```
    Determines if the convexity of the problem is checked before optimization. Applies to quadratic, mixed integer quadratic and quadratically constrained problems. Checking convexity takes some time, thus for problems that are known to be convex it might be reasonable to switch the checking off. Values are from enumeration 'ONOFF'
    
    See Also:
    
    Constant Field Values
  - PRIMALUNSHIFT
```
static final int PRIMALUNSHIFT
```
    Determines whether primal is allowed to call dual to unshift. Values are from enumeration 'PRIMALUNSHIFT'
    
    See Also:
    
    Constant Field Values
  - REPAIRINDEFINITEQ
```
static final int REPAIRINDEFINITEQ
```
    Controls if the optimizer should make indefinite quadratic matrices positive definite when it is possible. Values are from enumeration 'REPAIRINDEFINITEQ'
    
    See Also:
    
    Constant Field Values
  - MIPRAMPUP
```
static final int MIPRAMPUP
```
    Controls the strategy used by the parallel MIP solver during the ramp-up phase of a branch-and-bound tree search.
    
    See Also:
    
    Constant Field Values
  - MAXLOCALBACKTRACK
```
static final int MAXLOCALBACKTRACK
```
    Branch-and-Bound: How far back up the current dive path the optimizer is allowed to look for a local backtrack candidate node.
    
    See Also:
    
    Constant Field Values
  - USERSOLHEURISTIC
```
static final int USERSOLHEURISTIC
```
    Determines how much effort to put into running a local search heuristic to find a feasible integer solution from a partial or infeasible user solution.
    
    See Also:
    
    Constant Field Values
  - FORCEPARALLELDUAL
```
static final int FORCEPARALLELDUAL
```
    Dual simplex: specifies whether the dual simplex solver should always use the parallel simplex algorithm. By default, when using a single thread, the dual simplex solver will execute a dedicated sequential simplex algorithm.
    
    See Also:
    
    Constant Field Values
  - BACKTRACKTIE
```
static final int BACKTRACKTIE
```
    Branch and Bound: Specifies how to break ties when selecting the next node to work on when a full backtrack is performed. The options are the same as for the BACKTRACK control. Values are from enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BRANCHDISJ
```
static final int BRANCHDISJ
```
    Branch and Bound: Determines whether the optimizer should attempt to branch on general split disjunctions during the branch and bound search.
    
    See Also:
    
    Constant Field Values
  - MIPFRACREDUCE
```
static final int MIPFRACREDUCE
```
    Branch and Bound: Specifies how often the optimizer should run a heuristic to reduce the number of fractional integer variables in the node LP solutions.
    
    See Also:
    
    Constant Field Values
  - CONCURRENTTHREADS
```
static final int CONCURRENTTHREADS
```
    Determines the number of threads used by the concurrent solver.
    
    See Also:
    
    Constant Field Values
  - MAXSCALEFACTOR
```
static final int MAXSCALEFACTOR
```
    This determines the maximum scaling factor that can be applied during scaling. The maximum is provided as an exponent of a power of 2.
    
    See Also:
    
    Constant Field Values
  - HEURTHREADS
```
static final int HEURTHREADS
```
    Branch and Bound: The number of threads to dedicate to running heuristics on the root node.
    
    See Also:
    
    Constant Field Values
  - THREADS
```
static final int THREADS
```
    The default number of threads used during optimization.
    
    See Also:
    
    Constant Field Values
  - HEURBEFORELP
```
static final int HEURBEFORELP
```
    Branch and Bound: Determines whether primal heuristics should be run before the initial LP relaxation has been solved.
    
    See Also:
    
    Constant Field Values
  - PREDOMROW
```
static final int PREDOMROW
```
    Presolve: Determines the level of dominated row removal reductions to perform when presolving a problem. Values are from enumeration 'PREDOMROW'
    
    See Also:
    
    Constant Field Values
  - BRANCHSTRUCTURAL
```
static final int BRANCHSTRUCTURAL
```
    Branch and Bound: Determines whether the optimizer should search for special structure in the problem to branch on during the branch and bound search. Values are from enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - QUADRATICUNSHIFT
```
static final int QUADRATICUNSHIFT
```
    Determines whether an extra solution purification step is called after a solution found by the quadratic simplex (either primal or dual). Values are from enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - BARPRESOLVEOPS
```
static final int BARPRESOLVEOPS
```
    Newton barrier: This controls the Newton-Barrier specific presolve operations. Values are from enumeration 'BARPRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS
```
static final int QSIMPLEXOPS
```
    Controls the behavior of the quadratic simplex solvers.
    
    See Also:
    
    Constant Field Values
  - MIPRESTART
```
static final int MIPRESTART
```
    Branch and Bound: controls strategy for in-tree restarts. Values are from enumeration 'MIPRESTART'
    
    See Also:
    
    Constant Field Values
  - CONFLICTCUTS
```
static final int CONFLICTCUTS
```
    Branch and Bound: Specifies how cautious or aggressive the optimizer should be when searching for and applying conflict cuts. Conflict cuts are in-tree cuts derived from nodes found to be infeasible or cut off, which can be used to cut off other branches of the search tree.
    
    See Also:
    
    Constant Field Values
  - PREPROTECTDUAL
```
static final int PREPROTECTDUAL
```
    Presolve: specifies whether the presolver should protect a given dual solution by maintaining the same level of dual feasibility. Enabling this control often results in a worse presolved model. This control only expected to be optionally enabled before calling XPRScrossoverlpsol.
    
    See Also:
    
    Constant Field Values
  - CORESPERCPU
```
static final int CORESPERCPU
```
    Used to override the detected value of the number of cores on a CPU. The cache size (either detected or specified via the CACHESIZE control) used in Barrier methods will be divided by this amount, and this scaled-down value will be the amount of cache allocated to each Barrier thread
    
    See Also:
    
    Constant Field Values
  - RESOURCESTRATEGY
```
static final int RESOURCESTRATEGY
```
    Controls whether the optimizer is allowed to make nondeterministic decisions if memory is running low in an effort to preserve memory and finish the solve. Available memory (or container limits) are automatically detected but can also be changed by MAXMEMORYSOFT and MAXMEMORYHARD
    
    See Also:
    
    Constant Field Values
  - CLAMPING
```
static final int CLAMPING
```
    This control allows for the adjustment of returned solution values such that they are always within bounds.
    
    See Also:
    
    Constant Field Values
  - SLEEPONTHREADWAIT
```
static final int SLEEPONTHREADWAIT
```
    Determines if the threads should be put into a wait state when waiting for work.
    
    See Also:
    
    Constant Field Values
  - PREDUPROW
```
static final int PREDUPROW
```
    Presolve: Determines the type of duplicate rows to look for and eliminate when presolving a problem.
    
    See Also:
    
    Constant Field Values
  - CPUPLATFORM
```
static final int CPUPLATFORM
```
    Newton Barrier: Selects the AMD or Intel x86 vectorization instruction set that Barrier should run optimized code for.
    
    See Also:
    
    Constant Field Values
  - BARALG
```
static final int BARALG
```
    This control determines which barrier algorithm is to be used to solve the problem.
    
    See Also:
    
    Constant Field Values
  - SIFTING
```
static final int SIFTING
```
    Determines whether to enable sifting algorithm with the dual simplex method.
    
    See Also:
    
    Constant Field Values
  - LPLOGSTYLE
```
static final int LPLOGSTYLE
```
    Simplex: The style of the simplex log.
    
    See Also:
    
    Constant Field Values
  - RANDOMSEED
```
static final int RANDOMSEED
```
    Sets the initial seed to use for the pseudo-random number generator in the Optimizer. The sequence of random numbers is always reset using the seed when starting a new optimization run.
    
    See Also:
    
    Constant Field Values
  - TREEQCCUTS
```
static final int TREEQCCUTS
```
    Branch and Bound: Limit on the number of rounds of outer approximation cuts generated for nodes other than the root node, when solving a mixed integer quadratic constrained or mixed integer second order conic problem with outer approximation.
    
    See Also:
    
    Constant Field Values
  - PRELINDEP
```
static final int PRELINDEP
```
    Presolve: Determines whether to check for and remove linearly dependent equality constraints when presolving a problem.
    
    See Also:
    
    Constant Field Values
  - DUALTHREADS
```
static final int DUALTHREADS
```
    Determines the maximum number of threads that dual simplex is allowed to use. If DUALTHREADS is set to the default value ( -1), the THREADS control will determine the number of threads used.
    
    See Also:
    
    Constant Field Values
  - PREOBJCUTDETECT
```
static final int PREOBJCUTDETECT
```
    Presolve: Determines whether to check for constraints that are parallel or near parallel to a linear objective function, and which can safely be removed. This reduction applies to MIPs only.
    
    See Also:
    
    Constant Field Values
  - PREBNDREDQUAD
```
static final int PREBNDREDQUAD
```
    Determines if convex quadratic contraints should be used for inferring bound reductions on variables when solving a MIP.
    
    See Also:
    
    Constant Field Values
  - PREBNDREDCONE
```
static final int PREBNDREDCONE
```
    Determines if second order cone constraints should be used for inferring bound reductions on variables when solving a MIP.
    
    See Also:
    
    Constant Field Values
  - PRECOMPONENTS
```
static final int PRECOMPONENTS
```
    Presolve: determines whether small independent components should be detected and solved as individual subproblems during root node processing.
    
    See Also:
    
    Constant Field Values
  - MAXMIPTASKS
```
static final int MAXMIPTASKS
```
    Branch-and-Bound: The maximum number of tasks to run in parallel during a MIP solve.
    
    See Also:
    
    Constant Field Values
  - MIPTERMINATIONMETHOD
```
static final int MIPTERMINATIONMETHOD
```
    Branch and Bound: How a MIP solve should be stopped on early termination when there are still active tasks in the system. This can happen when, for example, a time or node limit is reached.
    
    See Also:
    
    Constant Field Values
  - PRECONEDECOMP
```
static final int PRECONEDECOMP
```
    Presolve: decompose regular and rotated cones with more than two elements and apply Outer Approximation on the resulting components.
    
    See Also:
    
    Constant Field Values
  - HEURFORCESPECIALOBJ
```
static final int HEURFORCESPECIALOBJ
```
    Branch and Bound: This specifies whether local search heuristics without objective or with an auxiliary objective should always be used, despite the automatic selection of the Optimiezr. Deactivated by default.
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHROOTCUTFREQ
```
static final int HEURSEARCHROOTCUTFREQ
```
    How frequently to run the local search heuristic during root cutting. This is given as how many cut rounds to perform between runs of the heuristic. Set to zero to avoid applying the heuristic during root cutting. Branch and Bound: This specifies how often the local search heuristic should be run in the tree.
    
    See Also:
    
    Constant Field Values
  - PREELIMQUAD
```
static final int PREELIMQUAD
```
    Presolve: Allows for elimination of quadratic variables via doubleton rows.
    
    See Also:
    
    Constant Field Values
  - PREIMPLICATIONS
```
static final int PREIMPLICATIONS
```
    Presolve: Determines whether to use implication structures to remove redundant rows. If implication sequences are detected, they might also be used in probing.
    
    See Also:
    
    Constant Field Values
  - TUNERMODE
```
static final int TUNERMODE
```
    Tuner: Whether to always enable the tuner or disable it. Values are from enumeration 'TUNERMODE'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD
```
static final int TUNERMETHOD
```
    Tuner: Selects a factory tuner method. A tuner method consists of a list of controls with different settings that the tuner will evaluate and try to combine. Values are from enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET
```
static final int TUNERTARGET
```
    Tuner: Defines the tuner target -- what should be evaluated when comparing two runs with different control settings. Values are from enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTHREADS
```
static final int TUNERTHREADS
```
    Tuner: the number of threads used by the tuner.
    
    See Also:
    
    Constant Field Values
  - TUNERMAXTIME
```
static final int TUNERMAXTIME
```
    Tuner: The maximum time in seconds that the tuner will run before it terminates.
    
    See Also:
    
    Constant Field Values
  - TUNERHISTORY
```
static final int TUNERHISTORY
```
    Tuner: Whether to reuse and append to previous tuner results of the same problem. Values are from enumeration 'TUNERHISTORY'
    
    See Also:
    
    Constant Field Values
  - TUNERPERMUTE
```
static final int TUNERPERMUTE
```
    Tuner: Defines the number of permutations to solve for each control setting.
    
    See Also:
    
    Constant Field Values
  - TUNERROOTALG
```
static final int TUNERROOTALG
```
    Deprecated. Values are from enumeration 'TUNERROOTALG'
    
    It is a bit-vector control which defines the algorithm for solving an LP problem or the initial LP relaxation of a MIP problem within the tuner specifically.
    
    See Also:
    
    Constant Field Values
  - TUNERVERBOSE
```
static final int TUNERVERBOSE
```
    Tuner: whether the tuner should prints detailed information for each run.
    
    See Also:
    
    Constant Field Values
  - TUNEROUTPUT
```
static final int TUNEROUTPUT
```
    Tuner: Whether to output tuner results and logs to the file system.
    
    See Also:
    
    Constant Field Values
  - PREANALYTICCENTER
```
static final int PREANALYTICCENTER
```
    Determines if analytic centers should be computed and used for variable fixing and the generation of alternative reduced costs (-1: Auto 0: Off, 1: Fixing, 2: Redcost, 3: Both)
    
    See Also:
    
    Constant Field Values
  - NETCUTS
```
static final int NETCUTS
```
    Determines the addition of multi-commodity network cuts to a problem. The parameter is defined as a bit string, and values 1, 2, 4 can be summed up if the user wants more classes of cuts to be added.
    
    See Also:
    
    Constant Field Values
  - LPFLAGS
```
static final int LPFLAGS
```
    A bit-vector control which defines the algorithm for solving an LP problem or the initial LP relaxation of a MIP problem. Values are from enumeration 'LPFLAGS'
    
    See Also:
    
    Constant Field Values
  - MIPKAPPAFREQ
```
static final int MIPKAPPAFREQ
```
    Branch and Bound: Specifies how frequently the basis condition number (also known as kappa) should be calculated during the branch-and-bound search.
    
    See Also:
    
    Constant Field Values
  - OBJSCALEFACTOR
```
static final int OBJSCALEFACTOR
```
    Custom global objective scaling factor, expressed as a power of 2. When set, it overwrites the automatic global objective scaling factor. A value of 0 means no objective scaling. This control is applied for the full solve, and is independent of any extra scaling that may occur specifically for the barrier or simplex solvers. As it is a power of 2, to scale by 16, set the value of the control to 4.
    
    See Also:
    
    Constant Field Values
  - GLOBALFILELOGINTERVAL
```
static final int GLOBALFILELOGINTERVAL
```
    This control sets the interval between progress messages output while writing tree data to the global file, in seconds. The solve is slowed greatly while data is being written to the global file and this output allows the user to see how much progress is being made.
    
    See Also:
    
    Constant Field Values
  - IGNORECONTAINERCPULIMIT
```
static final int IGNORECONTAINERCPULIMIT
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - IGNORECONTAINERMEMORYLIMIT
```
static final int IGNORECONTAINERMEMORYLIMIT
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MIPDUALREDUCTIONS
```
static final int MIPDUALREDUCTIONS
```
    Branch and Bound: Limits operations that can reduce the MIP solution space.
    
    See Also:
    
    Constant Field Values
  - GENCONSDUALREDUCTIONS
```
static final int GENCONSDUALREDUCTIONS
```
    This parameter specifies whether dual reductions should be applied to reduce the number of columns and rows added when transforming general constraints to MIP structs.
    
    See Also:
    
    Constant Field Values
  - PWLDUALREDUCTIONS
```
static final int PWLDUALREDUCTIONS
```
    This parameter specifies whether dual reductions should be applied to reduce the number of columns, rows and SOS-constraints added when transforming piecewise linear objectives and constraints to MIP structs.
    
    See Also:
    
    Constant Field Values
  - BARFAILITERLIMIT
```
static final int BARFAILITERLIMIT
```
    Newton barrier: The maximum number of consecutive iterations that fail to improve the solution in the barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - AUTOSCALING
```
static final int AUTOSCALING
```
    Whether the Optimizer should automatically select between different scaling algorithms. If the SCALING control is set, no automatic scaling will be applied.
    
    See Also:
    
    Constant Field Values
  - GENCONSABSTRANSFORMATION
```
static final int GENCONSABSTRANSFORMATION
```
    This control specifies the reformulation method for absolute value general constraints at the beginning of the search.
    
    See Also:
    
    Constant Field Values
  - COMPUTEJOBPRIORITY
```
static final int COMPUTEJOBPRIORITY
```
    Selects the priority that will be used for remote optimization jobs.
    
    See Also:
    
    Constant Field Values
  - PREFOLDING
```
static final int PREFOLDING
```
    Presolve: Determines if a folding procedure should be used to aggregate continuous columns in an equitable partition.
    
    See Also:
    
    Constant Field Values
  - COMPUTE
```
static final int COMPUTE
```
    Controls whether the next solve is performed directly or on an Insight Compute Interface.
    
    See Also:
    
    Constant Field Values
  - NETSTALLLIMIT
```
static final int NETSTALLLIMIT
```
    Limit the number of degenerate pivots of the network simplex algorithm, before switching to either primal or dual simplex, depending on ALGAFTERNETWORK.
    
    See Also:
    
    Constant Field Values
  - SERIALIZEPREINTSOL
```
static final int SERIALIZEPREINTSOL
```
    Setting SERIALIZEPREINTSOL to 1 will ensure that the preintsol callback will always be fired in a deterministic order during a parallel MIP solve.
    
    See Also:
    
    Constant Field Values
  - PWLNONCONVEXTRANSFORMATION
```
static final int PWLNONCONVEXTRANSFORMATION
```
    This control specifies the reformulation method for piecewise linear constraints at the beginning of the search. Note that the chosen formulation will only be used if MIP entities are necessary but not if presolve detected that a convex reformulation is possible. Furthermore, the binary formulation will only be applied to piecewise linear constraints with bounded input variable, otherwise the SOS2-formulation will be used.
    
    See Also:
    
    Constant Field Values
  - MIPCOMPONENTS
```
static final int MIPCOMPONENTS
```
    Determines whether disconnected components in a MIP should be solved as separate MIPs. There can be significant performence benefits from solving disconnected components individual instead of being part of the main branch-and-bound search.
    
    See Also:
    
    Constant Field Values
  - MIPCONCURRENTNODES
```
static final int MIPCONCURRENTNODES
```
    Sets the node limit for when a winning solve is selected when concurrent MIP solves are enabled. When multiple MIP solves are started, they each run up to the MIPCONCURRENTNODES node limit and only one winning solve is selected for contuinuing the search with.
    
    See Also:
    
    Constant Field Values
  - MIPCONCURRENTSOLVES
```
static final int MIPCONCURRENTSOLVES
```
    Selects the number of concurrent solves to start for a MIP. Each solve will use a unique random seed for its random number generator, but will otherwise apply the same user controls. The first concurrent solve to complete will have solved the MIP and all the concurrent solves will be terminated at this point. Using concurrent solves can be advantageous when a MIP displays a high level of performance variability.
    
    See Also:
    
    Constant Field Values
  - OUTPUTCONTROLS
```
static final int OUTPUTCONTROLS
```
    This control toggles the printing of all control settings at the beginning of the search. This includes the printing of controls that have been explicitly assigned to their default value. All unset controls are omitted as they keep their default value.
    
    See Also:
    
    Constant Field Values
  - SIFTSWITCH
```
static final int SIFTSWITCH
```
    Determines which algorithm to use for solving the subproblems during sifting.
    
    See Also:
    
    Constant Field Values
  - HEUREMPHASIS
```
static final int HEUREMPHASIS
```
    Branch and Bound: This control specifies an emphasis for the search w.r.t. primal heuristics and other procedures that affect the speed of convergence of the primal-dual gap. For problems where the goal is to achieve a small gap but not neccessarily solving them to optimality, it is recommended to set HEUREMPHASIS to 1. This setting triggers many additional heuristic calls, aiming for reducing the gap at the beginning of the search, typically at the expense of an increased time for proving optimality.
    
    See Also:
    
    Constant Field Values
  - COMPUTEMATX
```
static final int COMPUTEMATX
```
    Control of type Integer. Values are from enumeration 'ONOFF'
    
    See Also:
    
    Constant Field Values
  - COMPUTEMATX_IIS
```
static final int COMPUTEMATX_IIS
```
    Control of type Integer. Values are from enumeration 'ONOFF'
    
    See Also:
    
    Constant Field Values
  - COMPUTEMATX_IISMAXTIME
```
static final int COMPUTEMATX_IISMAXTIME
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - BARREFITER
```
static final int BARREFITER
```
    Newton barrier: After terminating the barrier algorithm, further refinement steps can be performed. Such refinement steps are especially helpful if the solution is near to the optimum and can improve primal feasibility and decrease the complementarity gap. It is also often advantageous for the crossover algorithm. BARREFITER specifies the maximum number of such refinement iterations.
    
    See Also:
    
    Constant Field Values
  - COMPUTELOG
```
static final int COMPUTELOG
```
    Controls how the run log is fetched when a solve is performed on an Insight Compute Interface. Values are from enumeration 'enum_compute_log'
    
    See Also:
    
    Constant Field Values
  - SIFTPRESOLVEOPS
```
static final int SIFTPRESOLVEOPS
```
    Determines the presolve operations for solving the subproblems during the sifting algorithm.
    
    See Also:
    
    Constant Field Values
  - ESCAPENAMES
```
static final int ESCAPENAMES
```
    If characters illegal to an mps or lp file should be escaped to guarantee readability, and whether escaped characters should be transformed back when reading such a file.
    
    See Also:
    
    Constant Field Values
  - IOTIMEOUT
```
static final int IOTIMEOUT
```
    The maximum number of seconds to wait for an I/O operation before it is cancelled.
    
    See Also:
    
    Constant Field Values
  - MAXSTALLTIME
```
static final int MAXSTALLTIME
```
    The maximum time in seconds that the Optimizer will continue to search for improving solution after finding a new incumbent.
    
    See Also:
    
    Constant Field Values
  - AUTOCUTTING
```
static final int AUTOCUTTING
```
    Should the Optimizer automatically decide whether to generate cutting planes at local nodes in the tree or not? If the CUTFREQ control is set, no automatic selection will be made and local cutting will be enabled.
    
    See Also:
    
    Constant Field Values
  - ROWS
```
static final int ROWS
```
    Number of rows (i.e. constraints) in the matrix.
    
    See Also:
    
    Constant Field Values
  - SETS
```
static final int SETS
```
    Number of special ordered sets in the matrix.
    
    See Also:
    
    Constant Field Values
  - SETMEMBERS
```
static final int SETMEMBERS
```
    Number of variables within special ordered sets (set members) in the matrix.
    
    See Also:
    
    Constant Field Values
  - ELEMS
```
static final int ELEMS
```
    Number of matrix nonzeros (elements).
    
    See Also:
    
    Constant Field Values
  - PRIMALINFEAS
```
static final int PRIMALINFEAS
```
    Number of primal infeasibilities.
    
    See Also:
    
    Constant Field Values
  - DUALINFEAS
```
static final int DUALINFEAS
```
    Number of dual infeasibilities.
    
    See Also:
    
    Constant Field Values
  - SIMPLEXITER
```
static final int SIMPLEXITER
```
    Number of simplex iterations performed.
    
    See Also:
    
    Constant Field Values
  - LPSTATUS
```
static final int LPSTATUS
```
    LP solution status. Values are from enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIPSTATUS
```
static final int MIPSTATUS
```
    Global (MIP) solution status. Values are from enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - CUTS
```
static final int CUTS
```
    Number of cuts being added to the matrix.
    
    See Also:
    
    Constant Field Values
  - NODES
```
static final int NODES
```
    Number of nodes solved so far in the global search. A node is counted as solved when it is either dropped or branched on.
    
    See Also:
    
    Constant Field Values
  - NODEDEPTH
```
static final int NODEDEPTH
```
    Depth of the current node.
    
    See Also:
    
    Constant Field Values
  - ACTIVENODES
```
static final int ACTIVENODES
```
    Number of outstanding nodes.
    
    See Also:
    
    Constant Field Values
  - MIPSOLNODE
```
static final int MIPSOLNODE
```
    Node at which the last integer feasible solution was found.
    
    See Also:
    
    Constant Field Values
  - MIPSOLS
```
static final int MIPSOLS
```
    Number of integer solutions that have been found.
    
    See Also:
    
    Constant Field Values
  - COLS
```
static final int COLS
```
    Number of columns (i.e. variables) in the matrix.
    
    See Also:
    
    Constant Field Values
  - SPAREROWS
```
static final int SPAREROWS
```
    Number of spare rows in the matrix.
    
    See Also:
    
    Constant Field Values
  - SPARECOLS
```
static final int SPARECOLS
```
    Number of spare columns in the matrix.
    
    See Also:
    
    Constant Field Values
  - SPAREELEMS
```
static final int SPAREELEMS
```
    Number of spare matrix elements in the matrix.
    
    See Also:
    
    Constant Field Values
  - SPAREMIPENTS
```
static final int SPAREMIPENTS
```
    Number of spare global entities in the matrix.
    
    See Also:
    
    Constant Field Values
  - ERRORCODE
```
static final int ERRORCODE
```
    The most recent Optimizer error number that occurred. This is useful to determine the precise error or warning that has occurred, after an Optimizer function has signalled an error by returning a non-zero value. The return value itself is not the error number. Refer to the section for a list of possible error numbers, the errors and warnings that they indicate, and advice on what they mean and how to resolve them. A short error message may be obtained using XPRSgetlasterror, and all messages may be intercepted using the user output callback function; see XPRSaddcbmessage.
    
    See Also:
    
    Constant Field Values
  - MIPINFEAS
```
static final int MIPINFEAS
```
    Number of integer infeasibilities, including violations of special ordered sets, at the current node.
    
    See Also:
    
    Constant Field Values
  - PRESOLVESTATE
```
static final int PRESOLVESTATE
```
    Problem status as a bit map. Values are from enumeration 'PRESOLVESTATE'
    
    See Also:
    
    Constant Field Values
  - PARENTNODE
```
static final int PARENTNODE
```
    The parent node of the current node in the tree search.
    
    See Also:
    
    Constant Field Values
  - NAMELENGTH
```
static final int NAMELENGTH
```
    The length (in 8 character units) of row and column names in the matrix. To allocate a character array to store names, you must allow 8*NAMELENGTH+1 characters per name (the +1 allows for the string terminator character).
    
    See Also:
    
    Constant Field Values
  - QELEMS
```
static final int QELEMS
```
    Number of quadratic elements in the matrix.
    
    See Also:
    
    Constant Field Values
  - NUMIIS
```
static final int NUMIIS
```
    Number of IISs found.
    
    See Also:
    
    Constant Field Values
  - MIPENTS
```
static final int MIPENTS
```
    Number of global entities (i.e. binary, integer, semi-continuous, partial integer, and semi-continuous integer variables) but excluding the number of special ordered sets.
    
    See Also:
    
    Constant Field Values
  - BRANCHVAR
```
static final int BRANCHVAR
```
    The branching variable at a node of the Branch and Bound tree.
    
    See Also:
    
    Constant Field Values
  - MIPTHREADID
```
static final int MIPTHREADID
```
    The ID for the MIP thread.
    
    See Also:
    
    Constant Field Values
  - ALGORITHM
```
static final int ALGORITHM
```
    The algorithm the optimizer currently is running / was running just before completition.
    
    See Also:
    
    Constant Field Values
  - TIME
```
static final int TIME
```
    Time spent solving the problem as measured by the optimizer.
    
    See Also:
    
    Constant Field Values
  - ORIGINALROWS
```
static final int ORIGINALROWS
```
    Number of rows (i.e. constraints) in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - CALLBACKCOUNT_OPTNODE
```
static final int CALLBACKCOUNT_OPTNODE
```
    This attribute counts the number of times the optimal node callback set by XPRSaddcboptnode has been called for the current node, including the current callback call. The value of this attribute should only be used from within the optimal node callback.
    
    See Also:
    
    Constant Field Values
  - CALLBACKCOUNT_CUTMGR
```
static final int CALLBACKCOUNT_CUTMGR
```
    This attribute counts the number of times the cut manager callback set by XPRSaddcbcutmgr has been called for the current node, including the current callback call. The value of this attribute should only be used from within the cut manager callback.
    
    See Also:
    
    Constant Field Values
  - SYSTEMMEMORY
```
static final int SYSTEMMEMORY
```
    The amount of non problem specific memory used by the solver.
    
    See Also:
    
    Constant Field Values
  - ORIGINALQELEMS
```
static final int ORIGINALQELEMS
```
    Number of quadratic elements in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - MAXPROBNAMELENGTH
```
static final int MAXPROBNAMELENGTH
```
    Maximum size of the problem name and also the maximum allowed length of the file or path string for any function that accepts such an argument.
    
    See Also:
    
    Constant Field Values
  - STOPSTATUS
```
static final int STOPSTATUS
```
    Status of the optimization process.
    
    See Also:
    
    Constant Field Values
  - ORIGINALMIPENTS
```
static final int ORIGINALMIPENTS
```
    Number of global entities (i.e. binary, integer, semi-continuous, partial integer, and semi-continuous integer variables) but excluding the number of special ordered sets in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - ORIGINALSETS
```
static final int ORIGINALSETS
```
    Number of special ordered sets in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - ORIGINALSETMEMBERS
```
static final int ORIGINALSETMEMBERS
```
    Number of variables within special ordered sets (set members) in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - SPARESETS
```
static final int SPARESETS
```
    Number of spare sets in the matrix.
    
    See Also:
    
    Constant Field Values
  - SPARESETELEMS
```
static final int SPARESETELEMS
```
    Number of spare set elements in the matrix.
    
    See Also:
    
    Constant Field Values
  - CHECKSONMAXTIME
```
static final int CHECKSONMAXTIME
```
    This attribute is used to set the value of the MAXCHECKSONMAXTIME control. Its value is the number of times the optimizer checked the MAXTIME criterion during the last call to the optimization routine XPRSmipoptimize. If a run terminates on the MAXTIME criterion then the attribute is the negative of the number of times the optimizer checked the MAXTIME criterion up to and including the check when the termination was activated. Note that the attribute is set to zero at the beginning of each call to an optimization routine.
    
    See Also:
    
    Constant Field Values
  - CHECKSONMAXCUTTIME
```
static final int CHECKSONMAXCUTTIME
```
    This attribute is used to set the value of the MAXCHECKSONMAXCUTTIME control. Its value is the number of times the optimizer checked the MAXCUTTIME criterion during the last call to the optimization routine XPRSmipoptimize. If a run terminates cutting operations on the MAXCUTTIME criterion then the attribute is the negative of the number of times the optimizer checked the MAXCUTTIME criterion up to and including the check when the termination was activated. Note that the attribute is set to zero at the beginning of each call to an optimization routine.
    
    See Also:
    
    Constant Field Values
  - ORIGINALCOLS
```
static final int ORIGINALCOLS
```
    Number of columns (i.e. variables) in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - QCELEMS
```
static final int QCELEMS
```
    Number of quadratic row coefficients in the matrix.
    
    See Also:
    
    Constant Field Values
  - QCONSTRAINTS
```
static final int QCONSTRAINTS
```
    Number of rows with quadratic coefficients in the matrix.
    
    See Also:
    
    Constant Field Values
  - ORIGINALQCELEMS
```
static final int ORIGINALQCELEMS
```
    Number of quadratic row coefficients in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - ORIGINALQCONSTRAINTS
```
static final int ORIGINALQCONSTRAINTS
```
    Number of rows with quadratic coefficients in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - PEAKTOTALTREEMEMORYUSAGE
```
static final int PEAKTOTALTREEMEMORYUSAGE
```
    The peak size, in megabytes, that the branch-and-bound search tree reached during the solve. Note that this value will include the uncompressed size of any compressed data and the size of any data saved to the global file.
    
    See Also:
    
    Constant Field Values
  - CURRENTNODE
```
static final int CURRENTNODE
```
    The unique identifier of the current node in the tree search.
    
    See Also:
    
    Constant Field Values
  - TREEMEMORYUSAGE
```
static final int TREEMEMORYUSAGE
```
    The amount of physical memory, in megabytes, currently being used to store the branch-and-bound search tree.
    
    See Also:
    
    Constant Field Values
  - GLOBALFILESIZE
```
static final int GLOBALFILESIZE
```
    The allocated size of the global file, in megabytes. Because data can be removed from the global file during the branch and bound search, the size of the global file is usually greater than the amount of data currently within it (represented by the GLOBALFILEUSAGE attribute).
    
    See Also:
    
    Constant Field Values
  - GLOBALFILEUSAGE
```
static final int GLOBALFILEUSAGE
```
    The number of megabytes of data from the branch-and-bound tree that have been saved to the global file. Note that the actual allocated size of the global file (represented by the GLOBALFILESIZE control) may be greater than this value.
    
    See Also:
    
    Constant Field Values
  - INDICATORS
```
static final int INDICATORS
```
    Number of indicator constrains in the problem.
    
    See Also:
    
    Constant Field Values
  - ORIGINALINDICATORS
```
static final int ORIGINALINDICATORS
```
    Number of indicator constraints in the original matrix before presolving.
    
    See Also:
    
    Constant Field Values
  - CORESPERCPUDETECTED
```
static final int CORESPERCPUDETECTED
```
    Number of logical cores per CPU unit detected by the optimizer, which is the number of threads each CPU can execute.
    
    See Also:
    
    Constant Field Values
  - CPUSDETECTED
```
static final int CPUSDETECTED
```
    Number of CPU units detected by the optimizer.
    
    See Also:
    
    Constant Field Values
  - CORESDETECTED
```
static final int CORESDETECTED
```
    Number of logical cores detected by the optimizer, which is the total number of threads the hardware can execute across all CPUs.
    
    See Also:
    
    Constant Field Values
  - PHYSICALCORESDETECTED
```
static final int PHYSICALCORESDETECTED
```
    The total number of physical cores across all CPUs detected by the optimizer.
    
    See Also:
    
    Constant Field Values
  - PHYSICALCORESPERCPUDETECTED
```
static final int PHYSICALCORESPERCPUDETECTED
```
    The number of physical cores per CPU detected by the optimizer.
    
    See Also:
    
    Constant Field Values
  - BARSING
```
static final int BARSING
```
    Number of linearly dependent binding constraints at the optimal barrier solution. These results in singularities in the Cholesky decomposition during the barrier that may cause numerical troubles. Larger dependence means more chance for numerical difficulties.
    
    See Also:
    
    Constant Field Values
  - BARSINGR
```
static final int BARSINGR
```
    Regularized number of linearly dependent binding constraints at the optimal barrier solution. These results in singularities in the Cholesky decomposition during the barrier that may cause numerical troubles. Larger dependence means more chance for numerical difficulties.
    
    See Also:
    
    Constant Field Values
  - PRESOLVEINDEX
```
static final int PRESOLVEINDEX
```
    Presolve: The row or column index on which presolve detected a problem to be infeasible or unbounded.
    
    See Also:
    
    Constant Field Values
  - CURRENTMEMORY
```
static final int CURRENTMEMORY
```
    The amount of dynamically allocated heap memory by the problem being solved.
    
    See Also:
    
    Constant Field Values
  - PEAKMEMORY
```
static final int PEAKMEMORY
```
    An estimate of the peak amount of dynamically allocated heap memory by the problem.
    
    See Also:
    
    Constant Field Values
  - CONES
```
static final int CONES
```
    Number of second order and rotated second order cones in the problem.
    
    See Also:
    
    Constant Field Values
  - CONEELEMS
```
static final int CONEELEMS
```
    Number of second order cone coefficients in the problem.
    
    See Also:
    
    Constant Field Values
  - TOTALMEMORY
```
static final int TOTALMEMORY
```
    The amount of dynamically allocated heap memory by the optimizer, including all problems currently exsisting.
    
    See Also:
    
    Constant Field Values
  - AVAILABLEMEMORY
```
static final int AVAILABLEMEMORY
```
    The amount of heap memory detected by Xpress as free.
    
    See Also:
    
    Constant Field Values
  - PWLCONS
```
static final int PWLCONS
```
    Number of piecewise linear constraints in the problem.
    
    See Also:
    
    Constant Field Values
  - PWLPOINTS
```
static final int PWLPOINTS
```
    Number of breakpoints of piecewise linear constraints in the problem.
    
    See Also:
    
    Constant Field Values
  - GENCONS
```
static final int GENCONS
```
    Number of general constraints in the problem.
    
    See Also:
    
    Constant Field Values
  - GENCONCOLS
```
static final int GENCONCOLS
```
    Number of input variables in general constraints in the problem.
    
    See Also:
    
    Constant Field Values
  - GENCONVALS
```
static final int GENCONVALS
```
    Number of constant values in general constraints in the problem.
    
    See Also:
    
    Constant Field Values
  - TREERESTARTS
```
static final int TREERESTARTS
```
    Number of in-tree restarts performed.
    
    See Also:
    
    Constant Field Values
  - ORIGINALPWLS
```
static final int ORIGINALPWLS
```
    Number of piecewise linear constraints in the original problem before presolving.
    
    See Also:
    
    Constant Field Values
  - ORIGINALPWLPOINTS
```
static final int ORIGINALPWLPOINTS
```
    Number of breakpoints of piecewise linear constraints in the original problem before presolving.
    
    See Also:
    
    Constant Field Values
  - ORIGINALGENCONS
```
static final int ORIGINALGENCONS
```
    Number of general constraints in the original problem before presolving.
    
    See Also:
    
    Constant Field Values
  - ORIGINALGENCONCOLS
```
static final int ORIGINALGENCONCOLS
```
    Number of input variables in general constraints in the original problem before presolving.
    
    See Also:
    
    Constant Field Values
  - ORIGINALGENCONVALS
```
static final int ORIGINALGENCONVALS
```
    Number of constant values in general constraints in the original problem before presolving.
    
    See Also:
    
    Constant Field Values
  - COMPUTEEXECUTIONS
```
static final int COMPUTEEXECUTIONS
```
    The number of solves executed on a compute server.
    
    See Also:
    
    Constant Field Values
  - MIPSOLTIME
```
static final int MIPSOLTIME
```
    Time at which the last integer feasible solution was found.
    
    See Also:
    
    Constant Field Values
  - MATRIXTOL
```
static final int MATRIXTOL
```
    The zero tolerance on matrix elements. If the value of a matrix element is less than or equal to MATRIXTOL in absolute value, it is treated as zero. The control applies when solving a problem, for an input tolerance see INPUTTOL.
    
    See Also:
    
    Constant Field Values
  - PIVOTTOL
```
static final int PIVOTTOL
```
    Simplex: The zero tolerance for matrix elements. On each iteration, the simplex method seeks a nonzero matrix element to pivot on. Any element with absolute value less than PIVOTTOL is treated as zero for this purpose.
    
    See Also:
    
    Constant Field Values
  - FEASTOL
```
static final int FEASTOL
```
    This tolerance determines when a solution is treated as feasible. If the amount by which a constraint's activity violates its right-hand side or ranged bound is less in absolute magnitude than FEASTOL, then the constraint is treated as satisfied. Similarly, if the amount by which a column violates its bounds is less in absolute magnitude than FEASTOL, those bounds are also treated as satisfied.
    
    See Also:
    
    Constant Field Values
  - OUTPUTTOL
```
static final int OUTPUTTOL
```
    Zero tolerance on print values.
    
    See Also:
    
    Constant Field Values
  - SOSREFTOL
```
static final int SOSREFTOL
```
    The minimum relative gap between the ordering values of elements in a special ordered set. The gap divided by the absolute value of the larger of the two adjacent values must be at least SOSREFTOL.
    
    See Also:
    
    Constant Field Values
  - OPTIMALITYTOL
```
static final int OPTIMALITYTOL
```
    Simplex: This is the zero tolerance for reduced costs. On each iteration, the simplex method searches for a variable to enter the basis which has a negative reduced cost. The candidates are only those variables which have reduced costs less than the negative value of OPTIMALITYTOL.
    
    See Also:
    
    Constant Field Values
  - ETATOL
```
static final int ETATOL
```
    Tolerance on eta elements. During each iteration, the basis inverse is premultiplied by an elementary matrix, which is the identity except for one column - the eta vector. Elements of eta vectors whose absolute value is smaller than ETATOL are taken to be zero in this step.
    
    See Also:
    
    Constant Field Values
  - RELPIVOTTOL
```
static final int RELPIVOTTOL
```
    Simplex: At each iteration a pivot element is chosen within a given column of the matrix. The relative pivot tolerance, RELPIVOTTOL, is the size of the element chosen relative to the largest possible pivot element in the same column.
    
    See Also:
    
    Constant Field Values
  - MIPTOL
```
static final int MIPTOL
```
    Branch and Bound: This is the tolerance within which a decision variable's value is considered to be integral.
    
    See Also:
    
    Constant Field Values
  - MIPTOLTARGET
```
static final int MIPTOLTARGET
```
    Target MIPTOL value used by the automatic MIP solution refiner as defined by REFINEOPS. Negative and zero values are ignored.
    
    See Also:
    
    Constant Field Values
  - BARPERTURB
```
static final int BARPERTURB
```
    Newton barrier: In numerically challenging cases it is often advantageous to apply perturbations on the KKT system to improve its numerical properties. BARPERTURB controlls how much perturbation is allowed during the barrier iterations. By default no perturbation is allowed. Set this parameter with care as larger perturbations may lead to less efficient iterates and the best settings are problem-dependent.
    
    See Also:
    
    Constant Field Values
  - MIPADDCUTOFF
```
static final int MIPADDCUTOFF
```
    Branch and Bound: The amount to add to the objective function of the best integer solution found to give the new CURRMIPCUTOFF. Once an integer solution has been found whose objective function is equal to or better than CURRMIPCUTOFF, improvements on this value may not be interesting unless they are better by at least a certain amount. If MIPADDCUTOFF is nonzero, it will be added to CURRMIPCUTOFF each time an integer solution is found which is better than this new value. This cuts off sections of the tree whose solutions would not represent substantial improvements in the objective function, saving processor time. The control MIPABSSTOP provides a similar function but works in a different way.
    
    See Also:
    
    Constant Field Values
  - MIPABSCUTOFF
```
static final int MIPABSCUTOFF
```
    Branch and Bound: If the user knows that they are interested only in values of the objective function which are better than some value, this can be assigned to MIPABSCUTOFF. This allows the Optimizer to ignore solving any nodes which may yield worse objective values, saving solution time. When a MIP solution is found a new cut off value is calculated and the value can be obtained from the CURRMIPCUTOFF attribute. The value of CURRMIPCUTOFF is calculated using the MIPRELCUTOFF and MIPADDCUTOFF controls.
    
    See Also:
    
    Constant Field Values
  - MIPRELCUTOFF
```
static final int MIPRELCUTOFF
```
    Branch and Bound: Percentage of the LP solution value to be added to the value of the objective function when an integer solution is found, to give the new value of CURRMIPCUTOFF. The effect is to cut off the search in parts of the tree whose best possible objective function would not be substantially better than the current solution. The control MIPRELSTOP provides a similar functionality but works in a different way.
    
    See Also:
    
    Constant Field Values
  - PSEUDOCOST
```
static final int PSEUDOCOST
```
    Branch and Bound: The default pseudo cost used in estimation of the degradation associated with an unexplored node in the tree search. A pseudo cost is associated with each integer decision variable and is an estimate of the amount by which the objective function will be worse if that variable is forced to an integral value.
    
    See Also:
    
    Constant Field Values
  - PENALTY
```
static final int PENALTY
```
    Minimum absolute penalty variable coefficient. BIGM and PENALTY are set by the input routine ( XPRSreadprob ( READPROB)) but may be reset by the user prior to XPRSlpoptimize ( LPOPTIMIZE).
    
    See Also:
    
    Constant Field Values
  - BIGM
```
static final int BIGM
```
    The infeasibility penalty used if the "Big M" method is implemented.
    
    See Also:
    
    Constant Field Values
  - MIPABSSTOP
```
static final int MIPABSSTOP
```
    Branch and Bound: The absolute tolerance determining whether the global search will continue or not. It will terminate if
    | MIPOBJVAL - BESTBOUND| <= MIPABSSTOP
    where MIPOBJVAL is the value of the best solution's objective function, and BESTBOUND is the current best solution bound. For example, to stop the global search when a MIP solution has been found and the Optimizer can guarantee it is within 100 of the optimal solution, set MIPABSSTOP to 100.
    
    See Also:
    
    Constant Field Values
  - MIPRELSTOP
```
static final int MIPRELSTOP
```
    Branch and Bound: This determines when the global search will terminate. Global search will stop if:
    | MIPOBJVAL - BESTBOUND| <= MIPRELSTOP x max(| BESTBOUND|,| MIPOBJVAL|)
    where MIPOBJVAL is the value of the best solution's objective function and BESTBOUND is the current best solution bound. For example, to stop the global search when a MIP solution has been found and the Optimizer can guarantee it is within 5% of the optimal solution, set MIPRELSTOP to 0.05.
    
    See Also:
    
    Constant Field Values
  - CROSSOVERACCURACYTOL
```
static final int CROSSOVERACCURACYTOL
```
    Newton barrier: This control determines how crossover adjusts the default relative pivot tolerance. When re-inversion is necessary, crossover will compare the recalculated working basic solution with the assumed ones just before re-inversion took place. If the error is above this threshold, crossover will adjust the relative pivot tolerance to address the build-up of numerical inaccuracies.
    
    See Also:
    
    Constant Field Values
  - PRIMALPERTURB
```
static final int PRIMALPERTURB
```
    The factor by which the problem will be perturbed prior to optimization by primal simplex. A value of 0.0 results in no perturbation prior to optimization. PRIMALPERTURB, if set to a non-negative value, overrules the value of PERTURB. The control PERTURB is deprecated, the use of PRIMALPERTURB and DUALPERTURB is advised instead. Note the interconnection to the AUTOPERTURB control. If AUTOPERTURB is set to 1, the decision whether to perturb or not is left to the Optimizer. When the problem is automatically perturbed in primal simplex, however, the value of PRIMALPERTURB will be used for perturbation.
    
    See Also:
    
    Constant Field Values
  - DUALPERTURB
```
static final int DUALPERTURB
```
    The factor by which the problem will be perturbed prior to optimization by dual simplex. A value of 0.0 results in no perturbation prior to optimization. DUALPERTURB, if set to a non-negative value, overrules the value of PERTURB. The control PERTURB is deprecated, the use of PRIMALPERTURB and DUALPERTURB is advised instead. Note the interconnection to the AUTOPERTURB control. If AUTOPERTURB is set to 1, the decision whether to perturb or not is left to the Optimizer. When the problem is automatically perturbed in dual simplex, however, the value of DUALPERTURB will be used for perturbation.
    
    See Also:
    
    Constant Field Values
  - BAROBJSCALE
```
static final int BAROBJSCALE
```
    Defines how the barrier scales the objective.
    
    See Also:
    
    Constant Field Values
  - BARRHSSCALE
```
static final int BARRHSSCALE
```
    Defines how the barrier scales the right hand side.
    
    See Also:
    
    Constant Field Values
  - CHOLESKYTOL
```
static final int CHOLESKYTOL
```
    Newton barrier: The tolerance for pivot elements in the Cholesky decomposition of the normal equations coefficient matrix, computed at each iteration of the barrier algorithm. If the absolute value of the pivot element is less than or equal to CHOLESKYTOL, it merits special treatment in the Cholesky decomposition process.
    
    See Also:
    
    Constant Field Values
  - BARGAPSTOP
```
static final int BARGAPSTOP
```
    Newton barrier: This is a convergence parameter, representing the tolerance for the relative duality gap. When the difference between the primal and dual objective function values falls below this tolerance, the Optimizer determines that the optimal solution has been found.
    
    See Also:
    
    Constant Field Values
  - BARDUALSTOP
```
static final int BARDUALSTOP
```
    Newton barrier: This is a convergence parameter, representing the tolerance for dual infeasibilities. If the difference between the constraints and their bounds in the dual problem falls below this tolerance in absolute value, optimization will stop and the current solution will be returned.
    
    See Also:
    
    Constant Field Values
  - BARPRIMALSTOP
```
static final int BARPRIMALSTOP
```
    Newton barrier: This is a convergence parameter, indicating the tolerance for primal infeasibilities. If the difference between the constraints and their bounds in the primal problem falls below this tolerance in absolute value, the Optimizer will terminate and return the current solution.
    
    See Also:
    
    Constant Field Values
  - BARSTEPSTOP
```
static final int BARSTEPSTOP
```
    Newton barrier: A convergence parameter, representing the minimal step size. On each iteration of the barrier algorithm, a step is taken along a computed search direction. If that step size is smaller than BARSTEPSTOP, the Optimizer will terminate and return the current solution.
    
    See Also:
    
    Constant Field Values
  - ELIMTOL
```
static final int ELIMTOL
```
    The Markowitz tolerance for the elimination phase of the presolve.
    
    See Also:
    
    Constant Field Values
  - PERTURB
```
static final int PERTURB
```
    Deprecated.
    
    The control was used to give a factor by which the problem will be perturbed prior to optimization by either simplex algorithm.
    
    See Also:
    
    Constant Field Values
  - MARKOWITZTOL
```
static final int MARKOWITZTOL
```
    The Markowitz tolerance used for the factorization of the basis matrix.
    
    See Also:
    
    Constant Field Values
  - MIPABSGAPNOTIFY
```
static final int MIPABSGAPNOTIFY
```
    Branch and bound: if the gapnotify callback has been set using XPRSaddcbgapnotify, then this callback will be triggered during the global search when the absolute gap reaches or passes the value you set of the MIPRELGAPNOTIFY control.
    
    See Also:
    
    Constant Field Values
  - MIPRELGAPNOTIFY
```
static final int MIPRELGAPNOTIFY
```
    Branch and bound: if the gapnotify callback has been set using XPRSaddcbgapnotify, then this callback will be triggered during the global search when the relative gap reaches or passes the value you set of the MIPRELGAPNOTIFY control.
    
    See Also:
    
    Constant Field Values
  - BARLARGEBOUND
```
static final int BARLARGEBOUND
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - PPFACTOR
```
static final int PPFACTOR
```
    The partial pricing candidate list sizing parameter.
    
    See Also:
    
    Constant Field Values
  - REPAIRINDEFINITEQMAX
```
static final int REPAIRINDEFINITEQMAX
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - BARGAPTARGET
```
static final int BARGAPTARGET
```
    Newton barrier: The target tolerance for the relative duality gap. The barrier algorithm will keep iterating until either BARGAPTARGET is satisfied or until no further improvements are possible. In the latter case, if BARGAPSTOP is satisfied, it will declare the problem optimal.
    
    See Also:
    
    Constant Field Values
  - BARSTARTWEIGHT
```
static final int BARSTARTWEIGHT
```
    Newton barrier: This sets a weight for the warm-start point when warm-start is set for the barrier algorithm. Using larger weight gives more emphasis for the supplied starting point.
    
    See Also:
    
    Constant Field Values
  - BARFREESCALE
```
static final int BARFREESCALE
```
    Defines how the barrier algorithm scales free variables.
    
    See Also:
    
    Constant Field Values
  - SBEFFORT
```
static final int SBEFFORT
```
    Adjusts the overall amount of effort when using strong branching to select an infeasible global entity to branch on.
    
    See Also:
    
    Constant Field Values
  - HEURDIVERANDOMIZE
```
static final int HEURDIVERANDOMIZE
```
    The level of randomization to apply in the diving heuristic. The diving heuristic uses priority weights on rows and columns to determine the order in which to e.g. round fractional columns, or the direction in which to round them. This control determines by how large a random factor these weights should be changed.
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHEFFORT
```
static final int HEURSEARCHEFFORT
```
    Adjusts the overall level of the local search heuristics.
    
    See Also:
    
    Constant Field Values
  - CUTFACTOR
```
static final int CUTFACTOR
```
    Limit on the number of cuts and cut coefficients the optimizer is allowed to add to the matrix during global search. The cuts and cut coefficients are limited by CUTFACTOR times the number of rows and coefficients in the initial matrix.
    
    See Also:
    
    Constant Field Values
  - EIGENVALUETOL
```
static final int EIGENVALUETOL
```
    A quadratic matrix is considered not to be positive semi-definite, if its smallest eigenvalue is smaller than the negative of this value.
    
    See Also:
    
    Constant Field Values
  - INDLINBIGM
```
static final int INDLINBIGM
```
    During presolve, indicator constraints will be linearized using a BigM coefficient whenever that BigM coefficient is small enough. This control defines the largest BigM for which such a linearized version will be added to the problem in addition to the original constraint. If the BigM is even smaller than INDPRELINBIGM, then the original indicator constraint will additionally be dropped from the problem.
    
    See Also:
    
    Constant Field Values
  - TREEMEMORYSAVINGTARGET
```
static final int TREEMEMORYSAVINGTARGET
```
    When the memory used by the branch-and-bound search tree exceeds the limit specified by the TREEMEMORYLIMIT control, the optimizer will try to save memory by writing lower-rated sections of the tree to the global file. The target amount of memory to save will be enough to bring memory usage back below the limit, plus enough extra to give the tree room to grow. The TREEMEMORYSAVINGTARGET control specifies the extra proportion of the tree's size to try to save; for example, if the tree memory limit is 1000Mb and TREEMEMORYSAVINGTARGET is 0.1, when the tree size exceeds 1000Mb the optimizer will try to reduce the tree size to 900Mb. Reducing the value of TREEMEMORYSAVINGTARGET will cause less extra nodes of the tree to be written to the global file, but will result in the memory saving routine being triggered more often (as the tree will have less room in which to grow), which can reduce performance. Increasing the value of TREEMEMORYSAVINGTARGET will cause additional, more highly-rated nodes, of the tree to be written to the global file, which can cause performance issues if these nodes are required later in the solve.
    
    See Also:
    
    Constant Field Values
  - GLOBALFILEBIAS
```
static final int GLOBALFILEBIAS
```
    Deprecated.
    
    See Also:
    
    Constant Field Values
  - INDPRELINBIGM
```
static final int INDPRELINBIGM
```
    During presolve, indicator constraints will be linearized using a BigM coefficient whenever that BigM coefficient is small enough. This control defines the largest BigM for which the original constraint will be replaced by the linearized version. If the BigM is larger than INDPRELINBIGM but smaller than INDLINBIGM, the linearized row will be added but the original indicator constraint is kept as a numerically stable way to check feasibility.
    
    See Also:
    
    Constant Field Values
  - RELAXTREEMEMORYLIMIT
```
static final int RELAXTREEMEMORYLIMIT
```
    When the memory used by the branch and bound search tree exceeds the target specified by the TREEMEMORYLIMIT control, the optimizer will try to reduce this by writing nodes to the global file. In rare cases, usually where the solve has many millions of very small nodes, the tree structural data (which cannot be written to the global file) will grow large enough to approach or exceed the tree's memory target. When this happens, optimizer performance can degrade greatly as the solver makes heavy use of the global file in preference to memory. To prevent this, the solver will automatically relax the tree memory limit when it detects this case; the RELAXTREEMEMORYLIMIT control specifies the proportion of the previous memory limit by which to relax it. Set RELAXTREEMEMORYLIMIT to 0.0 to force the Xpress Optimizer to never relax the tree memory limit in this way.
    
    See Also:
    
    Constant Field Values
  - MIPABSGAPNOTIFYOBJ
```
static final int MIPABSGAPNOTIFYOBJ
```
    Branch and bound: if the gapnotify callback has been set using XPRSaddcbgapnotify, then this callback will be triggered during the global search when the best solution value reaches or passes the value you set of the MIPRELGAPNOTIFYOBJ control.
    
    See Also:
    
    Constant Field Values
  - MIPABSGAPNOTIFYBOUND
```
static final int MIPABSGAPNOTIFYBOUND
```
    Branch and bound: if the gapnotify callback has been set using XPRSaddcbgapnotify, then this callback will be triggered during the global search when the best bound reaches or passes the value you set of the MIPRELGAPNOTIFYBOUND control.
    
    See Also:
    
    Constant Field Values
  - PRESOLVEMAXGROW
```
static final int PRESOLVEMAXGROW
```
    Limit on how much the number of non-zero coefficients is allowed to grow during presolve, specified as a ratio of the number of non-zero coefficients in the original problem.
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHTARGETSIZE
```
static final int HEURSEARCHTARGETSIZE
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - CROSSOVERRELPIVOTTOL
```
static final int CROSSOVERRELPIVOTTOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - CROSSOVERRELPIVOTTOLSAFE
```
static final int CROSSOVERRELPIVOTTOLSAFE
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - DETLOGFREQ
```
static final int DETLOGFREQ
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - MAXIMPLIEDBOUND
```
static final int MAXIMPLIEDBOUND
```
    Presolve: When tighter bounds are calculated during MIP preprocessing, only bounds whose absolute value are smaller than MAXIMPLIEDBOUND will be applied to the problem.
    
    See Also:
    
    Constant Field Values
  - FEASTOLTARGET
```
static final int FEASTOLTARGET
```
    This specifies the target feasibility tolerance for the solution refiner.
    
    See Also:
    
    Constant Field Values
  - OPTIMALITYTOLTARGET
```
static final int OPTIMALITYTOLTARGET
```
    This specifies the target optimality tolerance for the solution refiner.
    
    See Also:
    
    Constant Field Values
  - PRECOMPONENTSEFFORT
```
static final int PRECOMPONENTSEFFORT
```
    Presolve: adjusts the overall effort for the independent component presolver. This control affects working limits for the subproblem solving as well as thresholds when it is called. Increase to put more emphasis on component presolving.
    
    See Also:
    
    Constant Field Values
  - LPLOGDELAY
```
static final int LPLOGDELAY
```
    Time interval between two LP log lines.
    
    See Also:
    
    Constant Field Values
  - HEURDIVEITERLIMIT
```
static final int HEURDIVEITERLIMIT
```
    Branch and Bound: Simplex iteration limit for reoptimizing during the diving heuristic.
    
    See Also:
    
    Constant Field Values
  - BARKERNEL
```
static final int BARKERNEL
```
    Newton barrier: Defines how centrality is weighted in the barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - FEASTOLPERTURB
```
static final int FEASTOLPERTURB
```
    This tolerance determines how much a feasible primal basic solution is allowed to be perturbed when performing basis changes. The tolerance FEASTOL is always considered as an upper limit for the perturbations, but in some cases smaller value can be more desirable.
    
    See Also:
    
    Constant Field Values
  - CROSSOVERFEASWEIGHT
```
static final int CROSSOVERFEASWEIGHT
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - LUPIVOTTOL
```
static final int LUPIVOTTOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - MIPRESTARTGAPTHRESHOLD
```
static final int MIPRESTARTGAPTHRESHOLD
```
    Branch and Bound: Initial gap threshold to delay in-tree restart. The restart is delayed initially if the gap, given as a fraction between 0 and 1, is below this threshold. The optimizer adjusts the threshold every time a restart is delayed. Note that there are other criteria that can delay or prevent a restart.
    
    See Also:
    
    Constant Field Values
  - NODEPROBINGEFFORT
```
static final int NODEPROBINGEFFORT
```
    Adjusts the overall level of node probing.
    
    See Also:
    
    Constant Field Values
  - INPUTTOL
```
static final int INPUTTOL
```
    The tolerance on input values elements. If any value is than or equal to INPUTTOL in absolute value, it is treated as zero. The control applies to input functions. For the internal zero tolerance see MATRIXTOL.
    
    See Also:
    
    Constant Field Values
  - MIPRESTARTFACTOR
```
static final int MIPRESTARTFACTOR
```
    Branch and Bound: Fine tune initial conditions to trigger an in-tree restart. Use a value > 1 to increase the aggressiveness with which the Optimizer restarts. Use a value < 1 to relax the aggressiveness with which the Optimizer restarts. Note that this control does not affect the initial condition on the gap, which must be set separately.
    
    See Also:
    
    Constant Field Values
  - BAROBJPERTURB
```
static final int BAROBJPERTURB
```
    Defines how the barrier perturbs the objective.
    
    See Also:
    
    Constant Field Values
  - LPOBJVAL
```
static final int LPOBJVAL
```
    Value of the objective function of the last LP solved.
    
    See Also:
    
    Constant Field Values
  - SUMPRIMALINF
```
static final int SUMPRIMALINF
```
    Scaled sum of primal infeasibilities.
    
    See Also:
    
    Constant Field Values
  - MIPOBJVAL
```
static final int MIPOBJVAL
```
    Objective function value of the last integer solution found.
    
    See Also:
    
    Constant Field Values
  - BESTBOUND
```
static final int BESTBOUND
```
    Value of the best bound determined so far by the global search.
    
    See Also:
    
    Constant Field Values
  - OBJRHS
```
static final int OBJRHS
```
    Fixed part of the objective function.
    
    See Also:
    
    Constant Field Values
  - MIPBESTOBJVAL
```
static final int MIPBESTOBJVAL
```
    Objective function value of the best integer solution found.
    
    See Also:
    
    Constant Field Values
  - OBJSENSE
```
static final int OBJSENSE
```
    Sense of the optimization being performed.
    
    See Also:
    
    Constant Field Values
  - BRANCHVALUE
```
static final int BRANCHVALUE
```
    The value of the branching variable at a node of the Branch and Bound tree.
    
    See Also:
    
    Constant Field Values
  - PENALTYVALUE
```
static final int PENALTYVALUE
```
    The weighted sum of violations in the solution to the relaxed problem identified by the infeasibility repair function.
    
    See Also:
    
    Constant Field Values
  - CURRMIPCUTOFF
```
static final int CURRMIPCUTOFF
```
    The current MIP cut off.
    
    See Also:
    
    Constant Field Values
  - BARCONDA
```
static final int BARCONDA
```
    Absolute condition measure calculated in the last iteration of the barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - BARCONDD
```
static final int BARCONDD
```
    Condition measure calculated in the last iteration of the barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - MAXABSPRIMALINFEAS
```
static final int MAXABSPRIMALINFEAS
```
    Maximum calculated absolute primal infeasibility in the unscaled original problem.
    
    See Also:
    
    Constant Field Values
  - MAXRELPRIMALINFEAS
```
static final int MAXRELPRIMALINFEAS
```
    Maximum calculated relative primal infeasibility in the unscaled original problem.
    
    See Also:
    
    Constant Field Values
  - MAXABSDUALINFEAS
```
static final int MAXABSDUALINFEAS
```
    Maximum calculated absolute dual infeasibility in the unscaled original problem.
    
    See Also:
    
    Constant Field Values
  - MAXRELDUALINFEAS
```
static final int MAXRELDUALINFEAS
```
    Maximum calculated relative dual infeasibility in the unscaled original problem.
    
    See Also:
    
    Constant Field Values
  - PRIMALDUALINTEGRAL
```
static final int PRIMALDUALINTEGRAL
```
    Value of the primal-dual integral.
    
    See Also:
    
    Constant Field Values
  - MAXMIPINFEAS
```
static final int MAXMIPINFEAS
```
    Maximum integer fractionality in the solution.
    
    See Also:
    
    Constant Field Values
  - ATTENTIONLEVEL
```
static final int ATTENTIONLEVEL
```
    A measure between 0 and 1 for how numerically unstable the problem is. The attention level is based on a weighted combination of the number of basis condition numbers exceeding certain thresholds. It considers all nodes sampled by MIPKAPPAFREQ, with a setting of 1 being the most frequent sampling rate. The higher the attention level, the worse conditioned is the problem.
    
    See Also:
    
    Constant Field Values
  - MAXKAPPA
```
static final int MAXKAPPA
```
    Largest basis condition number (also known as kappa) calculated through all nodes sampled by MIPKAPPAFREQ.
    
    See Also:
    
    Constant Field Values
  - TREECOMPLETION
```
static final int TREECOMPLETION
```
    Estimation of the relative completion of the search tree as fraction between 0 and 1. Its accuracy mainly depends on the level of degeneracy of a problem and the balancedness of the search tree.
    
    See Also:
    
    Constant Field Values
  - PREDICTEDATTLEVEL
```
static final int PREDICTEDATTLEVEL
```
    A measure between 0 and 1 to predict how numerically unstable the current MIP solve can be expected to be. After the root LP solve, a machine learning model is used to predict the actual ATTENTIONLEVEL which will only be computed if MIPKAPPAFREQ is set to a nonzero value. If the predicted attention level exceeds a value of 0.1, a message will be printed to the log.
    
    See Also:
    
    Constant Field Values
  - MPSRHSNAME
```
static final int MPSRHSNAME
```
    The right hand side name sought in the MPS file. As with all string controls, this is of length 64 characters plus a null terminator, \0.
    
    See Also:
    
    Constant Field Values
  - MPSOBJNAME
```
static final int MPSOBJNAME
```
    The objective function name sought in the MPS file. If the original MPS objective row is no longer in the matrix, this control can be set to name the neutral row representing the objective in the MPS file. As with all string controls, this is of length 64 characters plus a null terminator, \0.
    
    See Also:
    
    Constant Field Values
  - MPSRANGENAME
```
static final int MPSRANGENAME
```
    The range name sought in the MPS file. As with all string controls, this is of length 64 characters plus a null terminator, \0.
    
    See Also:
    
    Constant Field Values
  - MPSBOUNDNAME
```
static final int MPSBOUNDNAME
```
    The bound name sought in the MPS file. As with all string controls, this is of length 64 characters plus a null terminator, \0.
    
    See Also:
    
    Constant Field Values
  - OUTPUTMASK
```
static final int OUTPUTMASK
```
    Mask to restrict the row and column names written to file. As with all string controls, this is of length 64 characters plus a null terminator, \0.
    
    See Also:
    
    Constant Field Values
  - TUNERMETHODFILE
```
static final int TUNERMETHODFILE
```
    Tuner: Defines a file from which the tuner can read user-defined tuner method.
    
    See Also:
    
    Constant Field Values
  - TUNEROUTPUTPATH
```
static final int TUNEROUTPUTPATH
```
    Tuner: Defines a root path to which the tuner writes the result file and logs.
    
    See Also:
    
    Constant Field Values
  - TUNERSESSIONNAME
```
static final int TUNERSESSIONNAME
```
    Tuner: Defines a session name for the tuner.
    
    See Also:
    
    Constant Field Values
  - COMPUTEEXECSERVICE
```
static final int COMPUTEEXECSERVICE
```
    Selects the Insight execution service that will be used for solving remote optimizations.
    
    See Also:
    
    Constant Field Values
  - MATRIXNAME
```
static final int MATRIXNAME
```
    The matrix name.
    
    See Also:
    
    Constant Field Values
  - BOUNDNAME
```
static final int BOUNDNAME
```
    Active bound name.
    
    See Also:
    
    Constant Field Values
  - OBJNAME
```
static final int OBJNAME
```
    Active objective function row name.
    
    See Also:
    
    Constant Field Values
  - RHSNAME
```
static final int RHSNAME
```
    Active right hand side name.
    
    See Also:
    
    Constant Field Values
  - RANGENAME
```
static final int RANGENAME
```
    Active range name.
    
    See Also:
    
    Constant Field Values
  - XPRESSVERSION
```
static final int XPRESSVERSION
```
    The Xpress version number.
    
    See Also:
    
    Constant Field Values
  - UUID
```
static final int UUID
```
    Universally Unique Identifier for the problem instance.
    
    See Also:
    
    Constant Field Values
  - BARPRIMALOBJ
```
static final int BARPRIMALOBJ
```
    Primal objective value calculated by the Newton barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - BARDUALOBJ
```
static final int BARDUALOBJ
```
    Dual objective value calculated by the Newton barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - BARPRIMALINF
```
static final int BARPRIMALINF
```
    Sum of the primal infeasibilities for the Newton barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - BARDUALINF
```
static final int BARDUALINF
```
    Sum of the dual infeasibilities for the Newton barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - BARCGAP
```
static final int BARCGAP
```
    Convergence criterion for the Newton barrier algorithm.
    
    See Also:
    
    Constant Field Values
  - BARITER
```
static final int BARITER
```
    Number of Newton barrier iterations.
    
    See Also:
    
    Constant Field Values
  - BARAASIZE
```
static final int BARAASIZE
```
    Number of nonzeros in AA ^T.
    
    See Also:
    
    Constant Field Values
  - BARLSIZE
```
static final int BARLSIZE
```
    Number of nonzeros in L resulting from the Cholesky factorization.
    
    See Also:
    
    Constant Field Values
  - BARDENSECOL
```
static final int BARDENSECOL
```
    Number of dense columns found in the matrix.
    
    See Also:
    
    Constant Field Values
  - BARCROSSOVER
```
static final int BARCROSSOVER
```
    Indicates whether or not the basis crossover phase has been entered.
    
    See Also:
    
    Constant Field Values
  - MSP_DUPLICATESOLUTIONSPOLICY
```
static final int MSP_DUPLICATESOLUTIONSPOLICY
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOLUTIONS
```
static final int MSP_SOLUTIONS
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_DEFAULTUSERSOLFEASTOL
```
static final int MSP_DEFAULTUSERSOLFEASTOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - MSP_DEFAULTUSERSOLMIPTOL
```
static final int MSP_DEFAULTUSERSOLMIPTOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - MSP_INCLUDEPROBNAMEINLOGGING
```
static final int MSP_INCLUDEPROBNAMEINLOGGING
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_WRITESLXSOLLOGGING
```
static final int MSP_WRITESLXSOLLOGGING
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_ENABLESLACKSTORAGE
```
static final int MSP_ENABLESLACKSTORAGE
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_OUTPUTLOG
```
static final int MSP_OUTPUTLOG
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_PRB_VALIDSOLS
```
static final int MSP_PRB_VALIDSOLS
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_PRB_FEASIBLESOLS
```
static final int MSP_PRB_FEASIBLESOLS
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_COLS
```
static final int MSP_SOL_COLS
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_NONZEROS
```
static final int MSP_SOL_NONZEROS
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_FEASTOL
```
static final int MSP_SOL_FEASTOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_MIPTOL
```
static final int MSP_SOL_MIPTOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_ISUSERSOLUTION
```
static final int MSP_SOL_ISUSERSOLUTION
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_ISREPROCESSEDUSERSOLUTION
```
static final int MSP_SOL_ISREPROCESSEDUSERSOLUTION
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_BITFIELDSUSR
```
static final int MSP_SOL_BITFIELDSUSR
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOL_BITFIELDSSYS
```
static final int MSP_SOL_BITFIELDSSYS
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOLPRB_OBJ
```
static final int MSP_SOLPRB_OBJ
```
    Attribute of type Double.
    
    See Also:
    
    Constant Field Values
  - MSP_SOLPRB_INFEASCOUNT
```
static final int MSP_SOLPRB_INFEASCOUNT
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOLPRB_INFSUM_PRIMAL
```
static final int MSP_SOLPRB_INFSUM_PRIMAL
```
    Attribute of type Double.
    
    See Also:
    
    Constant Field Values
  - MSP_SOLPRB_INFCNT_PRIMAL
```
static final int MSP_SOLPRB_INFCNT_PRIMAL
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSP_SOLPRB_INFSUM_MIP
```
static final int MSP_SOLPRB_INFSUM_MIP
```
    Attribute of type Double.
    
    See Also:
    
    Constant Field Values
  - MSP_SOLPRB_INFCNT_MIP
```
static final int MSP_SOLPRB_INFCNT_MIP
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_SOLUTIONS
```
static final int MSE_SOLUTIONS
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_CALLBACKCULLSOLS_MIPOBJECT
```
static final int MSE_CALLBACKCULLSOLS_MIPOBJECT
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_CALLBACKCULLSOLS_DIVERSITY
```
static final int MSE_CALLBACKCULLSOLS_DIVERSITY
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_CALLBACKCULLSOLS_MODOBJECT
```
static final int MSE_CALLBACKCULLSOLS_MODOBJECT
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_METRIC_MIPOBJECT
```
static final int MSE_METRIC_MIPOBJECT
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_METRIC_DIVERSITY
```
static final int MSE_METRIC_DIVERSITY
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_METRIC_MODOBJECT
```
static final int MSE_METRIC_MODOBJECT
```
    Attribute of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_OPTIMIZEDIVERSITY
```
static final int MSE_OPTIMIZEDIVERSITY
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - MSE_DIVERSITYSUM
```
static final int MSE_DIVERSITYSUM
```
    Attribute of type Double.
    
    See Also:
    
    Constant Field Values
  - MSE_OUTPUTTOL
```
static final int MSE_OUTPUTTOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - MSE_OUTPUTLOG
```
static final int MSE_OUTPUTLOG
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - LP_UNSTARTED
```
static final int LP_UNSTARTED
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_OPTIMAL
```
static final int LP_OPTIMAL
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_INFEAS
```
static final int LP_INFEAS
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_CUTOFF
```
static final int LP_CUTOFF
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_UNFINISHED
```
static final int LP_UNFINISHED
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_UNBOUNDED
```
static final int LP_UNBOUNDED
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_CUTOFF_IN_DUAL
```
static final int LP_CUTOFF_IN_DUAL
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_UNSOLVED
```
static final int LP_UNSOLVED
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - LP_NONCONVEX
```
static final int LP_NONCONVEX
```
    Constant used in enumeration 'LPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_NOT_LOADED
```
static final int MIP_NOT_LOADED
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_LP_NOT_OPTIMAL
```
static final int MIP_LP_NOT_OPTIMAL
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_LP_OPTIMAL
```
static final int MIP_LP_OPTIMAL
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_NO_SOL_FOUND
```
static final int MIP_NO_SOL_FOUND
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_SOLUTION
```
static final int MIP_SOLUTION
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_INFEAS
```
static final int MIP_INFEAS
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_OPTIMAL
```
static final int MIP_OPTIMAL
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - MIP_UNBOUNDED
```
static final int MIP_UNBOUNDED
```
    Constant used in enumeration 'MIPSTATUS'
    
    See Also:
    
    Constant Field Values
  - BAR_DEFAULT
```
static final int BAR_DEFAULT
```
    Constant used in enumeration 'BARORDER'
    
    See Also:
    
    Constant Field Values
  - BAR_MIN_DEGREE
```
static final int BAR_MIN_DEGREE
```
    Constant used in enumeration 'BARORDER'
    
    See Also:
    
    Constant Field Values
  - BAR_MIN_LOCAL_FILL
```
static final int BAR_MIN_LOCAL_FILL
```
    Constant used in enumeration 'BARORDER'
    
    See Also:
    
    Constant Field Values
  - BAR_NESTED_DISSECTION
```
static final int BAR_NESTED_DISSECTION
```
    Constant used in enumeration 'BARORDER'
    
    See Also:
    
    Constant Field Values
  - ALG_DEFAULT
```
static final int ALG_DEFAULT
```
    Constant used in enumeration 'DEFAULTALG'
    
    See Also:
    
    Constant Field Values
  - ALG_DUAL
```
static final int ALG_DUAL
```
    Constant used in enumeration 'DEFAULTALG'
    
    See Also:
    
    Constant Field Values
  - ALG_PRIMAL
```
static final int ALG_PRIMAL
```
    Constant used in enumeration 'DEFAULTALG'
    
    See Also:
    
    Constant Field Values
  - ALG_BARRIER
```
static final int ALG_BARRIER
```
    Constant used in enumeration 'DEFAULTALG'
    
    See Also:
    
    Constant Field Values
  - ALG_NETWORK
```
static final int ALG_NETWORK
```
    Constant used in enumeration 'DEFAULTALG'
    
    See Also:
    
    Constant Field Values
  - STOP_NONE
```
static final int STOP_NONE
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_TIMELIMIT
```
static final int STOP_TIMELIMIT
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_CTRLC
```
static final int STOP_CTRLC
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_NODELIMIT
```
static final int STOP_NODELIMIT
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_ITERLIMIT
```
static final int STOP_ITERLIMIT
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_MIPGAP
```
static final int STOP_MIPGAP
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_SOLLIMIT
```
static final int STOP_SOLLIMIT
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_GLOBALERROR
```
static final int STOP_GLOBALERROR
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_MEMORYERROR
```
static final int STOP_MEMORYERROR
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_USER
```
static final int STOP_USER
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_INFEASIBLE
```
static final int STOP_INFEASIBLE
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_LICENSELOST
```
static final int STOP_LICENSELOST
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - ANA_AUTOMATIC
```
static final int ANA_AUTOMATIC
```
    Constant used in enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - ANA_NEVER
```
static final int ANA_NEVER
```
    Constant used in enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - ANA_ALWAYS
```
static final int ANA_ALWAYS
```
    Constant used in enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - BOOL_OFF
```
static final int BOOL_OFF
```
    Constant used in enumeration 'ONOFF'
    
    See Also:
    
    Constant Field Values
  - BOOL_ON
```
static final int BOOL_ON
```
    Constant used in enumeration 'ONOFF'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_BEST_ESTIMATE
```
static final int BACKTRACKALG_BEST_ESTIMATE
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_BEST_BOUND
```
static final int BACKTRACKALG_BEST_BOUND
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_DEEPEST_NODE
```
static final int BACKTRACKALG_DEEPEST_NODE
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_HIGHEST_NODE
```
static final int BACKTRACKALG_HIGHEST_NODE
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_EARLIEST_NODE
```
static final int BACKTRACKALG_EARLIEST_NODE
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_LATEST_NODE
```
static final int BACKTRACKALG_LATEST_NODE
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_RANDOM
```
static final int BACKTRACKALG_RANDOM
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_MIN_INFEAS
```
static final int BACKTRACKALG_MIN_INFEAS
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_BEST_ESTIMATE_MIN_INFEAS
```
static final int BACKTRACKALG_BEST_ESTIMATE_MIN_INFEAS
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BACKTRACKALG_DEEPEST_BEST_ESTIMATE
```
static final int BACKTRACKALG_DEEPEST_BEST_ESTIMATE
```
    Constant used in enumeration 'BACKTRACKALG'
    
    See Also:
    
    Constant Field Values
  - BRANCH_MIN_EST_FIRST
```
static final int BRANCH_MIN_EST_FIRST
```
    Constant used in enumeration 'BRANCHCHOICE'
    
    See Also:
    
    Constant Field Values
  - BRANCH_MAX_EST_FIRST
```
static final int BRANCH_MAX_EST_FIRST
```
    Constant used in enumeration 'BRANCHCHOICE'
    
    See Also:
    
    Constant Field Values
  - ALG_PULL_CHOLESKY
```
static final int ALG_PULL_CHOLESKY
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_PUSH_CHOLESKY
```
static final int ALG_PUSH_CHOLESKY
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - XDRPBEFORE_CROSSOVER
```
static final int XDRPBEFORE_CROSSOVER
```
    Constant used in enumeration 'CROSSOVERDRP'
    
    See Also:
    
    Constant Field Values
  - XDRPINSIDE_CROSSOVER
```
static final int XDRPINSIDE_CROSSOVER
```
    Constant used in enumeration 'CROSSOVERDRP'
    
    See Also:
    
    Constant Field Values
  - XDRPAGGRESSIVE_BEFORE_CROSSOVER
```
static final int XDRPAGGRESSIVE_BEFORE_CROSSOVER
```
    Constant used in enumeration 'CROSSOVERDRP'
    
    See Also:
    
    Constant Field Values
  - DUALGRADIENT_AUTOMATIC
```
static final int DUALGRADIENT_AUTOMATIC
```
    Constant used in enumeration 'DUALGRADIENT'
    
    See Also:
    
    Constant Field Values
  - DUALGRADIENT_DEVEX
```
static final int DUALGRADIENT_DEVEX
```
    Constant used in enumeration 'DUALGRADIENT'
    
    See Also:
    
    Constant Field Values
  - DUALGRADIENT_STEEPESTEDGE
```
static final int DUALGRADIENT_STEEPESTEDGE
```
    Constant used in enumeration 'DUALGRADIENT'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_REMOVE_INFEAS_WITH_PRIMAL
```
static final int DUALSTRATEGY_REMOVE_INFEAS_WITH_PRIMAL
```
    Constant used in enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_REMOVE_INFEAS_WITH_DUAL
```
static final int DUALSTRATEGY_REMOVE_INFEAS_WITH_DUAL
```
    Constant used in enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - FEASIBILITYPUMP_AUTOMATIC
```
static final int FEASIBILITYPUMP_AUTOMATIC
```
    Constant used in enumeration 'FEASIBILITYPUMP'
    
    See Also:
    
    Constant Field Values
  - FEASIBILITYPUMP_NEVER
```
static final int FEASIBILITYPUMP_NEVER
```
    Constant used in enumeration 'FEASIBILITYPUMP'
    
    See Also:
    
    Constant Field Values
  - FEASIBILITYPUMP_ALWAYS
```
static final int FEASIBILITYPUMP_ALWAYS
```
    Constant used in enumeration 'FEASIBILITYPUMP'
    
    See Also:
    
    Constant Field Values
  - FEASIBILITYPUMP_LASTRESORT
```
static final int FEASIBILITYPUMP_LASTRESORT
```
    Constant used in enumeration 'FEASIBILITYPUMP'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_LOCAL_SEARCH_LARGE_NEIGHBOURHOOD
```
static final int HEURSEARCH_LOCAL_SEARCH_LARGE_NEIGHBOURHOOD
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_LOCAL_SEARCH_NODE_NEIGHBOURHOOD
```
static final int HEURSEARCH_LOCAL_SEARCH_NODE_NEIGHBOURHOOD
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_LOCAL_SEARCH_SOLUTION_NEIGHBOURHOOD
```
static final int HEURSEARCH_LOCAL_SEARCH_SOLUTION_NEIGHBOURHOOD
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_AUTOMATIC
```
static final int HEURSTRATEGY_AUTOMATIC
```
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_NONE
```
static final int HEURSTRATEGY_NONE
```
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_BASIC
```
static final int HEURSTRATEGY_BASIC
```
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_ENHANCED
```
static final int HEURSTRATEGY_ENHANCED
```
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_EXTENSIVE
```
static final int HEURSTRATEGY_EXTENSIVE
```
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - NODESELECTION_LOCAL_FIRST
```
static final int NODESELECTION_LOCAL_FIRST
```
    Constant used in enumeration 'NODESELECTION'
    
    See Also:
    
    Constant Field Values
  - NODESELECTION_BEST_FIRST
```
static final int NODESELECTION_BEST_FIRST
```
    Constant used in enumeration 'NODESELECTION'
    
    See Also:
    
    Constant Field Values
  - NODESELECTION_LOCAL_DEPTH_FIRST
```
static final int NODESELECTION_LOCAL_DEPTH_FIRST
```
    Constant used in enumeration 'NODESELECTION'
    
    See Also:
    
    Constant Field Values
  - NODESELECTION_BEST_FIRST_THEN_LOCAL_FIRST
```
static final int NODESELECTION_BEST_FIRST_THEN_LOCAL_FIRST
```
    Constant used in enumeration 'NODESELECTION'
    
    See Also:
    
    Constant Field Values
  - NODESELECTION_DEPTH_FIRST
```
static final int NODESELECTION_DEPTH_FIRST
```
    Constant used in enumeration 'NODESELECTION'
    
    See Also:
    
    Constant Field Values
  - OUTPUTLOG_NO_OUTPUT
```
static final int OUTPUTLOG_NO_OUTPUT
```
    Constant used in enumeration 'OUTPUTLOG'
    
    See Also:
    
    Constant Field Values
  - OUTPUTLOG_FULL_OUTPUT
```
static final int OUTPUTLOG_FULL_OUTPUT
```
    Constant used in enumeration 'OUTPUTLOG'
    
    See Also:
    
    Constant Field Values
  - OUTPUTLOG_ERRORS_AND_WARNINGS
```
static final int OUTPUTLOG_ERRORS_AND_WARNINGS
```
    Constant used in enumeration 'OUTPUTLOG'
    
    See Also:
    
    Constant Field Values
  - OUTPUTLOG_ERRORS
```
static final int OUTPUTLOG_ERRORS
```
    Constant used in enumeration 'OUTPUTLOG'
    
    See Also:
    
    Constant Field Values
  - PREPROBING_AUTOMATIC
```
static final int PREPROBING_AUTOMATIC
```
    Constant used in enumeration 'PREPROBING'
    
    See Also:
    
    Constant Field Values
  - PREPROBING_DISABLED
```
static final int PREPROBING_DISABLED
```
    Constant used in enumeration 'PREPROBING'
    
    See Also:
    
    Constant Field Values
  - PREPROBING_LIGHT
```
static final int PREPROBING_LIGHT
```
    Constant used in enumeration 'PREPROBING'
    
    See Also:
    
    Constant Field Values
  - PREPROBING_FULL
```
static final int PREPROBING_FULL
```
    Constant used in enumeration 'PREPROBING'
    
    See Also:
    
    Constant Field Values
  - PREPROBING_FULL_AND_REPEAT
```
static final int PREPROBING_FULL_AND_REPEAT
```
    Constant used in enumeration 'PREPROBING'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_SINGLETONCOLUMNREMOVAL
```
static final int PRESOLVEOPS_SINGLETONCOLUMNREMOVAL
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_SINGLETONROWREMOVAL
```
static final int PRESOLVEOPS_SINGLETONROWREMOVAL
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_FORCINGROWREMOVAL
```
static final int PRESOLVEOPS_FORCINGROWREMOVAL
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_DUALREDUCTIONS
```
static final int PRESOLVEOPS_DUALREDUCTIONS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_REDUNDANTROWREMOVAL
```
static final int PRESOLVEOPS_REDUNDANTROWREMOVAL
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_DUPLICATECOLUMNREMOVAL
```
static final int PRESOLVEOPS_DUPLICATECOLUMNREMOVAL
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_DUPLICATEROWREMOVAL
```
static final int PRESOLVEOPS_DUPLICATEROWREMOVAL
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_STRONGDUALREDUCTIONS
```
static final int PRESOLVEOPS_STRONGDUALREDUCTIONS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_VARIABLEELIMINATIONS
```
static final int PRESOLVEOPS_VARIABLEELIMINATIONS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOIPREDUCTIONS
```
static final int PRESOLVEOPS_NOIPREDUCTIONS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOGLOBALDOMAINCHANGE
```
static final int PRESOLVEOPS_NOGLOBALDOMAINCHANGE
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOADVANCEDIPREDUCTIONS
```
static final int PRESOLVEOPS_NOADVANCEDIPREDUCTIONS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_LINEARLYDEPENDANTROWREMOVAL
```
static final int PRESOLVEOPS_LINEARLYDEPENDANTROWREMOVAL
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOINTEGERVARIABLEANDSOSDETECTION
```
static final int PRESOLVEOPS_NOINTEGERVARIABLEANDSOSDETECTION
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NODUALREDONGLOBALS
```
static final int PRESOLVEOPS_NODUALREDONGLOBALS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVESTATE_PROBLEMLOADED
```
static final int PRESOLVESTATE_PROBLEMLOADED
```
    Constant used in enumeration 'PRESOLVESTATE'
    
    See Also:
    
    Constant Field Values
  - PRESOLVESTATE_PROBLEMLPPRESOLVED
```
static final int PRESOLVESTATE_PROBLEMLPPRESOLVED
```
    Constant used in enumeration 'PRESOLVESTATE'
    
    See Also:
    
    Constant Field Values
  - PRESOLVESTATE_PROBLEMMIPPRESOLVED
```
static final int PRESOLVESTATE_PROBLEMMIPPRESOLVED
```
    Constant used in enumeration 'PRESOLVESTATE'
    
    See Also:
    
    Constant Field Values
  - PRESOLVESTATE_SOLUTIONVALID
```
static final int PRESOLVESTATE_SOLUTIONVALID
```
    Constant used in enumeration 'PRESOLVESTATE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_REDUCED_COST_FIXING
```
static final int MIPPRESOLVE_REDUCED_COST_FIXING
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_LOGIC_PREPROCESSING
```
static final int MIPPRESOLVE_LOGIC_PREPROCESSING
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_ALLOW_CHANGE_BOUNDS
```
static final int MIPPRESOLVE_ALLOW_CHANGE_BOUNDS
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_DUAL_REDUCTIONS
```
static final int MIPPRESOLVE_DUAL_REDUCTIONS
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_GLOBAL_COEFFICIENT_TIGHTENING
```
static final int MIPPRESOLVE_GLOBAL_COEFFICIENT_TIGHTENING
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_OBJECTIVE_BASED_REDUCTIONS
```
static final int MIPPRESOLVE_OBJECTIVE_BASED_REDUCTIONS
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_ALLOW_TREE_RESTART
```
static final int MIPPRESOLVE_ALLOW_TREE_RESTART
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_SYMMETRY_REDUCTIONS
```
static final int MIPPRESOLVE_SYMMETRY_REDUCTIONS
```
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - PRESOLVE_NOPRIMALINFEASIBILITY
```
static final int PRESOLVE_NOPRIMALINFEASIBILITY
```
    Constant used in enumeration 'PRESOLVE'
    
    See Also:
    
    Constant Field Values
  - PRESOLVE_NONE
```
static final int PRESOLVE_NONE
```
    Constant used in enumeration 'PRESOLVE'
    
    See Also:
    
    Constant Field Values
  - PRESOLVE_DEFAULT
```
static final int PRESOLVE_DEFAULT
```
    Constant used in enumeration 'PRESOLVE'
    
    See Also:
    
    Constant Field Values
  - PRESOLVE_KEEPREDUNDANTBOUNDS
```
static final int PRESOLVE_KEEPREDUNDANTBOUNDS
```
    Constant used in enumeration 'PRESOLVE'
    
    See Also:
    
    Constant Field Values
  - PRICING_PARTIAL
```
static final int PRICING_PARTIAL
```
    Constant used in enumeration 'PRICING'
    
    See Also:
    
    Constant Field Values
  - PRICING_DEFAULT
```
static final int PRICING_DEFAULT
```
    Constant used in enumeration 'PRICING'
    
    See Also:
    
    Constant Field Values
  - PRICING_DEVEX
```
static final int PRICING_DEVEX
```
    Constant used in enumeration 'PRICING'
    
    See Also:
    
    Constant Field Values
  - CUTSTRATEGY_DEFAULT
```
static final int CUTSTRATEGY_DEFAULT
```
    Constant used in enumeration 'CUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSTRATEGY_NONE
```
static final int CUTSTRATEGY_NONE
```
    Constant used in enumeration 'CUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSTRATEGY_CONSERVATIVE
```
static final int CUTSTRATEGY_CONSERVATIVE
```
    Constant used in enumeration 'CUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSTRATEGY_MODERATE
```
static final int CUTSTRATEGY_MODERATE
```
    Constant used in enumeration 'CUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSTRATEGY_AGGRESSIVE
```
static final int CUTSTRATEGY_AGGRESSIVE
```
    Constant used in enumeration 'CUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_AUTOMATIC
```
static final int VARSELECTION_AUTOMATIC
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_MIN_UPDOWN_PSEUDO_COSTS
```
static final int VARSELECTION_MIN_UPDOWN_PSEUDO_COSTS
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_SUM_UPDOWN_PSEUDO_COSTS
```
static final int VARSELECTION_SUM_UPDOWN_PSEUDO_COSTS
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_MAX_UPDOWN_PSEUDO_COSTS_PLUS_TWICE_MIN
```
static final int VARSELECTION_MAX_UPDOWN_PSEUDO_COSTS_PLUS_TWICE_MIN
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_MAX_UPDOWN_PSEUDO_COSTS
```
static final int VARSELECTION_MAX_UPDOWN_PSEUDO_COSTS
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_DOWN_PSEUDO_COST
```
static final int VARSELECTION_DOWN_PSEUDO_COST
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_UP_PSEUDO_COST
```
static final int VARSELECTION_UP_PSEUDO_COST
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - SCALING_ROW_SCALING
```
static final int SCALING_ROW_SCALING
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_COLUMN_SCALING
```
static final int SCALING_COLUMN_SCALING
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_ROW_SCALING_AGAIN
```
static final int SCALING_ROW_SCALING_AGAIN
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_MAXIMUM
```
static final int SCALING_MAXIMUM
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_CURTIS_REID
```
static final int SCALING_CURTIS_REID
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_BY_MAX_ELEM_NOT_GEO_MEAN
```
static final int SCALING_BY_MAX_ELEM_NOT_GEO_MEAN
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_BIGM
```
static final int SCALING_BIGM
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_SIMPLEX_OBJECTIVE_SCALING
```
static final int SCALING_SIMPLEX_OBJECTIVE_SCALING
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_IGNORE_QUADRATIC_ROW_PART
```
static final int SCALING_IGNORE_QUADRATIC_ROW_PART
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_BEFORE_PRESOLVE
```
static final int SCALING_BEFORE_PRESOLVE
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_NO_SCALING_ROWS_UP
```
static final int SCALING_NO_SCALING_ROWS_UP
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_NO_SCALING_COLUMNS_DOWN
```
static final int SCALING_NO_SCALING_COLUMNS_DOWN
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_DISABLE_GLOBAL_OBJECTIVE_SCALING
```
static final int SCALING_DISABLE_GLOBAL_OBJECTIVE_SCALING
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_RHS_SCALING
```
static final int SCALING_RHS_SCALING
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_NO_AGGRESSIVE_Q_SCALING
```
static final int SCALING_NO_AGGRESSIVE_Q_SCALING
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_SLACK_SCALING
```
static final int SCALING_SLACK_SCALING
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_RUIZ
```
static final int SCALING_RUIZ
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_DOGLEG
```
static final int SCALING_DOGLEG
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_BEFORE_AND_AFTER_PRESOLVE
```
static final int SCALING_BEFORE_AND_AFTER_PRESOLVE
```
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_CLIQUE
```
static final int CUTSELECT_CLIQUE
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_MIR
```
static final int CUTSELECT_MIR
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_COVER
```
static final int CUTSELECT_COVER
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_FLOWPATH
```
static final int CUTSELECT_FLOWPATH
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_IMPLICATION
```
static final int CUTSELECT_IMPLICATION
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_LIFT_AND_PROJECT
```
static final int CUTSELECT_LIFT_AND_PROJECT
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_DISABLE_CUT_ROWS
```
static final int CUTSELECT_DISABLE_CUT_ROWS
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_GUB_COVER
```
static final int CUTSELECT_GUB_COVER
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_DEFAULT
```
static final int CUTSELECT_DEFAULT
```
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_LPOPTIMAL
```
static final int REFINEOPS_LPOPTIMAL
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_MIPSOLUTION
```
static final int REFINEOPS_MIPSOLUTION
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_MIPOPTIMAL
```
static final int REFINEOPS_MIPOPTIMAL
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_MIPNODELP
```
static final int REFINEOPS_MIPNODELP
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_LPPRESOLVE
```
static final int REFINEOPS_LPPRESOLVE
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_ITERATIVEREFINER
```
static final int REFINEOPS_ITERATIVEREFINER
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_REFINERPRECISION
```
static final int REFINEOPS_REFINERPRECISION
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_REFINERUSEPRIMAL
```
static final int REFINEOPS_REFINERUSEPRIMAL
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_REFINERUSEDUAL
```
static final int REFINEOPS_REFINERUSEDUAL
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_MIPFIXGLOBALS
```
static final int REFINEOPS_MIPFIXGLOBALS
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - REFINEOPS_MIPFIXGLOBALSTARGET
```
static final int REFINEOPS_MIPFIXGLOBALSTARGET
```
    Constant used in enumeration 'REFINEOPS'
    
    See Also:
    
    Constant Field Values
  - DUALIZEOPS_SWITCHALGORITHM
```
static final int DUALIZEOPS_SWITCHALGORITHM
```
    Constant used in enumeration 'DUALIZEOPS'
    
    See Also:
    
    Constant Field Values
  - TREEDIAGNOSTICS_MEMORY_USAGE_SUMMARIES
```
static final int TREEDIAGNOSTICS_MEMORY_USAGE_SUMMARIES
```
    Constant used in enumeration 'TREEDIAGNOSTICS'
    
    See Also:
    
    Constant Field Values
  - TREEDIAGNOSTICS_MEMORY_SAVED_REPORTS
```
static final int TREEDIAGNOSTICS_MEMORY_SAVED_REPORTS
```
    Constant used in enumeration 'TREEDIAGNOSTICS'
    
    See Also:
    
    Constant Field Values
  - BARPRESOLVEOPS_STANDARD_PRESOLVE
```
static final int BARPRESOLVEOPS_STANDARD_PRESOLVE
```
    Constant used in enumeration 'BARPRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - BARPRESOLVEOPS_EXTRA_BARRIER_PRESOLVE
```
static final int BARPRESOLVEOPS_EXTRA_BARRIER_PRESOLVE
```
    Constant used in enumeration 'BARPRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - MIPRESTART_DEFAULT
```
static final int MIPRESTART_DEFAULT
```
    Constant used in enumeration 'MIPRESTART'
    
    See Also:
    
    Constant Field Values
  - MIPRESTART_OFF
```
static final int MIPRESTART_OFF
```
    Constant used in enumeration 'MIPRESTART'
    
    See Also:
    
    Constant Field Values
  - MIPRESTART_MODERATE
```
static final int MIPRESTART_MODERATE
```
    Constant used in enumeration 'MIPRESTART'
    
    See Also:
    
    Constant Field Values
  - MIPRESTART_AGGRESSIVE
```
static final int MIPRESTART_AGGRESSIVE
```
    Constant used in enumeration 'MIPRESTART'
    
    See Also:
    
    Constant Field Values
  - PRECOEFELIM_DISABLED
```
static final int PRECOEFELIM_DISABLED
```
    Constant used in enumeration 'PRECOEFELIM'
    
    See Also:
    
    Constant Field Values
  - PRECOEFELIM_AGGRESSIVE
```
static final int PRECOEFELIM_AGGRESSIVE
```
    Constant used in enumeration 'PRECOEFELIM'
    
    See Also:
    
    Constant Field Values
  - PRECOEFELIM_CAUTIOUS
```
static final int PRECOEFELIM_CAUTIOUS
```
    Constant used in enumeration 'PRECOEFELIM'
    
    See Also:
    
    Constant Field Values
  - PREDOMROW_AUTOMATIC
```
static final int PREDOMROW_AUTOMATIC
```
    Constant used in enumeration 'PREDOMROW'
    
    See Also:
    
    Constant Field Values
  - PREDOMROW_DISABLED
```
static final int PREDOMROW_DISABLED
```
    Constant used in enumeration 'PREDOMROW'
    
    See Also:
    
    Constant Field Values
  - PREDOMROW_CAUTIOUS
```
static final int PREDOMROW_CAUTIOUS
```
    Constant used in enumeration 'PREDOMROW'
    
    See Also:
    
    Constant Field Values
  - PREDOMROW_MEDIUM
```
static final int PREDOMROW_MEDIUM
```
    Constant used in enumeration 'PREDOMROW'
    
    See Also:
    
    Constant Field Values
  - PREDOMROW_AGGRESSIVE
```
static final int PREDOMROW_AGGRESSIVE
```
    Constant used in enumeration 'PREDOMROW'
    
    See Also:
    
    Constant Field Values
  - PREDOMCOL_AUTOMATIC
```
static final int PREDOMCOL_AUTOMATIC
```
    Constant used in enumeration 'PREDOMCOL'
    
    See Also:
    
    Constant Field Values
  - PREDOMCOL_DISABLED
```
static final int PREDOMCOL_DISABLED
```
    Constant used in enumeration 'PREDOMCOL'
    
    See Also:
    
    Constant Field Values
  - PREDOMCOL_CAUTIOUS
```
static final int PREDOMCOL_CAUTIOUS
```
    Constant used in enumeration 'PREDOMCOL'
    
    See Also:
    
    Constant Field Values
  - PREDOMCOL_AGGRESSIVE
```
static final int PREDOMCOL_AGGRESSIVE
```
    Constant used in enumeration 'PREDOMCOL'
    
    See Also:
    
    Constant Field Values
  - PRIMALUNSHIFT_ALLOW_DUAL_UNSHIFT
```
static final int PRIMALUNSHIFT_ALLOW_DUAL_UNSHIFT
```
    Constant used in enumeration 'PRIMALUNSHIFT'
    
    See Also:
    
    Constant Field Values
  - PRIMALUNSHIFT_NO_DUAL_UNSHIFT
```
static final int PRIMALUNSHIFT_NO_DUAL_UNSHIFT
```
    Constant used in enumeration 'PRIMALUNSHIFT'
    
    See Also:
    
    Constant Field Values
  - REPAIRINDEFINITEQ_REPAIR_IF_POSSIBLE
```
static final int REPAIRINDEFINITEQ_REPAIR_IF_POSSIBLE
```
    Constant used in enumeration 'REPAIRINDEFINITEQ'
    
    See Also:
    
    Constant Field Values
  - REPAIRINDEFINITEQ_NO_REPAIR
```
static final int REPAIRINDEFINITEQ_NO_REPAIR
```
    Constant used in enumeration 'REPAIRINDEFINITEQ'
    
    See Also:
    
    Constant Field Values
  - OBJ_MINIMIZE
```
static final int OBJ_MINIMIZE
```
    Constant used in enumeration 'enum_obj_sense'
    
    See Also:
    
    Constant Field Values
  - OBJ_MAXIMIZE
```
static final int OBJ_MAXIMIZE
```
    Constant used in enumeration 'enum_obj_sense'
    
    See Also:
    
    Constant Field Values
  - TYPE_NOTDEFINED
```
static final int TYPE_NOTDEFINED
```
    Constant used in enumeration 'enum_parameter_type'
    
    See Also:
    
    Constant Field Values
  - TYPE_INT
```
static final int TYPE_INT
```
    Constant used in enumeration 'enum_parameter_type'
    
    See Also:
    
    Constant Field Values
  - TYPE_INT64
```
static final int TYPE_INT64
```
    Constant used in enumeration 'enum_parameter_type'
    
    See Also:
    
    Constant Field Values
  - TYPE_DOUBLE
```
static final int TYPE_DOUBLE
```
    Constant used in enumeration 'enum_parameter_type'
    
    See Also:
    
    Constant Field Values
  - TYPE_STRING
```
static final int TYPE_STRING
```
    Constant used in enumeration 'enum_parameter_type'
    
    See Also:
    
    Constant Field Values
  - QCONVEXITY_UNKNOWN
```
static final int QCONVEXITY_UNKNOWN
```
    Constant used in enumeration 'QCONVEXITY'
    
    See Also:
    
    Constant Field Values
  - QCONVEXITY_NONCONVEX
```
static final int QCONVEXITY_NONCONVEX
```
    Constant used in enumeration 'QCONVEXITY'
    
    See Also:
    
    Constant Field Values
  - QCONVEXITY_CONVEX
```
static final int QCONVEXITY_CONVEX
```
    Constant used in enumeration 'QCONVEXITY'
    
    See Also:
    
    Constant Field Values
  - QCONVEXITY_REPAIRABLE
```
static final int QCONVEXITY_REPAIRABLE
```
    Constant used in enumeration 'QCONVEXITY'
    
    See Also:
    
    Constant Field Values
  - QCONVEXITY_CONVEXCONE
```
static final int QCONVEXITY_CONVEXCONE
```
    Constant used in enumeration 'QCONVEXITY'
    
    See Also:
    
    Constant Field Values
  - QCONVEXITY_CONECONVERTABLE
```
static final int QCONVEXITY_CONECONVERTABLE
```
    Constant used in enumeration 'QCONVEXITY'
    
    See Also:
    
    Constant Field Values
  - SOLINFO_ABSPRIMALINFEAS
```
static final int SOLINFO_ABSPRIMALINFEAS
```
    Constant used in enumeration 'SOLINFO'
    
    See Also:
    
    Constant Field Values
  - SOLINFO_RELPRIMALINFEAS
```
static final int SOLINFO_RELPRIMALINFEAS
```
    Constant used in enumeration 'SOLINFO'
    
    See Also:
    
    Constant Field Values
  - SOLINFO_ABSDUALINFEAS
```
static final int SOLINFO_ABSDUALINFEAS
```
    Constant used in enumeration 'SOLINFO'
    
    See Also:
    
    Constant Field Values
  - SOLINFO_RELDUALINFEAS
```
static final int SOLINFO_RELDUALINFEAS
```
    Constant used in enumeration 'SOLINFO'
    
    See Also:
    
    Constant Field Values
  - SOLINFO_MAXMIPFRACTIONAL
```
static final int SOLINFO_MAXMIPFRACTIONAL
```
    Constant used in enumeration 'SOLINFO'
    
    See Also:
    
    Constant Field Values
  - SOLINFO_ABSMIPINFEAS
```
static final int SOLINFO_ABSMIPINFEAS
```
    Constant used in enumeration 'SOLINFO'
    
    See Also:
    
    Constant Field Values
  - SOLINFO_RELMIPINFEAS
```
static final int SOLINFO_RELMIPINFEAS
```
    Constant used in enumeration 'SOLINFO'
    
    See Also:
    
    Constant Field Values
  - TUNERMODE_AUTOMATIC
```
static final int TUNERMODE_AUTOMATIC
```
    Constant used in enumeration 'TUNERMODE'
    
    See Also:
    
    Constant Field Values
  - TUNERMODE_OFF
```
static final int TUNERMODE_OFF
```
    Constant used in enumeration 'TUNERMODE'
    
    See Also:
    
    Constant Field Values
  - TUNERMODE_ON
```
static final int TUNERMODE_ON
```
    Constant used in enumeration 'TUNERMODE'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_AUTOMATIC
```
static final int TUNERMETHOD_AUTOMATIC
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_LPQUICK
```
static final int TUNERMETHOD_LPQUICK
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_MIPQUICK
```
static final int TUNERMETHOD_MIPQUICK
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_MIPCOMPREHENSIVE
```
static final int TUNERMETHOD_MIPCOMPREHENSIVE
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_MIPROOTFOCUS
```
static final int TUNERMETHOD_MIPROOTFOCUS
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_MIPTREEFOCUS
```
static final int TUNERMETHOD_MIPTREEFOCUS
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_MIPSIMPLE
```
static final int TUNERMETHOD_MIPSIMPLE
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_SLPQUICK
```
static final int TUNERMETHOD_SLPQUICK
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_MISLPQUICK
```
static final int TUNERMETHOD_MISLPQUICK
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_MIPHEURISTICS
```
static final int TUNERMETHOD_MIPHEURISTICS
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERMETHOD_LPNUMERICS
```
static final int TUNERMETHOD_LPNUMERICS
```
    Constant used in enumeration 'TUNERMETHOD'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_AUTOMATIC
```
static final int TUNERTARGET_AUTOMATIC
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_TIMEGAP
```
static final int TUNERTARGET_TIMEGAP
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_TIMEBOUND
```
static final int TUNERTARGET_TIMEBOUND
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_TIMEOBJVAL
```
static final int TUNERTARGET_TIMEOBJVAL
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_INTEGRAL
```
static final int TUNERTARGET_INTEGRAL
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_SLPTIME
```
static final int TUNERTARGET_SLPTIME
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_SLPOBJVAL
```
static final int TUNERTARGET_SLPOBJVAL
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_SLPVALIDATION
```
static final int TUNERTARGET_SLPVALIDATION
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_GAP
```
static final int TUNERTARGET_GAP
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_BOUND
```
static final int TUNERTARGET_BOUND
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_OBJVAL
```
static final int TUNERTARGET_OBJVAL
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERHISTORY_IGNORE
```
static final int TUNERHISTORY_IGNORE
```
    Constant used in enumeration 'TUNERHISTORY'
    
    See Also:
    
    Constant Field Values
  - TUNERHISTORY_APPEND
```
static final int TUNERHISTORY_APPEND
```
    Constant used in enumeration 'TUNERHISTORY'
    
    See Also:
    
    Constant Field Values
  - TUNERHISTORY_REUSE
```
static final int TUNERHISTORY_REUSE
```
    Constant used in enumeration 'TUNERHISTORY'
    
    See Also:
    
    Constant Field Values
  - TUNERROOTALG_DUAL
```
static final int TUNERROOTALG_DUAL
```
    Constant used in enumeration 'TUNERROOTALG'
    
    See Also:
    
    Constant Field Values
  - TUNERROOTALG_PRIMAL
```
static final int TUNERROOTALG_PRIMAL
```
    Constant used in enumeration 'TUNERROOTALG'
    
    See Also:
    
    Constant Field Values
  - TUNERROOTALG_BARRIER
```
static final int TUNERROOTALG_BARRIER
```
    Constant used in enumeration 'TUNERROOTALG'
    
    See Also:
    
    Constant Field Values
  - TUNERROOTALG_NETWORK
```
static final int TUNERROOTALG_NETWORK
```
    Constant used in enumeration 'TUNERROOTALG'
    
    See Also:
    
    Constant Field Values
  - LPFLAGS_DUAL
```
static final int LPFLAGS_DUAL
```
    Constant used in enumeration 'LPFLAGS'
    
    See Also:
    
    Constant Field Values
  - LPFLAGS_PRIMAL
```
static final int LPFLAGS_PRIMAL
```
    Constant used in enumeration 'LPFLAGS'
    
    See Also:
    
    Constant Field Values
  - LPFLAGS_BARRIER
```
static final int LPFLAGS_BARRIER
```
    Constant used in enumeration 'LPFLAGS'
    
    See Also:
    
    Constant Field Values
  - LPFLAGS_NETWORK
```
static final int LPFLAGS_NETWORK
```
    Constant used in enumeration 'LPFLAGS'
    
    See Also:
    
    Constant Field Values
  - GENCONS_MAX
```
static final int GENCONS_MAX
```
    Constant used in enumeration 'GENCONSTYPE'
    
    See Also:
    
    Constant Field Values
  - GENCONS_MIN
```
static final int GENCONS_MIN
```
    Constant used in enumeration 'GENCONSTYPE'
    
    See Also:
    
    Constant Field Values
  - GENCONS_AND
```
static final int GENCONS_AND
```
    Constant used in enumeration 'GENCONSTYPE'
    
    See Also:
    
    Constant Field Values
  - GENCONS_OR
```
static final int GENCONS_OR
```
    Constant used in enumeration 'GENCONSTYPE'
    
    See Also:
    
    Constant Field Values
  - GENCONS_ABS
```
static final int GENCONS_ABS
```
    Constant used in enumeration 'GENCONSTYPE'
    
    See Also:
    
    Constant Field Values
  - CLAMPING_PRIMAL
```
static final int CLAMPING_PRIMAL
```
    Constant used in enumeration 'CLAMPING'
    
    See Also:
    
    Constant Field Values
  - CLAMPING_DUAL
```
static final int CLAMPING_DUAL
```
    Constant used in enumeration 'CLAMPING'
    
    See Also:
    
    Constant Field Values
  - CLAMPING_SLACKS
```
static final int CLAMPING_SLACKS
```
    Constant used in enumeration 'CLAMPING'
    
    See Also:
    
    Constant Field Values
  - CLAMPING_RDJ
```
static final int CLAMPING_RDJ
```
    Constant used in enumeration 'CLAMPING'
    
    See Also:
    
    Constant Field Values
  - ROWFLAG_QUADRATIC
```
static final int ROWFLAG_QUADRATIC
```
    Constant used in enumeration 'ROWFLAG'
    
    See Also:
    
    Constant Field Values
  - ROWFLAG_DELAYED
```
static final int ROWFLAG_DELAYED
```
    Constant used in enumeration 'ROWFLAG'
    
    See Also:
    
    Constant Field Values
  - ROWFLAG_MODELCUT
```
static final int ROWFLAG_MODELCUT
```
    Constant used in enumeration 'ROWFLAG'
    
    See Also:
    
    Constant Field Values
  - ROWFLAG_INDICATOR
```
static final int ROWFLAG_INDICATOR
```
    Constant used in enumeration 'ROWFLAG'
    
    See Also:
    
    Constant Field Values
  - ROWFLAG_NONLINEAR
```
static final int ROWFLAG_NONLINEAR
```
    Constant used in enumeration 'ROWFLAG'
    
    See Also:
    
    Constant Field Values
  - ALLOW_COMPUTE_ALWAYS
```
static final int ALLOW_COMPUTE_ALWAYS
```
    Constant used in enumeration 'enum_allow_compute'
    
    See Also:
    
    Constant Field Values
  - ALLOW_COMPUTE_NEVER
```
static final int ALLOW_COMPUTE_NEVER
```
    Constant used in enumeration 'enum_allow_compute'
    
    See Also:
    
    Constant Field Values
  - ALLOW_COMPUTE_DEFAULT
```
static final int ALLOW_COMPUTE_DEFAULT
```
    Constant used in enumeration 'enum_allow_compute'
    
    See Also:
    
    Constant Field Values
  - COMPUTELOG_NEVER
```
static final int COMPUTELOG_NEVER
```
    Constant used in enumeration 'enum_compute_log'
    
    See Also:
    
    Constant Field Values
  - COMPUTELOG_REALTIME
```
static final int COMPUTELOG_REALTIME
```
    Constant used in enumeration 'enum_compute_log'
    
    See Also:
    
    Constant Field Values
  - COMPUTELOG_ONCOMPLETION
```
static final int COMPUTELOG_ONCOMPLETION
```
    Constant used in enumeration 'enum_compute_log'
    
    See Also:
    
    Constant Field Values
  - COMPUTELOG_ONERROR
```
static final int COMPUTELOG_ONERROR
```
    Constant used in enumeration 'enum_compute_log'
    
    See Also:
    
    Constant Field Values
  - ISUSERSOLUTION
```
static final int ISUSERSOLUTION
```
    Bit field flag 'IsUserSolution' for MipSolPool Solution
    
    See Also:
    
    Constant Field Values
  - ISREPROCESSEDUSERSOLUTION
```
static final int ISREPROCESSEDUSERSOLUTION
```
    Bit field flag 'IsReprocessedUserSolution' for MipSolPool Solution
    
    See Also:
    
    Constant Field Values
  - N_BNDNAM
```
static final int N_BNDNAM
```
    See Also:
    
    Constant Field Values

© 2001-2022 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.

Contents

Index

Glossary

Search Results

XPRSconstants

Field Summary

Field Detail

PLUSINFINITY

MINUSINFINITY

MAXINT

XPVERSION

JAVAXPRS_VERSION

EXTRAROWS

EXTRACOLS

EXTRAELEMS

LPITERLIMIT

LPLOG

SCALING

PRESOLVE

CRASH

PRICINGALG

INVERTFREQ

INVERTMIN

MAXNODE

MAXTIME

MAXMIPSOL

SIFTPASSES

DEFAULTALG

VARSELECTION

NODESELECTION

BACKTRACK

MIPLOG

KEEPNROWS

MPSECHO

MAXPAGELINES

OUTPUTLOG

EXTRAPRESOLVE

BARSOLUTION

CACHESIZE

CROSSOVER

BARITERLIMIT

CHOLESKYALG

BAROUTPUT

CSTYLE

EXTRAMIPENTS

REFACTOR

BARTHREADS

KEEPBASIS

CROSSOVEROPS

VERSION

CROSSOVERTHREADS

BIGMMETHOD

MPSNAMELENGTH

ELIMFILLIN

PRESOLVEOPS

MIPPRESOLVE

MIPTHREADS

BARORDER

BREADTHFIRST

AUTOPERTURB

DENSECOLLIMIT

CALLBACKFROMMASTERTHREAD

MAXMCOEFFBUFFERELEMS

REFINEOPS

LPREFINEITERLIMIT

MIPREFINEITERLIMIT

DUALIZEOPS

CROSSOVERITERLIMIT

PREBASISRED

PRESORT

PREPERMUTE

PREPERMUTESEED

MAXMEMORYSOFT

CUTFREQ

SYMSELECT

SYMMETRY

MAXMEMORYHARD

LPTHREADS

MIQCPALG

QCCUTS