XPRSconstants

com.dashoptimization.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	Description
`static int`	`ACTIVENODES`	Number of outstanding nodes.
`static int`	`ALG_AUGMENTED_REFINEMENT`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_AUTOMATIC`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_BARRIER`	Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_CORRECTOR_WEIGHT_ON`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_DEFAULT`	Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_DUAL`	Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_MANUAL_CORRECTOR_WEIGHT`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_MANUAL_MATRIX_BLOCKING`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_MANUAL_REFINEMENT`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_MAX_ACCURACY_REFINEMENT`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_NETWORK`	Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_NONSEPARABLE_QP`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_PCGM_REFINEMENT`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_PRIMAL`	Constant used in enumeration 'DEFAULTALG'
`static int`	`ALG_QMR_REFINEMENT`	Constant used in enumeration 'CHOLESKYALG'
`static int`	`ALG_SINGLE_PASS_BLOCKING`	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`	`ALTERNATIVELPSOLS`	Controls the collection of alternative LP solutions for cut separation and heuristics.
`static int`	`ALTERNATIVEREDCOSTS`	Deprecated. since 48.00
`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`	Deprecated. since 48.00
`static int`	`AVAILABLEMEMORY`	The amount of heap memory detected by Xpress as free.
`static int`	`BACKGROUNDMAXTHREADS`	Limits the number of threads to use in background jobs (for example in parallel to the root cut loop).
`static int`	`BACKGROUNDSELECT`	Bit-vector control (see Section ) to select which tasks to run in background jobs (for example in parallel to the root cut loop).
`static int`	`BACKGROUNDSELECT_AUTOMATIC`	Constant used in enumeration 'BACKGROUNDSELECT'
`static int`	`BACKGROUNDSELECT_FASTBB`	Constant used in enumeration 'BACKGROUNDSELECT'
`static int`	`BACKGROUNDSELECT_FASTBB_HEUR`	Constant used in enumeration 'BACKGROUNDSELECT'
`static int`	`BACKGROUNDSELECT_FEASJUMP`	Constant used in enumeration 'BACKGROUNDSELECT'
`static int`	`BACKGROUNDSELECT_FIXPROPAGATEREPAIR`	Constant used in enumeration 'BACKGROUNDSELECT'
`static int`	`BACKGROUNDSELECT_PARCUTLOOP`	Constant used in enumeration 'BACKGROUNDSELECT'
`static int`	`BACKGROUNDSELECT_ZEROOBJ`	Constant used in enumeration 'BACKGROUNDSELECT'
`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_AUTOMATIC`	Constant used in enumeration 'BACKTRACKALG'
`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_BOUND`	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 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`	Determines the number of physical CPU cores assumed to be present in the system by the barrier and hybrid gradient algorithms.
`static int`	`BARCRASH`	Newton barrier and hybrid gradient: 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 and hybrid gradient: 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 and hybrid gradient: 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`	`BARHGEXTRAPOLATE`	Extrapolation parameter for the hybrid gradient algorithm.
`static int`	`BARHGGPU`	Whether to use a GPU for the hybrid gradient algorithm.
`static int`	`BARHGGPUALG`	Defines the GPU algorithm choice.
`static int`	`BARHGGPUBLOCKSIZE`	The size of CUDA blocks to use for the GPU calculations.
`static int`	`BARHGHALPERN`	Defines the balance between the regular and the Halpern updates during the iterations.
`static int`	`BARHGMAXRESTARTS`	The maximum number of restarts in the hybrid gradient algorithm.
`static int`	`BARHGMINORITERATIONLIMIT`	Minor iterations are faster but simplified steps in the algorithm.
`static int`	`BARHGOPS`	Bit-vector control (see Section ) options for the hybrid gradient algorithm.
`static int`	`BARHGOPS_ASYM_AVG`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_NOHALPERN`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_OBJSCALE`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_OMEGA_CONTRACT`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_OMEGA_INF`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_RESTART_L2`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_RHSSCALE`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_START_L1`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_START_L2`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGOPS_START_LINF`	Constant used in enumeration 'BARHGOPS'
`static int`	`BARHGPRECISION`	Whether to use single or double precision floating-point arithmetic in the hybrid gradient algorithm.
`static int`	`BARHGPRECISION_AUTOMATIC`	Constant used in enumeration 'BARHGPRECISION'
`static int`	`BARHGPRECISION_DOUBLE`	Constant used in enumeration 'BARHGPRECISION'
`static int`	`BARHGPRECISION_SINGLE`	Constant used in enumeration 'BARHGPRECISION'
`static int`	`BARHGRELTOL`	Relative feasibility tolerance for the hybrid gradient algorithm.
`static int`	`BARINDEFLIMIT`	Newton Barrier.
`static int`	`BARITER`	Number of Newton barrier or hybrid gradient iterations.
`static int`	`BARITERATIVE`	The maximum number of barrier iterations in which an iterative solver is used instead of the Cholesky decomposition.
`static int`	`BARITERLIMIT`	Newton barrier: Specifies the maximum number of iterations.
`static int`	`BARKERNEL`	Newton barrier: Defines how centrality is weighted in the barrier algorithm.
`static int`	`BARLARGEBOUND`	Threshold for the barrier to handle large bounds.
`static int`	`BARLSIZE`	Number of nonzeros in L resulting from the Cholesky factorization.
`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 and hybrid gradient: 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 bit-vector (see Section ) controls the Newton-Barrier specific presolve operations.
`static int`	`BARPRESOLVEOPS_EXTRA_BARRIER_PRESOLVE`	Constant used in enumeration 'BARPRESOLVEOPS'
`static int`	`BARPRESOLVEOPS_FULL_MATRIX_ELIMINATION`	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 and hybrid gradient: 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 bit-vector control (see Section ) determines how the barrier algorithm applies regularization on the KKT system.
`static int`	`BARREGULARIZE_AUTOMATIC`	Constant used in enumeration 'BARREGULARIZE'
`static int`	`BARREGULARIZE_DISABLEITERATIONS`	Constant used in enumeration 'BARREGULARIZE'
`static int`	`BARREGULARIZE_FORCEITERATIONS`	Constant used in enumeration 'BARREGULARIZE'
`static int`	`BARREGULARIZE_KEEPDEGENERATEROWS`	Constant used in enumeration 'BARREGULARIZE'
`static int`	`BARREGULARIZE_KEEPDEPENDENTROWS`	Constant used in enumeration 'BARREGULARIZE'
`static int`	`BARREGULARIZE_REDUCED`	Constant used in enumeration 'BARREGULARIZE'
`static int`	`BARREGULARIZE_RESTRICTTOINFEASIBLE`	Constant used in enumeration 'BARREGULARIZE'
`static int`	`BARREGULARIZE_STANDARD`	Constant used in enumeration 'BARREGULARIZE'
`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 the last barrier iteration.
`static int`	`BARSTART`	Controls the computation of the starting point and warm-starting for the Newton barrier and the hybrid gradient algorithms.
`static int`	`BARSTARTWEIGHT`	Newton barrier: This sets the 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`	Determines the number of threads implemented to run the Newton-barrier and hybrid gradient algorithms.
`static int`	`BASISSTATUS_BASIC`	Constant used in enumeration 'BASISSTATUS'
`static int`	`BASISSTATUS_NONBASIC_LOWER`	Constant used in enumeration 'BASISSTATUS'
`static int`	`BASISSTATUS_NONBASIC_UPPER`	Constant used in enumeration 'BASISSTATUS'
`static int`	`BASISSTATUS_SUPERBASIC`	Constant used in enumeration 'BASISSTATUS'
`static int`	`BESTBOUND`	Value of the best bound determined so far by the MIP 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_INC_SOL_FIRST`	Constant used in enumeration 'BRANCHCHOICE'
`static int`	`BRANCH_MAX_EST_FIRST`	Constant used in enumeration 'BRANCHCHOICE'
`static int`	`BRANCH_MIN_EST_FIRST`	Constant used in enumeration 'BRANCHCHOICE'
`static int`	`BRANCH_ROOTNODE_SOL_FARTHER`	Constant used in enumeration 'BRANCHCHOICE'
`static int`	`BRANCHCHOICE`	Once a MIP 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`	Specifies the number of nodes to include in the best-first search before switching to the local first search ( `NODESELECTION` `=` `4`).
`static int`	`CALLBACKCHECKTIMEDELAY`	Minimum delay in milliseconds between two consecutive executions of the CHECKTIME callback in the same solution process
`static int`	`CALLBACKCHECKTIMEWORKDELAY`	Minimum delay in work units between two consecutive executions of the CHECKTIME callback in the same solution process
`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`	`CALLBACKFROMMAINTHREAD`	Branch and Bound: specifies whether the MIP callbacks should only be called on the main thread.
`static int`	`CHECKINPUTDATA`	Check input arrays for bad data.
`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; bit-vector-control (see Section ).
`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 bit-vector control (see Section ) 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`	`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 number of cores assumed to be present 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`	Deprecated. since 48.01
`static int`	`CPIALPHA`	decay term for confined primal integral computation.
`static int`	`CPISCALEFACTOR`	scale factor from primal integral computation.
`static int`	`CPUPLATFORM`	Newton Barrier: Selects the AMD, Intel x86 or ARM 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 and hybrid gradient: 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`	`CROSSOVERITER`	Number of simplex iterations performed in crossover.
`static int`	`CROSSOVERITERLIMIT`	Newton barrier and hybrid gradient: Specifies the maximum number of iterations that will be performed in the crossover procedure before the optimization process terminates.
`static int`	`CROSSOVEROPS`	Newton barrier and hybrid gradient: a bit-vector (see Section ) for adjusting the behavior of the crossover procedure.
`static int`	`CROSSOVEROPS_CAREFUL`	Constant used in enumeration 'CROSSOVEROPS'
`static int`	`CROSSOVEROPS_PUSH_UNSTABLE`	Constant used in enumeration 'CROSSOVEROPS'
`static int`	`CROSSOVEROPS_RETURN_BARSOL_ON_FAILURE`	Constant used in enumeration 'CROSSOVEROPS'
`static int`	`CROSSOVEROPS_SKIP_SECOND_PART`	Constant used in enumeration 'CROSSOVEROPS'
`static int`	`CROSSOVERTHREADS`	Determines the maximum number of threads that parallel crossover is allowed to use.
`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`	`CUTAGGROWS`	Strategy for row aggregation used when separating Mixed Integer Rounding (MIR) cuts, lifted cover cuts and Strong Chvatal-Gomory (CG) cuts.
`static int`	`CUTAGGROWS_AGGRESSIVE`	Constant used in enumeration 'CUTAGGROWS'
`static int`	`CUTAGGROWS_AUTOMATIC`	Constant used in enumeration 'CUTAGGROWS'
`static int`	`CUTAGGROWS_CONSERVATIVE`	Constant used in enumeration 'CUTAGGROWS'
`static int`	`CUTAGGROWS_MODERATE`	Constant used in enumeration 'CUTAGGROWS'
`static int`	`CUTAGGROWS_OFF`	Constant used in enumeration 'CUTAGGROWS'
`static int`	`CUTAGGROWS_VERYAGGRESSIVE`	Constant used in enumeration 'CUTAGGROWS'
`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 tree search.
`static int`	`CUTFREQ`	Branch and Bound: Specifies the frequency at which cuts are generated in the tree search.
`static int`	`CUTFROMCUTROWS`	Strategy to decide whether cutting planes already added to the matrix may themselves be used as base rows for separating new Mixed Integer Rounding (MIR) cuts, lifted cover cuts and Strong Chvatal-Gomory (CG) cuts.
`static int`	`CUTFROMCUTROWS_AGGRESSIVE`	Constant used in enumeration 'CUTFROMCUTROWS'
`static int`	`CUTFROMCUTROWS_AUTOMATIC`	Constant used in enumeration 'CUTFROMCUTROWS'
`static int`	`CUTFROMCUTROWS_CONSERVATIVE`	Constant used in enumeration 'CUTFROMCUTROWS'
`static int`	`CUTFROMCUTROWS_MODERATE`	Constant used in enumeration 'CUTFROMCUTROWS'
`static int`	`CUTFROMCUTROWS_OFF`	Constant used in enumeration 'CUTFROMCUTROWS'
`static int`	`CUTGOMMAXROUNDS`	The number of rounds of Gomory cuts or lift-and-project cuts separated at the root node of the branch-and-bound tree search.
`static int`	`CUTGOMMAXTREEROUNDS`	The number of rounds of Gomory cuts or lift-and-project cuts separated at a node of the branch-and-bound tree search other than the root node.
`static int`	`CUTMAXROUNDS`	The number of rounds of cuts separated at the root node of the branch-and-bound tree search, for all MIP cut separators except Gomory cuts.
`static int`	`CUTMAXTREEROUNDS`	The number of rounds of cuts separated at a node of the branch-and-bound tree search other than the root node, for all MIP cut separators except Gomory cuts.
`static int`	`CUTOAMAXROUNDS`	The number of rounds of Outer Approximation (OA) cuts for convex quadratic problems and for Second Order Cone Programs (SOCPs) separated at the root node of the branch-and-bound tree search.
`static int`	`CUTOAMAXTREEROUNDS`	The number of rounds of Outer Approximation (OA) cuts for convex quadratic problems and for Second Order Cone Programs (SOCPs) separated at a node of the branch-and-bound tree search other than the root node.
`static int`	`CUTROUNDS`	Number of rounds of cuts applied to the current node of a branch-and-bound search.
`static int`	`CUTS`	Number of cuts being added to the matrix.
`static int`	`CUTSELECT`	Deprecated. since 48.01
`static int`	`CUTSELECT_CLIQUE`	Deprecated. since 48.01
`static int`	`CUTSELECT_COVER`	Deprecated. since 48.01
`static int`	`CUTSELECT_DEFAULT`	Deprecated. since 48.01
`static int`	`CUTSELECT_DISABLE_CUT_ROWS`	Deprecated. since 48.01
`static int`	`CUTSELECT_FLOWPATH`	Deprecated. since 48.01
`static int`	`CUTSELECT_GUB_COVER`	Deprecated. since 48.01
`static int`	`CUTSELECT_IMPLICATION`	Deprecated. since 48.01
`static int`	`CUTSELECT_LIFT_AND_PROJECT`	Deprecated. since 48.01
`static int`	`CUTSELECT_MIR`	Deprecated. since 48.01
`static int`	`CUTSEPCLIQUESTRATEGY`	Strategy for separation of clique cuts.
`static int`	`CUTSEPCOVERSTRATEGY`	Strategy for separation of lifted cover cuts.
`static int`	`CUTSEPFARKASSTRATEGY`	Strategy for separation of Farkas cuts.
`static int`	`CUTSEPFLOWPATHSTRATEGY`	Strategy for separation of flow path cuts.
`static int`	`CUTSEPGOMORYSTRATEGY`	Strategy for separation of Gomory cuts.
`static int`	`CUTSEPGUBCOVERSTRATEGY`	Strategy for separation of lifted GUB cover cuts.
`static int`	`CUTSEPIMPLBOUNDSTRATEGY`	Strategy for separation of implication cuts.
`static int`	`CUTSEPMCFSTRATEGY`	Strategy for separation of Multi-Commodity Flow (MCF) cuts.
`static int`	`CUTSEPMIRSTRATEGY`	Strategy for separation of Mixed Integer Rounding (MIR) cuts.
`static int`	`CUTSEPPATHMIXSTRATEGY`	Strategy for separation of path mixing cuts.
`static int`	`CUTSEPRLTSTRATEGY`	Strategy for separation of Reformulation-Linearization Technique (RLT) cuts.
`static int`	`CUTSEPSDPSTRATEGY`	Strategy for separation of semidefinite programming (SDP) cuts.
`static int`	`CUTSEPSTRATEGY`	Meta control specifying the cut separation strategy for every individual `CUTSEP*STRATEGY` control left at its default value of -1 (automatic).
`static int`	`CUTSEPSTRATEGY_AGGRESSIVE`	Constant used in enumeration 'CUTSEPSTRATEGY'
`static int`	`CUTSEPSTRATEGY_AUTOENFORCED`	Constant used in enumeration 'CUTSEPSTRATEGY'
`static int`	`CUTSEPSTRATEGY_AUTOMATIC`	Constant used in enumeration 'CUTSEPSTRATEGY'
`static int`	`CUTSEPSTRATEGY_CONSERVATIVE`	Constant used in enumeration 'CUTSEPSTRATEGY'
`static int`	`CUTSEPSTRATEGY_MODERATE`	Constant used in enumeration 'CUTSEPSTRATEGY'
`static int`	`CUTSEPSTRATEGY_OFF`	Constant used in enumeration 'CUTSEPSTRATEGY'
`static int`	`CUTSEPSTRONGCGSTRATEGY`	Strategy for separation of Strong Chvatal-Gomory (CG) cuts.
`static int`	`CUTSEPZEROHALFSTRATEGY`	Strategy for separation of zero-half cuts.
`static int`	`CUTSTRATEGY`	Branch and Bound: This specifies the general cut strategy in terms of limits on the number of cuts and of non-zero cut elements that can be added to the problem.
`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`	`DEFAULT_BRANCHING_PRIORITY`	Default branching priority for variables.
`static int`	`DEFAULTALG`	This selects the algorithm that will be used to solve LPs, standalone or during MIP optimization.
`static int`	`DEL_COLON`
`static int`	`DEL_COMMA`
`static int`	`DENSECOLLIMIT`	Newton barrier: Columns with more than `DENSECOLLIMIT` elements are considered to be dense.
`static int`	`DETERMINISTIC`	Selects whether to use a deterministic or opportunistic mode when solving a problem using multiple threads.
`static int`	`DETERMINISTICLOG`	Suppress non-deterministic log information in the standard MIP log.
`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_DIRECTSTEEPESTEDGE`	Constant used in enumeration 'DUALGRADIENT'
`static int`	`DUALGRADIENT_SPARSEDEVEX`	Constant used in enumeration 'DUALGRADIENT'
`static int`	`DUALGRADIENT_STEEPESTEDGE`	Constant used in enumeration 'DUALGRADIENT'
`static int`	`DUALINFEAS`	Number of dual infeasibilities.
`static int`	`DUALIZE`	For a linear problem or the initial linear relaxation of a MIP, determines whether to form and solve the dual problem.
`static int`	`DUALIZEOPS`	Bit-vector control (see Section ) for adjusting the behavior when a problem is dualized.
`static int`	`DUALIZEOPS_SWITCHALGORITHM`	Constant used in enumeration 'DUALIZEOPS'
`static int`	`DUALPERTURB`	Specifies the factor by which the problem will be perturbed prior to optimization by dual simplex.
`static int`	`DUALREDUCTIONS_ALL`	Constant used in enumeration 'DUALREDUCTIONS'
`static int`	`DUALREDUCTIONS_AUTOMATIC`	Constant used in enumeration 'DUALREDUCTIONS'
`static int`	`DUALREDUCTIONS_NONMIPENTITIES`	Constant used in enumeration 'DUALREDUCTIONS'
`static int`	`DUALREDUCTIONS_OFF`	Constant used in enumeration 'DUALREDUCTIONS'
`static int`	`DUALSTRATEGY`	This bit-vector control (see Section ) specifies the dual simplex strategy.
`static int`	`DUALSTRATEGY_AGRESSIVE_CUTOFF`	Constant used in enumeration 'DUALSTRATEGY'
`static int`	`DUALSTRATEGY_AGRESSIVE_PIVOTING`	Constant used in enumeration 'DUALSTRATEGY'
`static int`	`DUALSTRATEGY_FORCE_DUAL_WHEN_UNSTABLE`	Constant used in enumeration 'DUALSTRATEGY'
`static int`	`DUALSTRATEGY_STOP_SOLVE_WHEN_UNSTABLE`	Constant used in enumeration 'DUALSTRATEGY'
`static int`	`DUALSTRATEGY_SWITCH_TO_PRIMAL`	Constant used in enumeration 'DUALSTRATEGY'
`static int`	`DUALSTRATEGY_USE_DUAL_FOR_UNSHIFT`	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`	Specifies the 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`	Specifies the zero tolerance for eta vector elements.
`static int`	`EXTRACOLS`	Specifies the initial number of extra columns to allow for in the matrix.
`static int`	`EXTRAELEMS`	Specifies the initial number of extra matrix elements to allow for in the matrix, including coefficients for cuts.
`static int`	`EXTRAMIPENTS`	Specifies the initial number of extra MIP entities to allow for.
`static int`	`EXTRAROWS`	Specifies the initial number of extra rows to allow for in the matrix, including cuts.
`static int`	`EXTRASETELEMS`	Specifies the initial number of extra elements in sets to allow for in the matrix.
`static int`	`EXTRASETS`	Specifies the initial number of extra sets to allow for in the matrix.
`static int`	`FEASIBILITYJUMP`	MIP: Decides if the Feasibility Jump heuristic should be run.
`static int`	`FEASIBILITYPUMP`	Branch and Bound: Decides if the Feasibility Pump heuristic should be run at the root 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`	Deprecated. since 48.00
`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 (i.e.
`static int`	`GENCONS`	The number of general constraints (i.e.
`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 (MIN/MAX constraints) in the problem.
`static int`	`GLOBALBOUNDINGBOX`	If a nonlinear problem cannot be solved due to appearing unbounded, it can automatically be regularized by the application of a bounding box on the variables.
`static int`	`GLOBALBOUNDINGBOX_AUXILIARY`	Constant used in enumeration 'GLOBALBOUNDINGBOX'
`static int`	`GLOBALBOUNDINGBOX_NOT_APPLIED`	Constant used in enumeration 'GLOBALBOUNDINGBOX'
`static int`	`GLOBALBOUNDINGBOX_ORIGINAL`	Constant used in enumeration 'GLOBALBOUNDINGBOX'
`static int`	`GLOBALBOUNDINGBOXAPPLIED`	Whether a bounding box equal to the absolute value of the `GLOBALBOUNDINGBOX` control was applied to the problem after the initial solve came back infeasible and if so, to which variables.
`static int`	`GLOBALCONVCUTMAXROUNDS`	The number of rounds of outer approximation and convexification cuts separated at the root node of the branch-and-bound tree search, when solving an (MI)NLP to global optimality.
`static int`	`GLOBALCONVCUTMAXTREEROUNDS`	The number of rounds of outer approximation and convexification cuts separated at a node of the branch-and-bound tree search other than the root node, when solving an (MI)NLP to global optimality.
`static int`	`GLOBALINITCUTSTRATEGY`	Strategy for the initial tangent/secant convexification cuts added per nonlinear operator when setting up the initial LP relaxation during a global solve.
`static int`	`GLOBALINITCUTSTRATEGY_AGGRESSIVE`	Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
`static int`	`GLOBALINITCUTSTRATEGY_AUTOMATIC`	Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
`static int`	`GLOBALINITCUTSTRATEGY_CONSERVATIVE`	Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
`static int`	`GLOBALINITCUTSTRATEGY_MODERATE`	Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
`static int`	`GLOBALINITCUTSTRATEGY_OFF`	Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
`static int`	`GLOBALLSHEURSTRATEGY`	When integer-feasible (for MINLP, any solution for NLP) but nonlinear-infeasible solutions are encountered within a global solve, the integer variables can be fixed and a local solver (as defined by the `LOCALSOLVER` control) can be called on the remaining continuous problem.
`static int`	`GLOBALLSHEURSTRATEGY_AGGRESSIVE`	Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
`static int`	`GLOBALLSHEURSTRATEGY_CONSERVATIVE`	Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
`static int`	`GLOBALLSHEURSTRATEGY_DEFAULT`	Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
`static int`	`GLOBALLSHEURSTRATEGY_MODERATE`	Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
`static int`	`GLOBALLSHEURSTRATEGY_NONE`	Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
`static int`	`GLOBALMISLPHEURSTRATEGY`	Controls how aggressively a set of MISLP-based root heuristics are run at the root node when solving an (MI)NLP to global optimality.
`static int`	`GLOBALMISLPHEURSTRATEGY_AGGRESSIVE`	Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
`static int`	`GLOBALMISLPHEURSTRATEGY_AUTOMATIC`	Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
`static int`	`GLOBALMISLPHEURSTRATEGY_CONSERVATIVE`	Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
`static int`	`GLOBALMISLPHEURSTRATEGY_MODERATE`	Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
`static int`	`GLOBALMISLPHEURSTRATEGY_OFF`	Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
`static int`	`GLOBALNLPCUTS`	Deprecated. since 48.01
`static int`	`GLOBALNLPINFEAS`	Number of nonlinear infeasibilities at the current node of a global solve, measured as the number of violated atomic formulas.
`static int`	`GLOBALNUMINITNLPCUTS`	Deprecated. since 48.01
`static int`	`GLOBALPRESOLVEOBBT`	Controls the amount of work performed by Optimization-Based Bound Tightening (OBBT).
`static int`	`GLOBALSPATIALBRANCHCUTTINGEFFORT`	Limits the effort that is spent on creating cuts during spatial branching.
`static int`	`GLOBALSPATIALBRANCHIFPREFERORIG`	Whether spatial branchings on original variables should be preferred over branching on auxiliary variables that were introduced by the reformulation of the global solver.
`static int`	`GLOBALSPATIALBRANCHPROPAGATIONEFFORT`	Limits the effort that is spent on propagation during spatial branching.
`static int`	`GLOBALTREENLPCUTS`	Deprecated. since 48.01
`static int`	`GOMCUTS`	Deprecated. since 48.01
`static int`	`GPUCUDADEVICE`	Controls which CUDA device should be used when GPU execution is enabled and there are multiple CUDA devices installed in a system.
`static int`	`GPUPLATFORM`	Controls what kind of GPU support is enabled overall in Xpress.
`static int`	`HEURBEFORELP`	Branch and Bound: Determines whether primal heuristics should be run before the initial LP relaxation has been solved.
`static int`	`HEURBEFORELPGPUEFFORT`	Effort dial to control the effort spent inside the selected GPU heuristic method.
`static int`	`HEURBEFORELPGPUMETHOD`	Enables a GPU-accelerated heuristic of the specified type.
`static int`	`HEURBEFORELPGPUMETHOD_AUTOMATIC`	Constant used in enumeration 'HEURBEFORELPGPUMETHOD'
`static int`	`HEURBEFORELPGPUMETHOD_FEASPUMP`	Constant used in enumeration 'HEURBEFORELPGPUMETHOD'
`static int`	`HEURBEFORELPGPUMETHOD_OFF`	Constant used in enumeration 'HEURBEFORELPGPUMETHOD'
`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 large neighborhood search (LNS) heuristics without objective or with an auxiliary objective should always be used, despite the automatic selection of the Optimizer.
`static int`	`HEURFREQ`	Branch and Bound: This specifies the frequency at which heuristics are used in the tree search.
`static int`	`HEURSEARCH_ANALYTIC`	Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCH_COMBINESOLS`	Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCH_LPFIRST`	Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCH_MIPFIRST`	Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCH_RINS`	Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCH_ZEROOBJ`	Constant used in enumeration 'HEURSEARCHSELECT'
`static int`	`HEURSEARCHANALYTICSTRATEGY`	Strategy control for the Analytic Center ( `A`) large neighborhood search heuristic, an LNS heuristic with an auxiliary objective function.
`static int`	`HEURSEARCHBACKGROUNDSELECT`	Bit-vector control (see Section ) to select which large neighborhood searches to run in the background (for example in parallel to the root cut loop).
`static int`	`HEURSEARCHBACKGROUNDSELECT_AUTOMATIC`	Constant used in enumeration 'HEURSEARCHBACKGROUNDSELECT'
`static int`	`HEURSEARCHBACKGROUNDSELECT_LPFIRST`	Constant used in enumeration 'HEURSEARCHBACKGROUNDSELECT'
`static int`	`HEURSEARCHCOMBINESTRATEGY`	Strategy control for the Combine ( `C`) large neighborhood search heuristic, which uses a neighborhood set up through the combination of multiple integer solutions.
`static int`	`HEURSEARCHCOPYCONTROLS`	Select how user-set controls should affect the subproblems solved by large neighborhood search (LNS) heuristics.
`static int`	`HEURSEARCHEFFORT`	Adjusts the overall level of the large neighborhood search (LNS) heuristics.
`static int`	`HEURSEARCHFREQ`	Branch and Bound: This specifies how often the large neighborhood search (LNS) heuristic should be run in the tree.
`static int`	`HEURSEARCHLPFIRSTSTRATEGY`	Strategy control for the LP first ( `L`) large neighborhood search heuristic, an LNS heuristic with a small neighborhood centered around a node LP solution.
`static int`	`HEURSEARCHMIPFIRSTSTRATEGY`	Strategy control for the MIP first ( `M`) large neighborhood search heuristic, an LNS heuristic with a small neighborhood centered around an integer solution.
`static int`	`HEURSEARCHRINSSTRATEGY`	Strategy control for the RINS ( `R`) large neighborhood search heuristic, an LNS heuristic that is potentially expensive but good for finding solutions that differ significantly from the incumbent.
`static int`	`HEURSEARCHROOTCUTFREQ`	How frequently to run the large neighborhood search (LNS) heuristics during root cutting.
`static int`	`HEURSEARCHROOTSELECT`	Deprecated. since 48.00
`static int`	`HEURSEARCHSTRATEGY`	Meta strategy control for large neighborhood search (LNS) heuristics.
`static int`	`HEURSEARCHSTRATEGY_AGGRESSIVE`	Constant used in enumeration 'HEURSEARCHSTRATEGY'
`static int`	`HEURSEARCHSTRATEGY_AUTOENFORCED`	Constant used in enumeration 'HEURSEARCHSTRATEGY'
`static int`	`HEURSEARCHSTRATEGY_AUTOMATIC`	Constant used in enumeration 'HEURSEARCHSTRATEGY'
`static int`	`HEURSEARCHSTRATEGY_CONSERVATIVE`	Constant used in enumeration 'HEURSEARCHSTRATEGY'
`static int`	`HEURSEARCHSTRATEGY_MODERATE`	Constant used in enumeration 'HEURSEARCHSTRATEGY'
`static int`	`HEURSEARCHSTRATEGY_OFF`	Constant used in enumeration 'HEURSEARCHSTRATEGY'
`static int`	`HEURSEARCHTREESELECT`	Deprecated. since 48.00
`static int`	`HEURSEARCHZEROOBJSTRATEGY`	Strategy control for the Zero Objective ( `Z`) large neighborhood search heuristic, an LNS heuristic without an objective function.
`static int`	`HEURSHIFTPROP`	Determines whether the Shift-and-propagate primal heuristic should be executed.
`static int`	`HEURSTRATEGY_AUTOMATIC`	Deprecated. since 42.00
`static int`	`HEURSTRATEGY_BASIC`	Deprecated. since 42.00
`static int`	`HEURSTRATEGY_ENHANCED`	Deprecated. since 42.00
`static int`	`HEURSTRATEGY_EXTENSIVE`	Deprecated. since 42.00
`static int`	`HEURSTRATEGY_NONE`	Deprecated. since 42.00
`static int`	`HEURTHREADS`	Branch and Bound: The number of threads to dedicate to running heuristics during the root solve.
`static int`	`HISTORYCOSTS`	Branch and Bound: How to update the pseudo cost for a MIP 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`	`IFUN_ABS`
`static int`	`IFUN_ARCCOS`
`static int`	`IFUN_ARCSIN`
`static int`	`IFUN_ARCTAN`
`static int`	`IFUN_COS`
`static int`	`IFUN_ERF`
`static int`	`IFUN_ERFC`
`static int`	`IFUN_EXP`
`static int`	`IFUN_LN`
`static int`	`IFUN_LOG`	Deprecated. since 43.00
`static int`	`IFUN_LOG10`
`static int`	`IFUN_MAX`
`static int`	`IFUN_MIN`
`static int`	`IFUN_PROD`
`static int`	`IFUN_PWL`
`static int`	`IFUN_SIGN`
`static int`	`IFUN_SIN`
`static int`	`IFUN_SQRT`
`static int`	`IFUN_SUM`
`static int`	`IFUN_TAN`
`static int`	`IIS_COMPLETED`	Constant used in enumeration 'IISSOLSTATUS'
`static int`	`IIS_FEASIBLE`	Constant used in enumeration 'IISSOLSTATUS'
`static int`	`IIS_UNFINISHED`	Constant used in enumeration 'IISSOLSTATUS'
`static int`	`IIS_UNSTARTED`	Constant used in enumeration 'IISSOLSTATUS'
`static int`	`IISLOG`	Selects how much information should be printed during the IIS procedure.
`static int`	`IISOPS`	Selects which part of the restrictions (bounds, constraints, entities) should always be kept in an IIS.
`static int`	`IISOPS_BINARY`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_BOUND`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_CONSTRAINT`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_DELAYED`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_EQUALITY`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_FIXEDVAR`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_GENERAL`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_GENINTEGRALITY`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_INDICATOR`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_INTEGRALITY`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_PWL`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_SET`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_VARIABLE`	Constant used in enumeration 'IISOPS'
`static int`	`IISOPS_ZEROLOWER`	Constant used in enumeration 'IISOPS'
`static int`	`IISSOLSTATUS`	IIS solution status.
`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`	`INPUTCOLS`	Number of columns (i.e.
`static int`	`INPUTROWS`	Number of rows (i.e.
`static int`	`INPUTTOL`	The zero tolerance for input values.
`static int`	`INVERTFREQ`	Simplex: The frequency with which the basis will be inverted.
`static int`	`INVERTMIN`	Specifies the minimum number of Simplex iterations between full inversions of the basis matrix.
`static int`	`IOTIMEOUT`	Specifies 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 whether the basis should be kept when reoptimizing a problem.
`static int`	`KEEPNROWS`	How nonbinding rows should be handled by the MPS reader.
`static int`	`KKT_CALCULATION_ACTIVITY_BASED`
`static int`	`KKT_CALCULATION_ACTIVITY_BOTH`
`static int`	`KKT_CALCULATION_MEASURE_BOTH`
`static int`	`KKT_CALCULATION_MINIMZE_KKT_ERROR`
`static int`	`KKT_CALCULATION_RECALCULATE_RDJ`
`static int`	`KKT_CALCULATION_RESPECT_BASIS`
`static int`	`KKT_JUST_CALCULATE`
`static int`	`KKT_UPDATE_MULTIPLIERS`
`static int`	`KNITRO_PARAM_ALGORITHM`	Indicates which algorithm to use to solve nonlinear problems
`static int`	`KNITRO_PARAM_BAR_DIRECTINTERVAL`	Controls the maximum number of consecutive conjugate gradient (CG) steps before Knitro will try to enforce that a step is taken using direct linear algebra.
`static int`	`KNITRO_PARAM_BAR_FEASIBLE`	Specifies whether special emphasis is placed on getting and staying feasible in the interior-point algorithms.
`static int`	`KNITRO_PARAM_BAR_FEASMODETOL`	Specifies the tolerance in the equation that determines whether Knitro will force subsequent iterates to remain feasible.
`static int`	`KNITRO_PARAM_BAR_INITMU`	Specifies the initial value for the barrier parameter `mu` used with the barrier algorithms.
`static int`	`KNITRO_PARAM_BAR_INITPT`	Indicates whether an initial point strategy is used with barrier algorithms.
`static int`	`KNITRO_PARAM_BAR_MAXBACKTRACK`	Indicates the maximum allowable number of backtracks during the linesearch of the Interior/Direct algorithm before reverting to a CG step.
`static int`	`KNITRO_PARAM_BAR_MAXCROSSIT`	Specifies the maximum number of crossover iterations before termination.
`static int`	`KNITRO_PARAM_BAR_MAXREFACTOR`	Indicates the maximum number of refactorizations of the KKT system per iteration of the Interior/Direct algorithm before reverting to a CG step.
`static int`	`KNITRO_PARAM_BAR_MURULE`	Indicates which strategy to use for modifying the barrier parameter mu in the barrier algorithms.
`static int`	`KNITRO_PARAM_BAR_PENCONS`	Indicates whether a penalty approach is applied to the constraints.
`static int`	`KNITRO_PARAM_BAR_PENRULE`	Indicates which penalty parameter strategy to use for determining whether or not to accept a trial iterate.
`static int`	`KNITRO_PARAM_BAR_RELAXCONS`	Control of type Integer.
`static int`	`KNITRO_PARAM_BAR_SWITCHRULE`	Indicates whether or not the barrier algorithms will allow switching from an optimality phase to a pure feasibility phase.
`static int`	`KNITRO_PARAM_BLASOPTION`	Control of type Integer.
`static int`	`KNITRO_PARAM_DEBUG`	Control of type Integer.
`static int`	`KNITRO_PARAM_DELTA`	Specifies the initial trust region radius scaling factor used to determine the initial trust region size.
`static int`	`KNITRO_PARAM_FEASTOL`	Specifies the final relative stopping tolerance for the feasibility error.
`static int`	`KNITRO_PARAM_FEASTOLABS`	Specifies the final absolute stopping tolerance for the feasibility error.
`static int`	`KNITRO_PARAM_GRADOPT`	Specifies how to compute the gradients of the objective and constraint functions.
`static int`	`KNITRO_PARAM_HESSOPT`	Specifies how to compute the (approximate) Hessian of the Lagrangian.
`static int`	`KNITRO_PARAM_HONORBNDS`	Indicates whether or not to enforce satisfaction of simple variable bounds throughout the optimization.
`static int`	`KNITRO_PARAM_INFEASTOL`	Specifies the (relative) tolerance used for declaring infeasibility of a model.
`static int`	`KNITRO_PARAM_LINSOLVER`	Control of type Integer.
`static int`	`KNITRO_PARAM_LMSIZE`	Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
`static int`	`KNITRO_PARAM_MA_TERMINATE`	Control of type Integer.
`static int`	`KNITRO_PARAM_MAXCGIT`	Specifies the maximum number of conjugate gradient (CG) iterations Knitro is allowed to perform during one minor iteration.
`static int`	`KNITRO_PARAM_MAXIT`	Specifies the maximum number of iterations before termination.
`static int`	`KNITRO_PARAM_MIP_BRANCHRULE`	Specifies which branching rule to use for MIP branch and bound procedure.
`static int`	`KNITRO_PARAM_MIP_DEBUG`	Control of type Integer.
`static int`	`KNITRO_PARAM_MIP_GUB_BRANCH`	Specifies whether or not to branch on generalized upper bounds (GUBs).
`static int`	`KNITRO_PARAM_MIP_HEUR_MAXIT`	Specifies the maximum number of iterations to allow for MIP heuristic, if one is enabled.
`static int`	`KNITRO_PARAM_MIP_HEURISTIC`	Specifies which MIP heuristic search approach to apply to try to find an initial integer feasible point.
`static int`	`KNITRO_PARAM_MIP_IMPLICATNS`	Specifies whether or not to add constraints to the MIP derived from logical implications.
`static int`	`KNITRO_PARAM_MIP_INTGAPABS`	The absolute integrality gap stop tolerance for MIP.
`static int`	`KNITRO_PARAM_MIP_INTGAPREL`	The relative integrality gap stop tolerance for MIP.
`static int`	`KNITRO_PARAM_MIP_KNAPSACK`	Specifies rules for adding MIP knapsack cuts.
`static int`	`KNITRO_PARAM_MIP_LPALG`	Specifies which algorithm to use for any linear programming (LP) subproblem solves that may occur in the MIP branch and bound procedure.
`static int`	`KNITRO_PARAM_MIP_MAXNODES`	Specifies the maximum number of nodes explored.
`static int`	`KNITRO_PARAM_MIP_METHOD`	Specifies which MIP method to use.
`static int`	`KNITRO_PARAM_MIP_OUTINTERVAL`	Specifies node printing interval for `KNITRO_PARAM_MIP_OUTLEVEL` when `KNITRO_PARAM_MIP_OUTLEVEL` > 0.
`static int`	`KNITRO_PARAM_MIP_OUTLEVEL`	Specifies how much MIP information to print.
`static int`	`KNITRO_PARAM_MIP_PSEUDOINIT`	Specifies the method used to initialize pseudo-costs corresponding to variables that have not yet been branched on in the MIP method.
`static int`	`KNITRO_PARAM_MIP_ROOTALG`	Specifies which algorithm to use for the root node solve in MIP (same options as `KNITRO_PARAM_ALGORITHM` user option).
`static int`	`KNITRO_PARAM_MIP_ROUNDING`	Specifies the MIP rounding rule to apply.
`static int`	`KNITRO_PARAM_MIP_SELECTRULE`	Specifies the MIP select rule for choosing the next node in the branch and bound tree.
`static int`	`KNITRO_PARAM_MIP_STRONG_CANDLIM`	Specifies the maximum number of candidates to explore for MIP strong branching.
`static int`	`KNITRO_PARAM_MIP_STRONG_LEVEL`	Specifies the maximum number of tree levels on which to perform MIP strong branching.
`static int`	`KNITRO_PARAM_MIP_STRONG_MAXIT`	Specifies the maximum number of iterations to allow for MIP strong branching solves.
`static int`	`KNITRO_PARAM_MSMAXBNDRANGE`	Control of type Double.
`static int`	`KNITRO_PARAM_MSMAXSOLVES`	Control of type Integer.
`static int`	`KNITRO_PARAM_MSNUMTOSAVE`	Control of type Integer.
`static int`	`KNITRO_PARAM_MSSAVETOL`	Control of type Double.
`static int`	`KNITRO_PARAM_MSSEED`	Control of type Integer.
`static int`	`KNITRO_PARAM_MSSTARTPTRANGE`	Control of type Double.
`static int`	`KNITRO_PARAM_MSTERMINATE`	Control of type Integer.
`static int`	`KNITRO_PARAM_MULTISTART`	Control of type Integer.
`static int`	`KNITRO_PARAM_NCVX_QCQP_INIT`	Specifies the initialization strategy used for non-convex QPs and QCQPs.
`static int`	`KNITRO_PARAM_NEWPOINT`	Control of type Integer.
`static int`	`KNITRO_PARAM_OBJRANGE`	Specifies the extreme limits of the objective function for purposes of determining unboundedness.
`static int`	`KNITRO_PARAM_OPTTOL`	Specifies the final relative stopping tolerance for the KKT (optimality) error.
`static int`	`KNITRO_PARAM_OPTTOLABS`	Specifies the final absolute stopping tolerance for the KKT (optimality) error.
`static int`	`KNITRO_PARAM_OUTLEV`	Controls the level of output produced by Knitro.
`static int`	`KNITRO_PARAM_PAR_NUMTHREADS`	Control of type Integer.
`static int`	`KNITRO_PARAM_PIVOT`	Control of type Double.
`static int`	`KNITRO_PARAM_PRESOLVE`	Determines whether or not to use the Knitro presolver to try to simplify the model by removing variables or constraints.
`static int`	`KNITRO_PARAM_PRESOLVE_TOL`	Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
`static int`	`KNITRO_PARAM_SCALE`	Performs a scaling of the objective and constraint functions based on their values at the initial point.
`static int`	`KNITRO_PARAM_SOC`	Specifies whether or not to try second order corrections (SOC).
`static int`	`KNITRO_PARAM_SOLTYPE`	This option specifies the solution returned by Knitro.
`static int`	`KNITRO_PARAM_XTOL`	The optimization process will terminate if the relative change in all components of the solution point estimate is less than `KNITRO_PARAM_XTOL`.
`static int`	`LNPBEST`	Specifies the maximum number of infeasible MIP entities to create lift-and-project cuts for during each round of Gomory cuts at the root node (see `GOMCUTS`).
`static int`	`LNPITERLIMIT`	Number of iterations to perform in improving each lift-and-project cut.
`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`	`LOCALSOLVER`	Selects the library to use for local solves
`static int`	`LOCALSOLVER_AUTO`
`static int`	`LOCALSOLVER_KNITRO`
`static int`	`LOCALSOLVER_OPTIMIZER`
`static int`	`LOCALSOLVER_XSLP`
`static int`	`LOCALSOLVERSELECTED`	Includes information of which Xpress solver has been used to solve the problem
`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`	`LPBACKGROUNDTHREADS`	Specifies the maximum number of threads to use for background work (typically heuristics) in parallel to the root LP relaxation of a MIP.
`static int`	`LPFLAGS`	A bit-vector control (see Section ) 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`	Simplex: Specifies 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`	`MARKOWITZTOL`	The Markowitz tolerance used for the factorization of the basis matrix.
`static int`	`MATRIXNAME`	The matrix name.
`static int`	`MATRIXTOL`	The zero tolerance for 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`	`MAXBANNERLENGTH`	Maximum length of banner message.
`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 `TIMELIMIT` (or the deprecated `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`	`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 or nonlinear 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`	Specifies 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 MB (megabytes) the Optimizer should allocate.
`static int`	`MAXMEMORYSOFT`	When `RESOURCESTRATEGY` is enabled, this control sets the maximum amount of memory in megabytes (MB) the Optimizer targets to allocate.
`static int`	`MAXMESSAGELENGTH`	Maximum length of messages.
`static int`	`MAXMIPINFEAS`	Maximum integer fractionality in the solution.
`static int`	`MAXMIPSOL`	Branch and Bound: 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: Specifies the maximum number of nodes that will be explored.
`static int`	`MAXPAGELINES`	Specifies the 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 (not including the null terminator).
`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`	Deprecated. since 41.00
`static int`	`MAXTOTALTREEFILESIZE`	Specifies the maximum amount of disk space, in megabytes (MB), that can be used for storing tree data for a single problem.
`static int`	`MAXTREEFILESIZE`	Specifies the maximum size, in megabytes (MB), to which a single tree file may grow.
`static int`	`MCFCUTSTRATEGY`	Deprecated. since 48.01
`static int`	`MEMORYLIMITDETECTED`	The detected amount of memory accessible to the solver process, in megabytes.
`static double`	`MINUSINFINITY`	Negative infinity.
`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 tree 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 tree 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 tree 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 tree 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`	Deprecated. since 48.00
`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 MIP 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`	MIP log print control.
`static int`	`MIPOBJVAL`	Objective function value of the best integer solution found.
`static int`	`MIPPRESOLVE`	Branch and Bound: Type of integer processing to be performed at nodes.
`static int`	`MIPPRESOLVE_ALLOW_CHANGE_BOUNDS`	Deprecated. since 48.00
`static int`	`MIPPRESOLVE_ALLOW_TREE_RESTART`	Deprecated. since 48.00
`static int`	`MIPPRESOLVE_DUAL_REDUCTIONS`	Deprecated. since 48.00
`static int`	`MIPPRESOLVE_GLOBAL_COEFFICIENT_TIGHTENING`	Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_LOGIC_PREPROCESSING`	Deprecated. since 48.00
`static int`	`MIPPRESOLVE_OBJECTIVE_BASED_REDUCTIONS`	Constant used in enumeration 'MIPPRESOLVE'
`static int`	`MIPPRESOLVE_REDUCED_COST_FIXING`	Deprecated. since 48.00
`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 incumbent 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 branch and bound tree 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 branch and bound tree 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`	`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`	(MIP) solution status.
`static int`	`MIPSTOPSTAGE`	This control allows stopping a MIP solve in an early stage of the solution process.
`static int`	`MIPSTOPSTAGE_INITIALRELAXATION`	Constant used in enumeration 'MIPSTOPSTAGE'
`static int`	`MIPSTOPSTAGE_NONE`	Constant used in enumeration 'MIPSTOPSTAGE'
`static int`	`MIPSTOPSTAGE_PREROOTHEURS`	Constant used in enumeration 'MIPSTOPSTAGE'
`static int`	`MIPSTOPSTAGE_PRESOLVE`	Constant used in enumeration 'MIPSTOPSTAGE'
`static int`	`MIPSTOPSTAGE_ROOTNODE`	Constant used in enumeration 'MIPSTOPSTAGE'
`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`	Specifies the 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`	When reading an MPS file, this control determines which entries from the `BOUNDS` section will be read.
`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`	`MPSOBJNAME`	When reading an MPS file, this control determines which neutral row will be read as the objective function.
`static int`	`MPSRANGENAME`	When reading an MPS file, this control determines which entries from the `RANGES` section will be read.
`static int`	`MPSRHSNAME`	When reading an MPS file, this control determines which entries from the `RHS` section will be read.
`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`	`MSMAXBOUNDRANGE`	Defines the maximum range inside which initial points are generated by multistart presets
`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`	`MSSET_INITIALFILTERED`
`static int`	`MSSET_INITIALVALUES`
`static int`	`MSSET_KNITRO_BASIC`
`static int`	`MSSET_KNITRO_EXTENDED`
`static int`	`MSSET_SLP_BASIC`
`static int`	`MSSET_SLP_EXTENDED`
`static int`	`MSSET_SOLVERS`
`static int`	`MULTIOBJLOG`	Log level for multi-objective optimization.
`static int`	`MULTIOBJOPS`	Modifies the behaviour of the Optimizer when solving multi-objective problems.
`static int`	`MULTIOBJOPS_ENABLED`	Constant used in enumeration 'MULTIOBJOPS'
`static int`	`MULTIOBJOPS_NOSOLVEATTRIBS`	Constant used in enumeration 'MULTIOBJOPS'
`static int`	`MULTIOBJOPS_PRESOLVE`	Constant used in enumeration 'MULTIOBJOPS'
`static int`	`MULTIOBJOPS_RCFIXING`	Constant used in enumeration 'MULTIOBJOPS'
`static int`	`MULTISTART`	The multistart main control.
`static int`	`MULTISTART_LOG`	The level of logging during the multistart run.
`static int`	`MULTISTART_MAXSOLVES`	The maximum number of jobs to create during the multistart search.
`static int`	`MULTISTART_MAXTIME`	The maximum total time to be spent in the multistart search.
`static int`	`MULTISTART_POOLSIZE`	The maximum number of problem objects allowed to pool up before synchronization in the deterministic multistart.
`static int`	`MULTISTART_SEED`	Random seed used for the automatic generation of initial point when loading multistart presets
`static int`	`MULTISTART_THREADS`	The maximum number of threads to be used in multistart
`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`	`NAMES_COLUMN`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_GENCONS`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_INTERNALFUNC`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_INTERNALFUNCNOCASE`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_OBJECTIVE`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_PWLCONS`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_ROW`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_SET`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_USERFUNC`	Constant used in enumeration 'NAMESPACES'
`static int`	`NAMES_USERFUNCNOCASE`	Constant used in enumeration 'NAMESPACES'
`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`	`NLP1DERIVATIVE`
`static int`	`NLP2DERIVATIVE`
`static int`	`NLPALLCALCS`
`static int`	`NLPALLDERIVATIVES`
`static int`	`NLPCALCTHREADS`	Number of threads used for formula and derivatives evaluations
`static int`	`NLPDEFAULTIV`	Default initial value for an SLP variable if none is explicitly given
`static int`	`NLPDERIVATIVES`	Bitmap describing the method of calculating derivatives
`static int`	`NLPDETERMINISTIC`	Determines if the parallel features of SLP should be guaranteed to be deterministic
`static int`	`NLPEQUALSCOLUMN`	Index of the reserved "=" column
`static int`	`NLPEVALUATE`	Evaluation strategy for user functions
`static int`	`NLPFINDIV`	Option for running a heuristic to find a feasible initial point
`static int`	`NLPFORMULACOEFFCOLUMNINDEX`
`static int`	`NLPFUNCEVAL`	Bit map for determining the method of evaluating user functions and their derivatives
`static int`	`NLPHESSIAN`	Second order differentiation mode when using analytical derivatives
`static int`	`NLPIFS`	Number of internal functions
`static int`	`NLPIMPLICITVARIABLES`	Number of SLP variables appearing only in coefficients
`static int`	`NLPINFINITY`	Value returned by a divide-by-zero in a formula
`static int`	`NLPINSTANCEFUNCTION`
`static int`	`NLPINTERNALFUNCNAMES`
`static int`	`NLPINTERNALFUNCNAMESNOCASE`
`static int`	`NLPJACOBIAN`	First order differentiation mode when using analytical derivatives
`static int`	`NLPJOBID`	Unique identifier for the current job
`static int`	`NLPKEEPBESTITER`	The iteration in which the returned solution has been found.
`static int`	`NLPLINQUADBR`	Use linear and quadratic constraints and objective function to further reduce bounds on all variables
`static int`	`NLPLOG`	Level of printing during SLP iterations
`static int`	`NLPMAXTIME`	The maximum time in seconds that the SLP optimization will run before it terminates
`static int`	`NLPMERITLAMBDA`	Factor by which the net objective is taken into account in the merit function
`static int`	`NLPMODELCOLS`	Number of model columns in the problem
`static int`	`NLPMODELROWS`	Number of model rows in the problem
`static int`	`NLPOBJECTIVEROWINDEX`
`static int`	`NLPOBJVAL`	Objective function value excluding any penalty costs
`static int`	`NLPOPTTIME`	Time spent in optimization
`static int`	`NLPORIGINALCOLS`	Number of model columns in the extended original problem
`static int`	`NLPORIGINALROWS`	Number of model rows in the extended original problem
`static int`	`NLPPOSTSOLVE`	This control determines whether postsolving should be performed automatically
`static int`	`NLPPRESOLVE`	This control determines whether presolving should be performed on the nonlinear problem prior to starting the main algorithm
`static int`	`NLPPRESOLVE_ELIMTOL`	Tolerance for nonlinear eliminations during SLP presolve
`static int`	`NLPPRESOLVEDOMAIN`
`static int`	`NLPPRESOLVEELIMINATIONS`	Number of SLP variables eliminated by `XSLPpresolve`
`static int`	`NLPPRESOLVEFIXALL`
`static int`	`NLPPRESOLVEFIXZERO`
`static int`	`NLPPRESOLVEINTBOUNDS`
`static int`	`NLPPRESOLVELEVEL`	This control determines the level of changes presolve may carry out on the problem and whether column/row indices may change
`static int`	`NLPPRESOLVELEVEL_BASIC`
`static int`	`NLPPRESOLVELEVEL_FULL`
`static int`	`NLPPRESOLVELEVEL_LINEAR`
`static int`	`NLPPRESOLVELEVEL_LOCALIZED`
`static int`	`NLPPRESOLVEOPS`	Bitmap indicating the SLP presolve actions to be taken
`static int`	`NLPPRESOLVEOPS_ELIMINATIONS`
`static int`	`NLPPRESOLVEOPS_GENERAL`
`static int`	`NLPPRESOLVEOPS_NO_DUAL_SIDE`
`static int`	`NLPPRESOLVEOPS_NOLINEAR`
`static int`	`NLPPRESOLVEOPS_NOSIMPLIFIER`
`static int`	`NLPPRESOLVEPROTECT`
`static int`	`NLPPRESOLVESETBOUNDS`
`static int`	`NLPPRESOLVEZERO`	Minimum absolute value for a variable which is identified as nonzero during SLP presolve
`static int`	`NLPPRIMALINTEGRALALPHA`	Decay term for primal integral computation
`static int`	`NLPPRIMALINTEGRALREF`	Reference solution value to take into account when calculating the primal integral
`static int`	`NLPPROBING`	This control determines whether probing on a subset of variables should be performed prior to starting the main algorithm.
`static int`	`NLPRECALC`
`static int`	`NLPREFORMULATE`	Controls the problem reformulations carried out before augmentation.
`static int`	`NLPREFORMULATE_ABS`
`static int`	`NLPREFORMULATE_ALLABS`
`static int`	`NLPREFORMULATE_ALLMINMAX`
`static int`	`NLPREFORMULATE_MINMAX`
`static int`	`NLPREFORMULATE_PWL`
`static int`	`NLPREFORMULATE_QCQP2SLP`
`static int`	`NLPREFORMULATE_QP2SLP`
`static int`	`NLPREFORMULATE_QPSOLVE`
`static int`	`NLPREFORMULATE_SLP2QCQP`
`static int`	`NLPREFORMULATE_SLP2QP`
`static int`	`NLPREFORMULATE_SOCP2SLP`
`static int`	`NLPSOLSTATUS_GLOBALLYOPTIMAL_NODUALS`
`static int`	`NLPSOLSTATUS_GLOBALLYOPTIMAL_WITHDUALS`
`static int`	`NLPSOLSTATUS_LOCALLYOPTIMAL_WITHDUALS`
`static int`	`NLPSOLSTATUS_NONE`
`static int`	`NLPSOLSTATUS_SOLUTION_NODUALS`
`static int`	`NLPSOLVER`	Controls whether to call FICO Xpress Global or one of the local solvers
`static int`	`NLPSOLVER_AUTOMATIC`
`static int`	`NLPSOLVER_GLOBAL`
`static int`	`NLPSOLVER_LOCAL`
`static int`	`NLPSTATUS`	The solution status of the problem.
`static int`	`NLPSTATUS_INFEASIBLE`
`static int`	`NLPSTATUS_LOCALLY_INFEASIBLE`
`static int`	`NLPSTATUS_LOCALLY_OPTIMAL`
`static int`	`NLPSTATUS_NOSOLUTION`
`static int`	`NLPSTATUS_OPTIMAL`
`static int`	`NLPSTATUS_SOLUTION`
`static int`	`NLPSTATUS_UNBOUNDED`
`static int`	`NLPSTATUS_UNFINISHED`
`static int`	`NLPSTATUS_UNSOLVED`
`static int`	`NLPSTATUS_UNSTARTED`
`static int`	`NLPSTOPOUTOFRANGE`	Stop optimization and return error code if internal function argument is out of range
`static int`	`NLPSTOPSTATUS`	Status of the optimization process.
`static int`	`NLPTHREADS`	Default number of threads to be used
`static int`	`NLPTHREADSAFEUSERFUNC`	Defines if user functions are allowed to be called in parallel
`static int`	`NLPTOLCALC`
`static int`	`NLPUFS`	Number of user functions
`static int`	`NLPUSEDERIVATIVES`	Indicates whether numeric or analytic derivatives were used to create the linear approximations and solve the problem
`static int`	`NLPUSERFUNCCALLS`	Number of calls made to user functions
`static int`	`NLPUSERFUNCNAMES`
`static int`	`NLPUSERFUNCNAMESNOCASE`
`static int`	`NLPVALIDATIONFACTOR`	Minimum improvement in validation targets to continue iterating
`static int`	`NLPVALIDATIONINDEX_A`	Absolute validation index
`static int`	`NLPVALIDATIONINDEX_K`	Relative first order optimality validation index
`static int`	`NLPVALIDATIONINDEX_R`	Relative validation index
`static int`	`NLPVALIDATIONTARGET_K`	Optimality target tolerance
`static int`	`NLPVALIDATIONTARGET_R`	Feasibility target tolerance
`static int`	`NLPVALIDATIONTOL_A`	Absolute tolerance for the XSLPvalidate procedure
`static int`	`NLPVALIDATIONTOL_K`	Relative tolerance for the XSLPvalidatekkt procedure
`static int`	`NLPVALIDATIONTOL_R`	Relative tolerance for the XSLPvalidate procedure
`static int`	`NLPVARIABLES`	Number of SLP variables
`static int`	`NLPZERO`	Absolute tolerance
`static int`	`NODEAPPLIEDBOUNDS`	This control determines whether the solver is allowed to apply primal reductions at each node.
`static int`	`NODEAPPLIEDBOUNDS_ALL`	Constant used in enumeration 'NODEAPPLIEDBOUNDS'
`static int`	`NODEAPPLIEDBOUNDS_AUTOMATIC`	Constant used in enumeration 'NODEAPPLIEDBOUNDS'
`static int`	`NODEAPPLIEDBOUNDS_MIPENTITIES`	Constant used in enumeration 'NODEAPPLIEDBOUNDS'
`static int`	`NODEAPPLIEDBOUNDS_OFF`	Constant used in enumeration 'NODEAPPLIEDBOUNDS'
`static int`	`NODEDEPTH`	Depth of the current node.
`static int`	`NODEDUALREDUCTIONS`	This control determines whether the solver is allowed to apply dual reductions at each node.
`static int`	`NODEPRESOLVE`	This control determines whether some form of presolving should be performed at Branch and Bound nodes.
`static int`	`NODEPRESOLVE_AUTOMATIC`	Constant used in enumeration 'NODEPRESOLVE'
`static int`	`NODEPRESOLVE_CONSERVATIVE`	Constant used in enumeration 'NODEPRESOLVE'
`static int`	`NODEPRESOLVE_MODERATE`	Constant used in enumeration 'NODEPRESOLVE'
`static int`	`NODEPRESOLVE_OFF`	Constant used in enumeration 'NODEPRESOLVE'
`static int`	`NODEPROBINGEFFORT`	Adjusts the overall level of node probing.
`static int`	`NODEREDCOSTTIGHTEN`	This control determines whether reduced cost tightening is applied during Branch and Bound.
`static int`	`NODEREDCOSTTIGHTEN_AGGRESSIVE`	Constant used in enumeration 'NODEREDCOSTTIGHTEN'
`static int`	`NODEREDCOSTTIGHTEN_AUTOMATIC`	Constant used in enumeration 'NODEREDCOSTTIGHTEN'
`static int`	`NODEREDCOSTTIGHTEN_MODERATE`	Constant used in enumeration 'NODEREDCOSTTIGHTEN'
`static int`	`NODEREDCOSTTIGHTEN_OFF`	Constant used in enumeration 'NODEREDCOSTTIGHTEN'
`static int`	`NODES`	Number of nodes solved so far in the MIP 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`	`NONLINEARCONSTRAINTS`	Number of nonlinear constraints in the problem
`static int`	`NUMERICALEMPHASIS`	How much emphasis to place on numerical stability instead of solve speed.
`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`	`OBJECTIVE_ABSTOL`	Constant used in enumeration 'OBJCONTROL'
`static int`	`OBJECTIVE_PRIORITY`	Constant used in enumeration 'OBJCONTROL'
`static int`	`OBJECTIVE_RELTOL`	Constant used in enumeration 'OBJCONTROL'
`static int`	`OBJECTIVE_RHS`	Constant used in enumeration 'OBJCONTROL'
`static int`	`OBJECTIVE_WEIGHT`	Constant used in enumeration 'OBJCONTROL'
`static int`	`OBJECTIVES`	Number of objectives in the problem.
`static int`	`OBJNAME`	Deprecated. since 41.00
`static int`	`OBJRHS`	Fixed part of the objective function.
`static int`	`OBJSCALEFACTOR`	Custom objective scaling factor, expressed as a power of 2.
`static int`	`OBJSENSE`	Sense of the optimization being performed.
`static int`	`OBJSTOSOLVE`	Number of objectives that will be solved during the current multi-objective solve.
`static int`	`OBJVAL`	Value of the objective function of the last problem solved with XPRSoptimize.
`static int`	`OBSERVEDPRIMALINTEGRAL`	Value of the (observed) primal integral.
`static int`	`OP_DIVIDE`
`static int`	`OP_EXPONENT`
`static int`	`OP_MINUS`
`static int`	`OP_MULTIPLY`
`static int`	`OP_PLUS`
`static int`	`OP_UMINUS`
`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`	`OPTIMIZERVERSION`	The Optimizer version number, e.g., `4601` meaning release 46.01.
`static int`	`OPTIMIZETYPE_GLOBAL`	Constant used in enumeration 'OPTIMIZETYPE'
`static int`	`OPTIMIZETYPE_LOCAL`	Constant used in enumeration 'OPTIMIZETYPE'
`static int`	`OPTIMIZETYPE_LP`	Constant used in enumeration 'OPTIMIZETYPE'
`static int`	`OPTIMIZETYPE_MIP`	Constant used in enumeration 'OPTIMIZETYPE'
`static int`	`OPTIMIZETYPE_NONE`	Constant used in enumeration 'OPTIMIZETYPE'
`static int`	`OPTIMIZETYPEUSED`	The type of solver used in the last call to `XPRSoptimize`, `XPRSmipoptimize`, `XPRSlpoptimize` or `XPRSnlpoptimize`.
`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 MIP 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 non-zeros in the original objective 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`	Specifies the 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`	`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: Specifies the zero tolerance for pivot elements.
`static double`	`PLUSINFINITY`	Positive infinity.
`static int`	`POOLABSGAP`	Limit on the absolute gap between the objective function values of the best and worst solutions in the pool.
`static int`	`POOLBESTBOUND`	Best bound on the objective value of any MIP solution that can be found in the remainder of the branch-and-bound search.
`static int`	`POOLDUPLICATECHECK`	When extended branch-and-bound search for additional solutions has been enabled through `POOLENUMSTRATEGY`, this control determines which MIP column entities to consider when checking if two solutions should be considered duplicates.
`static int`	`POOLENUMSTRATEGY`	Enables extended branch-and-bound search strategies to identify and capture additional solutions into the solution pool.
`static int`	`POOLENUMSTRATEGY_EXTENDED`	Constant used in enumeration 'POOLENUMSTRATEGY'
`static int`	`POOLENUMSTRATEGY_FULL`	Constant used in enumeration 'POOLENUMSTRATEGY'
`static int`	`POOLENUMSTRATEGY_STANDARD`	Constant used in enumeration 'POOLENUMSTRATEGY'
`static int`	`POOLKEEPSOLS`	Limits the number of collected solutions that should automatically be transferred into a next solve.
`static int`	`POOLLIMIT`	Determines the maximum number of solutions to be collected during a solve with `XPRSoptimize`, `XPRSmipoptimize` or `XPRSnlpoptimize`.
`static int`	`POOLRELGAP`	Limit on the relative gap between the objective function values of the best and worst solutions in the pool.
`static int`	`POOLSIZE`	The number of solutions that have been collected during the last solve.
`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 constraints should be used for inferring bound reductions on variables when solving a MIP.
`static int`	`PRECLIQUELIFTING`	Presolve: Determines whether to do clique lifting.
`static int`	`PRECLIQUELIFTING_AUTOMATIC`	Constant used in enumeration 'PRECLIQUELIFTING'
`static int`	`PRECLIQUELIFTING_OFF`	Constant used in enumeration 'PRECLIQUELIFTING'
`static int`	`PRECLIQUELIFTING_ON`	Constant used in enumeration 'PRECLIQUELIFTING'
`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`	`PRECONFIGURATION`	MIP Presolve: determines whether binary rows with only few repeating coefficients should be reformulated.
`static int`	`PRECONVERTOBJTOCONS`	Presolve: convert a linear or quadratic objective function into an objective transfer constraint
`static int`	`PRECONVERTSEPARABLE`	Presolve: reformulate problems with a 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`	`PREDOMCOL_GENERAL`	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`	`PREDUALREDUCTIONS`	This control determines whether the solver is allowed to apply dual reductions during presolve.
`static int`	`PREDUPROW`	Presolve: Determines the type of duplicate rows to look for and eliminate when presolving a problem.
`static int`	`PREELIMINATIONS`	Presolve: Determines whether to performe variable eliminations.
`static int`	`PREELIMINATIONS_ALL`	Constant used in enumeration 'PREELIMINATIONS'
`static int`	`PREELIMINATIONS_AUTOMATIC`	Constant used in enumeration 'PREELIMINATIONS'
`static int`	`PREELIMINATIONS_NONMIPENTITIES`	Constant used in enumeration 'PREELIMINATIONS'
`static int`	`PREELIMINATIONS_OFF`	Constant used in enumeration 'PREELIMINATIONS'
`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`	`PREMIPENTDETECT`	Presolve: Determines whether to do integer variable and SOS detection.
`static int`	`PREMIPENTDETECT_AUTOMATIC`	Constant used in enumeration 'PREMIPENTDETECT'
`static int`	`PREMIPENTDETECT_OFF`	Constant used in enumeration 'PREMIPENTDETECT'
`static int`	`PREMIPENTDETECT_ON`	Constant used in enumeration 'PREMIPENTDETECT'
`static int`	`PREMIPREDUCTIONS`	Presolve: Determines whether to do integrality based reductions.
`static int`	`PREMIPREDUCTIONS_ADVANCED`	Constant used in enumeration 'PREMIPREDUCTIONS'
`static int`	`PREMIPREDUCTIONS_AUTOMATIC`	Constant used in enumeration 'PREMIPREDUCTIONS'
`static int`	`PREMIPREDUCTIONS_OFF`	Constant used in enumeration 'PREMIPREDUCTIONS'
`static int`	`PREMIPREDUCTIONS_SIMPLE`	Constant used in enumeration 'PREMIPREDUCTIONS'
`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 (see Section ) specifies whether to randomly permute rows, columns and MIP entities when starting the presolve.
`static int`	`PREPERMUTE_COLUMNS`	Constant used in enumeration 'PREPERMUTE'
`static int`	`PREPERMUTE_ENTITIES`	Constant used in enumeration 'PREPERMUTE'
`static int`	`PREPERMUTE_ROWS`	Constant used in enumeration 'PREPERMUTE'
`static int`	`PREPERMUTESEED`	This control specifies 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`	`PREROOTEFFORT`	Dial for the work spent during the Pre-root parallel heuristic phase.
`static int`	`PREROOTTHREADS`	Specifies an explicit number of threads that should be used for the Pre-root parallel heuristic phase.
`static int`	`PREROOTWORKLIMIT`	Set an explicit work limit in work units for the Pre-root parallel heuristic phase.
`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`	`PRESOLVE_REMOVEREDUNDANTBOUNDS`	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 (see Section ) specifies the operations which are performed during the presolve.
`static int`	`PRESOLVEOPS_DUALREDUCTIONS`	Deprecated. since 48.00
`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`	Deprecated. since 48.00
`static int`	`PRESOLVEOPS_NOADVANCEDIPREDUCTIONS`	Deprecated. since 48.00
`static int`	`PRESOLVEOPS_NOCLIQUEPRESOLVE`	Deprecated. since 48.00
`static int`	`PRESOLVEOPS_NODUALREDONGLOBALS`	Deprecated. since 48.00
`static int`	`PRESOLVEOPS_NOGLOBALDOMAINCHANGE`	Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NOIMPLIEDBOUNDS`	Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NOINTEGERELIMINATIONS`	Deprecated. since 48.00
`static int`	`PRESOLVEOPS_NOINTEGERVARIABLEANDSOSDETECTION`	Deprecated. since 48.00
`static int`	`PRESOLVEOPS_NOIPREDUCTIONS`	Deprecated. since 48.00
`static int`	`PRESOLVEOPS_NOMOD2REDUCTIONS`	Constant used in enumeration 'PRESOLVEOPS'
`static int`	`PRESOLVEOPS_NOSOLUTIONENUMERATION`	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`	Deprecated. since 48.00
`static int`	`PRESOLVEPASSES`	Number of reduction rounds to be performed in presolve
`static int`	`PRESOLVESTATE`	Problem status as a bit-vector (compare Section ).
`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 (see Section ) specifies whether to sort rows, columns and MIP entities by their names when starting the presolve.
`static int`	`PRESORT_COLUMNS`	Constant used in enumeration 'PRESORT'
`static int`	`PRESORT_ENTITIES`	Constant used in enumeration 'PRESORT'
`static int`	`PRESORT_ROWS`	Constant used in enumeration 'PRESORT'
`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`	`PRICING_STEEPEST_EDGE`	Constant used in enumeration 'PRICING'
`static int`	`PRICING_STEEPEST_EDGE_UNIT_WEIGHTS`	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`	`PRIMALOPS`	Primal simplex: allows fine tuning the variable selection in the primal simplex solver.
`static int`	`PRIMALOPS_AGGRESSIVE_DJSCALE`	Constant used in enumeration 'PRIMALOPS'
`static int`	`PRIMALOPS_CONSERVATIVE_PARTIAL_PRICING_SWITCH`	Constant used in enumeration 'PRIMALOPS'
`static int`	`PRIMALOPS_CONVENTIONAL_DJSCALE`	Constant used in enumeration 'PRIMALOPS'
`static int`	`PRIMALOPS_DYNAMIC_PRICING_SWITCH`	Constant used in enumeration 'PRIMALOPS'
`static int`	`PRIMALOPS_NOABORTCYCLING`	Constant used in enumeration 'PRIMALOPS'
`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`	Deprecated. since 48.01
`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 non-zeros in the objective.
`static int`	`QSIMPLEXOPS`	Controls the behavior of the quadratic simplex solvers via a bit-vector (see Section ).
`static int`	`QSIMPLEXOPS_CAUTIOUSPERTURBATION`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_CROSSOVERCLEANUP`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_DUALPHASE1BIGM`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_DUALPHASE1TRADITIONAL`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_EXTENDEDDUALCRASH`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_FORCEDUALBOUNDS`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_FULLPRICING`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_NOBARRIERFALLBACK`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_NODUALCRASH`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_NOWARMSTART`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_PARTIALPRICING`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_PHASE1BARRIER`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_PHASE1DUAL`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_PHASE1PRIMAL`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_PRIMALPHASE1BIGM`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_PRIMALPHASE1TRADITIONAL`	Constant used in enumeration 'QSIMPLEXOPS'
`static int`	`QSIMPLEXOPS_TRADITIONALSCALE`	Constant used in enumeration 'QSIMPLEXOPS'
`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_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 tree 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 over binary columns positive definite when it is possible.
`static int`	`REPAIRINFEASTIMELIMIT`	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`	`RESTARTS`	Total number of restarts performed.
`static int`	`RHSNAME`	Active right hand side name.
`static int`	`RLTCUTS`	Deprecated. since 48.01
`static int`	`ROOTPRESOLVE`	Determines if presolving should be performed on the problem after the tree 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 MIP 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 MIP entity to branch on.
`static int`	`SBESTIMATE`	Branch and Bound: How to calculate pseudo costs from the local node when selecting an infeasible MIP entity to branch on.
`static int`	`SBITERLIMIT`	Specifies the number of dual iterations to perform during strong branching for each MIP entity.
`static int`	`SBSELECT`	The size of the candidate list of MIP entities for strong branching.
`static int`	`SCALING`	Deprecated. since 48.00
`static int`	`SCALING_BEFORE_PRESOLVE`	Deprecated. since 48.00
`static int`	`SCALING_BIGM`	Deprecated. since 48.00
`static int`	`SCALING_BY_MAX_ELEM_NOT_GEO_MEAN`	Deprecated. since 48.00
`static int`	`SCALING_COLUMN_SCALING`	Deprecated. since 48.00
`static int`	`SCALING_CURTIS_REID`	Deprecated. since 48.00
`static int`	`SCALING_DISABLE_GLOBAL_OBJECTIVE_SCALING`	Deprecated. since 48.00
`static int`	`SCALING_IGNORE_QUADRATIC_ROW_PART`	Deprecated. since 48.00
`static int`	`SCALING_MAXIMUM`	Deprecated. since 48.00
`static int`	`SCALING_NO_AGGRESSIVE_Q_SCALING`	Deprecated. since 48.00
`static int`	`SCALING_NO_SCALING_COLUMNS_DOWN`	Deprecated. since 48.00
`static int`	`SCALING_NO_SCALING_ROWS_UP`	Deprecated. since 48.00
`static int`	`SCALING_RHS_SCALING`	Deprecated. since 48.00
`static int`	`SCALING_ROW_SCALING`	Deprecated. since 48.00
`static int`	`SCALING_ROW_SCALING_AGAIN`	Deprecated. since 48.00
`static int`	`SCALING_SIMPLEX_OBJECTIVE_SCALING`	Deprecated. since 48.00
`static int`	`SCALING_SLACK_SCALING`	Deprecated. since 48.00
`static int`	`SCALINGBIGM`	Whether to apply special handling of big-M rows during scaling.
`static int`	`SCALINGBIGM_AUTOMATIC`	Constant used in enumeration 'SCALINGBIGM'
`static int`	`SCALINGBIGM_OFF`	Constant used in enumeration 'SCALINGBIGM'
`static int`	`SCALINGBIGM_ON`	Constant used in enumeration 'SCALINGBIGM'
`static int`	`SCALINGMETHOD`	Which scaling method to use.
`static int`	`SCALINGMETHOD_AUTOMATIC`	Constant used in enumeration 'SCALINGMETHOD'
`static int`	`SCALINGMETHOD_CURTISREID`	Constant used in enumeration 'SCALINGMETHOD'
`static int`	`SCALINGMETHOD_GEOMETRICMEAN`	Constant used in enumeration 'SCALINGMETHOD'
`static int`	`SCALINGMETHOD_MAXIMUM`	Constant used in enumeration 'SCALINGMETHOD'
`static int`	`SCALINGMETHOD_MAXIMUMCURTISREID`	Constant used in enumeration 'SCALINGMETHOD'
`static int`	`SCALINGMETHOD_OFF`	Constant used in enumeration 'SCALINGMETHOD'
`static int`	`SCALINGOPS`	This bit-vector control (see Section ) is allows finer-grained control of the scaling process.
`static int`	`SCALINGOPS_COLUMN_SCALING`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_DISABLE_GLOBAL_OBJECTIVE_SCALING`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_IGNORE_QUADRATIC_ROW_PART`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_NO_AGGRESSIVE_Q_SCALING`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_NO_SCALING_COLUMNS_DOWN`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_NO_SCALING_ROWS_UP`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_RHS_SCALING`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_ROW_SCALING`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_ROW_SCALING_AGAIN`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGOPS_SLACK_SCALING`	Constant used in enumeration 'SCALINGOPS'
`static int`	`SCALINGORDER`	When scaling is applied relative to presolve.
`static int`	`SCALINGORDER_AFTERPRESOLVE`	Constant used in enumeration 'SCALINGORDER'
`static int`	`SCALINGORDER_AUTOMATIC`	Constant used in enumeration 'SCALINGORDER'
`static int`	`SCALINGORDER_BEFOREANDAFTERPRESOLVE`	Constant used in enumeration 'SCALINGORDER'
`static int`	`SCALINGORDER_BEFOREPRESOLVE`	Constant used in enumeration 'SCALINGORDER'
`static int`	`SCALINGSIMPLEXOBJ_AUTOMATIC`	Constant used in enumeration 'SCALINGSIMPLEXOBJ'
`static int`	`SCALINGSIMPLEXOBJ_OFF`	Constant used in enumeration 'SCALINGSIMPLEXOBJ'
`static int`	`SCALINGSIMPLEXOBJ_ON`	Constant used in enumeration 'SCALINGSIMPLEXOBJ'
`static int`	`SDPCUTSTRATEGY`	Deprecated. since 48.01
`static int`	`SDPCUTSTRATEGY_AGGRESSIVE`	Deprecated. since 48.01
`static int`	`SDPCUTSTRATEGY_CONSERVATIVE`	Deprecated. since 48.01
`static int`	`SDPCUTSTRATEGY_DEFAULT`	Deprecated. since 48.01
`static int`	`SDPCUTSTRATEGY_MODERATE`	Deprecated. since 48.01
`static int`	`SDPCUTSTRATEGY_NONE`	Deprecated. since 48.01
`static int`	`SERIALIZEPREINTSOL`	Setting `SERIALIZEPREINTSOL` to 1 will ensure that the `preintsol` callback is always 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`	`SLPACTIVEPENALTY`
`static int`	`SLPACTIVESBROW`
`static int`	`SLPACTIVESTEPBOUND`
`static int`	`SLPALGORITHM`	Bit map describing the SLP algorithm(s) to be used
`static int`	`SLPALLERRORVECTORS`
`static int`	`SLPALLROWERRORVECTORS`
`static int`	`SLPAMEANWEIGHT`
`static int`	`SLPANALYZE`	Bit map activating additional options supporting model / solution path analysis
`static int`	`SLPANALYZE_AUTOSAVEPOOL`
`static int`	`SLPANALYZE_EXTENDEDFINALSUMMARY`
`static int`	`SLPANALYZE_INFEASIBLE_ITERATION`
`static int`	`SLPANALYZE_RECORDCASCADE`
`static int`	`SLPANALYZE_RECORDLINEARIZATION`
`static int`	`SLPANALYZE_RECORDLINESEARCH`
`static int`	`SLPANALYZE_SAVEFILE`
`static int`	`SLPANALYZE_SAVEITERBASIS`
`static int`	`SLPANALYZE_SAVELINEARIZATIONS`
`static int`	`SLPATOL_A`	Absolute delta convergence tolerance
`static int`	`SLPATOL_R`	Relative delta convergence tolerance
`static int`	`SLPAUGMENTATION`	Bit map describing the SLP augmentation method(s) to be used
`static int`	`SLPAUTOSAVE`	Frequency with which to save the model
`static int`	`SLPBARCROSSOVERSTART`	Default crossover activation behaviour for barrier start
`static int`	`SLPBARLIMIT`	Number of initial SLP iterations using the barrier method
`static int`	`SLPBARSTALLINGLIMIT`	Number of iterations to allow numerical failures in barrier before switching to dual
`static int`	`SLPBARSTALLINGOBJLIMIT`	Number of iterations over which to measure the objective change for barrier iterations with no crossover
`static int`	`SLPBARSTALLINGTOL`	Required change in the objective when progress is measured in barrier iterations without crossover
`static int`	`SLPBARSTARTOPS`	Controls behaviour when the barrier is used to solve the linearizations
`static int`	`SLPBARSTARTOPS_ALLOWINTERIORSOLUTION`
`static int`	`SLPBARSTARTOPS_POSTSOLVEFEASIBLITY`
`static int`	`SLPBARSTARTOPS_STALLING_NUMERICAL`
`static int`	`SLPBARSTARTOPS_STALLING_OBJECTIVE`
`static int`	`SLPBOUNDSSET`
`static int`	`SLPBOUNDTHRESHOLD`	The maximum size of a bound that can be introduced by nonlinear presolve.
`static int`	`SLPCASCADE`	Bit map describing the cascading to be used
`static int`	`SLPCASCADE_ALL`
`static int`	`SLPCASCADE_ALL_COEF_VAR`
`static int`	`SLPCASCADE_ALL_STRUCT_VAR`
`static int`	`SLPCASCADE_AUTOAPPLY`
`static int`	`SLPCASCADE_COEF_VAR`
`static int`	`SLPCASCADE_DRCOL_PREVOUSVALUE`
`static int`	`SLPCASCADE_DRCOL_PVRANGE`
`static int`	`SLPCASCADE_SECONDARY_GROUPS`
`static int`	`SLPCASCADE_STRUCT_VAR`
`static int`	`SLPCASCADECONTRACTION`
`static int`	`SLPCASCADEDBOUNDS`
`static int`	`SLPCASCADENLIMIT`	Maximum number of iterations for cascading with non-linear determining rows
`static int`	`SLPCASCADETOL_PA`	Absolute cascading print tolerance
`static int`	`SLPCASCADETOL_PR`	Relative cascading print tolerance
`static int`	`SLPCDTOL_A`	Absolute tolerance for deducing constant derivatives
`static int`	`SLPCDTOL_R`	Relative tolerance for deducing constant derivatives
`static int`	`SLPCLAMPEXTENDEDACTIVESB`
`static int`	`SLPCLAMPEXTENDEDALL`
`static int`	`SLPCLAMPSHRINK`	Shrink ratio used to impose strict convergence on variables converged in extended criteria only
`static int`	`SLPCLAMPVALIDATIONTOL_A`	Absolute validation tolerance for applying `SLPCLAMPSHRINK`
`static int`	`SLPCLAMPVALIDATIONTOL_R`	Relative validation tolerance for applying `SLPCLAMPSHRINK`
`static int`	`SLPCOEFFICIENTS`	Number of nonlinear coefficients
`static int`	`SLPCOLINFO_CONVERGENCESTATUS`
`static int`	`SLPCOLINFO_DELTA`
`static int`	`SLPCOLINFO_DELTADJ`
`static int`	`SLPCOLINFO_DELTAINDEX`
`static int`	`SLPCOLINFO_DETROW`
`static int`	`SLPCOLINFO_LPVALUE`
`static int`	`SLPCOLINFO_RDJ`
`static int`	`SLPCOLINFO_SB`
`static int`	`SLPCOLINFO_SBDUAL`
`static int`	`SLPCOLINFO_UPDATEROW`
`static int`	`SLPCOLINFO_VALUE`
`static int`	`SLPCONVERGEBIT_ATOL`
`static int`	`SLPCONVERGEBIT_CTOL`
`static int`	`SLPCONVERGEBIT_EXTENDEDSCALING`
`static int`	`SLPCONVERGEBIT_ITOL`
`static int`	`SLPCONVERGEBIT_MTOL`
`static int`	`SLPCONVERGEBIT_NOQUADCHECK`
`static int`	`SLPCONVERGEBIT_OTOL`
`static int`	`SLPCONVERGEBIT_REQUIRE_OTOL_R`
`static int`	`SLPCONVERGEBIT_STOL`
`static int`	`SLPCONVERGEBIT_USER`
`static int`	`SLPCONVERGEBIT_VALIDATION`
`static int`	`SLPCONVERGEBIT_VALIDATION_K`
`static int`	`SLPCONVERGEBIT_VTOL`
`static int`	`SLPCONVERGEBIT_WTOL`
`static int`	`SLPCONVERGEBIT_XTOL`
`static int`	`SLPCONVERGENCEOPS`	Bit map describing which convergence tests should be carried out
`static int`	`SLPCTOL`	Closure convergence tolerance
`static int`	`SLPCURRENTDELTACOST`	Current value of penalty cost multiplier for penalty delta vectors
`static int`	`SLPCURRENTERRORCOST`	Current value of penalty cost multiplier for penalty error vectors
`static int`	`SLPCUTSTRATEGY`	Determines which cuts to apply in the MISLP search when the default SLP-in-MIP strategy is used.
`static int`	`SLPDAMP`	Damping factor for updating values of variables
`static int`	`SLPDAMPEXPAND`	Multiplier to increase damping factor during dynamic damping
`static int`	`SLPDAMPMAX`	Maximum value for the damping factor of a variable during dynamic damping
`static int`	`SLPDAMPMIN`	Minimum value for the damping factor of a variable during dynamic damping
`static int`	`SLPDAMPSHRINK`	Multiplier to decrease damping factor during dynamic damping
`static int`	`SLPDAMPSTART`	SLP iteration at which damping is activated
`static int`	`SLPDEFAULTSTEPBOUND`	Minimum initial value for the step bound of an SLP variable if none is explicitly given
`static int`	`SLPDELAYUPDATEROWS`	Number of SLP iterations before update rows are fully activated
`static int`	`SLPDELTA_A`	Absolute perturbation of values for calculating numerical derivatives
`static int`	`SLPDELTA_CONT`
`static int`	`SLPDELTA_EXPLORE`
`static int`	`SLPDELTA_INFINITY`	Maximum value for partial derivatives
`static int`	`SLPDELTA_INTEGER`
`static int`	`SLPDELTA_R`	Relative perturbation of values for calculating numerical derivatives
`static int`	`SLPDELTA_SEMICONT`
`static int`	`SLPDELTA_X`	Minimum absolute value of delta coefficients to be retained
`static int`	`SLPDELTA_Z`	Tolerance used when calculating derivatives
`static int`	`SLPDELTA_ZERO`	Absolute zero acceptance tolerance used when calculating derivatives
`static int`	`SLPDELTACOST`	Initial penalty cost multiplier for penalty delta vectors
`static int`	`SLPDELTACOSTFACTOR`	Factor for increasing cost multiplier on total penalty delta vectors
`static int`	`SLPDELTAMAXCOST`	Maximum penalty cost multiplier for penalty delta vectors
`static int`	`SLPDELTAOFFSET`	Position of first character of SLP variable name used to create name of delta vector
`static int`	`SLPDELTAS`	Number of delta vectors created during augmentation
`static int`	`SLPDELTAZLIMIT`	Number of SLP iterations during which to apply XPRS_SLPDELTA_Z
`static int`	`SLPDJTOL`	Tolerance on DJ value for determining if a variable is at its step bound
`static int`	`SLPDRCOLDJTOL`	Reduced cost tolerance on the delta variable when fixing due to the determining column being below `SLPDRCOLTOL`.
`static int`	`SLPDRCOLTOL`	The minimum absolute magnitude of a determining column, for which the determined variable is still regarded as well defined
`static int`	`SLPDRFIXRANGE`	The range around the previous value where variables are fixed in cascading if the determining column is below `SLPDRCOLTOL`.
`static int`	`SLPDYNAMICDAMPING`
`static int`	`SLPECFCHECK`	Check feasibility at the point of linearization for extended convergence criteria
`static int`	`SLPECFCOUNT`	Number of infeasible constraints found at the point of linearization
`static int`	`SLPECFTOL_A`	Absolute tolerance on testing feasibility at the point of linearization
`static int`	`SLPECFTOL_R`	Relative tolerance on testing feasibility at the point of linearization
`static int`	`SLPELIMINATEDCOL`
`static int`	`SLPENFORCECOSTSHRINK`	Factor by which to decrease the current penalty multiplier when enforcing rows.
`static int`	`SLPENFORCEMAXCOST`	Maximum penalty cost in the objective before enforcing most violating rows
`static int`	`SLPEQUALITYERRORVECTORS`
`static int`	`SLPERRORCOST`	Initial penalty cost multiplier for penalty error vectors
`static int`	`SLPERRORCOSTFACTOR`	Factor for increasing cost multiplier on total penalty error vectors
`static int`	`SLPERRORCOSTS`	Total penalty costs in the solution
`static int`	`SLPERRORMAXCOST`	Maximum penalty cost multiplier for penalty error vectors
`static int`	`SLPERROROFFSET`	Position of first character of constraint name used to create name of penalty error vectors
`static int`	`SLPERRORTOL_A`	Absolute tolerance for error vectors
`static int`	`SLPERRORTOL_P`	Absolute tolerance for printing error vectors
`static int`	`SLPESCALATEPENALTIES`
`static int`	`SLPESCALATION`	Factor for increasing cost multiplier on individual penalty error vectors
`static int`	`SLPESTIMATESTEPBOUNDS`
`static int`	`SLPETOL_A`	Absolute tolerance on penalty vectors
`static int`	`SLPETOL_R`	Relative tolerance on penalty vectors
`static int`	`SLPEVENHANDEDAUGMENTATION`
`static int`	`SLPEVTOL_A`	Absolute tolerance on total penalty costs
`static int`	`SLPEVTOL_R`	Relative tolerance on total penalty costs
`static int`	`SLPEXPAND`	Multiplier to increase a step bound
`static int`	`SLPFEASTOLTARGET`	When set, this defines a target feasibility tolerance to which the linearizations are solved to
`static int`	`SLPFILTER`	Bit map for controlling solution updates
`static int`	`SLPFILTER_CASCADE`
`static int`	`SLPFILTER_KEEPBEST`	Deprecated. since 48.00
`static int`	`SLPFILTER_ZEROLINESEARCH`
`static int`	`SLPFILTER_ZEROLINESEARCHTR`
`static int`	`SLPFIXEDVAR`
`static int`	`SLPGRANULARITY`	Base for calculating penalty costs
`static int`	`SLPGRIDANNEALING`
`static int`	`SLPGRIDCYCLIC`
`static int`	`SLPGRIDENUMERATE`
`static int`	`SLPGRIDHEURSELECT`	Bit map selecting which heuristics to run if the problem has a variable with an integer delta
`static int`	`SLPHASCALCIV`
`static int`	`SLPHASCONVERGED`
`static int`	`SLPHASDELTA`
`static int`	`SLPHASERROR`
`static int`	`SLPHASIV`
`static int`	`SLPHASMINUSERROR`
`static int`	`SLPHASNOCOEFS`
`static int`	`SLPHASNONZEROCOEF`
`static int`	`SLPHASPLUSERROR`
`static int`	`SLPHASSLPELEMENT`
`static int`	`SLPHASZEROBOUND`
`static int`	`SLPHEURSTRATEGY`	Branch and Bound: This specifies the MINLP heuristic strategy.
`static int`	`SLPHOLDVALUES`
`static int`	`SLPINFEASLIMIT`	The maximum number of consecutive infeasible or unbounded SLP iterations which can occur before Xpress-SLP terminates
`static int`	`SLPISDELTA`
`static int`	`SLPISDETERMININGROW`
`static int`	`SLPISEQUALSCOLUMN`
`static int`	`SLPISERRORVECTOR`
`static int`	`SLPISINCOEFS`
`static int`	`SLPISINGLOBAL`
`static int`	`SLPISINTEGER`
`static int`	`SLPISMINUSERRORVECTOR`
`static int`	`SLPISMINUSPENALTYDELTA`
`static int`	`SLPISMISCROW`
`static int`	`SLPISMISCVECTOR`
`static int`	`SLPISPENALTYDELTA`
`static int`	`SLPISPENALTYROW`
`static int`	`SLPISPLUSERRORVECTOR`
`static int`	`SLPISPLUSPENALTYDELTA`
`static int`	`SLPISSBROW`
`static int`	`SLPISSTRUCTURALCOLUMN`
`static int`	`SLPISUPDATEROW`
`static int`	`SLPITER`	SLP iteration count
`static int`	`SLPITERLIMIT`	The maximum number of SLP iterations
`static int`	`SLPITOL_A`	Absolute impact convergence tolerance
`static int`	`SLPITOL_R`	Relative impact convergence tolerance
`static int`	`SLPLOG`	Frequency with which SLP status is printed
`static int`	`SLPLSITERLIMIT`	Number of iterations in the line search
`static int`	`SLPLSPATTERNLIMIT`	Number of iterations in the pattern search preceding the line search
`static int`	`SLPLSSTART`	Iteration in which to active the line search
`static int`	`SLPLSZEROLIMIT`	Maximum number of zero length line search steps before line search is deactivated
`static int`	`SLPMATRIXTOL`	Nonzero tolerance for dropping coefficients from the linearization.
`static int`	`SLPMAXCOSTOPTION`
`static int`	`SLPMAXWEIGHT`	Maximum penalty weight for delta or error vectors
`static int`	`SLPMINIMUMAUGMENTATION`
`static int`	`SLPMINSBFACTOR`	Factor by which step bounds can be decreased beneath `SLPATOL_A`
`static int`	`SLPMINUSPENALTYERRORS`	Number of negative penalty error vectors
`static int`	`SLPMINWEIGHT`	Minimum penalty weight for delta or error vectors
`static int`	`SLPMIPALGORITHM`	Bitmap describing the MISLP algorithms to be used
`static int`	`SLPMIPCUTOFF_A`	Absolute objective function cutoff for MIP termination
`static int`	`SLPMIPCUTOFF_R`	Relative objective function cutoff for MIP termination
`static int`	`SLPMIPCUTOFFCOUNT`	Number of SLP iterations to check when considering a node for cutting off
`static int`	`SLPMIPCUTOFFLIMIT`	Number of SLP iterations to check when considering a node for cutting off
`static int`	`SLPMIPDEFAULTALGORITHM`	Default algorithm to be used during the tree search in MISLP
`static int`	`SLPMIPERRORTOL_A`	Absolute penalty error cost tolerance for MIP cut-off
`static int`	`SLPMIPERRORTOL_R`	Relative penalty error cost tolerance for MIP cut-off
`static int`	`SLPMIPFINALFIXSLP`
`static int`	`SLPMIPFINALRELAXSLP`
`static int`	`SLPMIPFIXSTEPBOUNDS`	Bitmap describing the step-bound fixing strategy during MISLP
`static int`	`SLPMIPINITIALFIXSLP`
`static int`	`SLPMIPINITIALRELAXSLP`
`static int`	`SLPMIPINITIALSLP`
`static int`	`SLPMIPITER`	Total number of SLP iterations in MISLP
`static int`	`SLPMIPITERLIMIT`	Maximum number of SLP iterations at each node
`static int`	`SLPMIPLOG`	Frequency with which MIP status is printed
`static int`	`SLPMIPNODEFIXSLP`
`static int`	`SLPMIPNODELIMITSLP`
`static int`	`SLPMIPNODERELAXSLP`
`static int`	`SLPMIPNODES`	Number of nodes explored in SLP-in-MIP.
`static int`	`SLPMIPOCOUNT`	Number of SLP iterations at each node over which to measure objective function variation
`static int`	`SLPMIPOTOL_A`	Absolute objective function tolerance for MIP termination
`static int`	`SLPMIPOTOL_R`	Relative objective function tolerance for MIP termination
`static int`	`SLPMIPRELAXSTEPBOUNDS`	Bitmap describing the step-bound relaxation strategy during MISLP
`static int`	`SLPMIPSOLS`	Number of integer solutions found in MISLP.
`static int`	`SLPMIPWITHINSLP`	Deprecated. since 48.00
`static int`	`SLPMISLPALGORITHM`	Selects the MISLP strategy used to combine SLP with the branch-and-bound search
`static int`	`SLPMISLPALGORITHM_AUTOMATIC`
`static int`	`SLPMISLPALGORITHM_MIPINSLP`
`static int`	`SLPMISLPALGORITHM_SLPINMIP`
`static int`	`SLPMISLPALGORITHM_SLPMIPSLP`
`static int`	`SLPMTOL_A`	Absolute effective matrix element convergence tolerance
`static int`	`SLPMTOL_R`	Relative effective matrix element convergence tolerance
`static int`	`SLPMVTOL`	Marginal value tolerance for determining if a constraint is slack
`static int`	`SLPNOERRORVECTORS`
`static int`	`SLPNOFORMULADOMAINIV`	Deprecated. since 44.00
`static int`	`SLPNOLPPOLISHING`
`static int`	`SLPNONCONSTANTCOEFFS`	Number of coefficients in the augmented problem that might change between SLP iterations
`static int`	`SLPNONZEROBOUND`
`static int`	`SLPNOPRESOLVECOEFFICIENTS`
`static int`	`SLPNOPRESOLVEDELTAS`
`static int`	`SLPNOSTEPBOUNDS`	Deprecated. since 48.00
`static int`	`SLPNOUPDATEIFONLYIV`
`static int`	`SLPNOUSEFULDELTA`
`static int`	`SLPOBJTHRESHOLD`	Assumed maximum value of the objective function in absolute value.
`static int`	`SLPOBJTOPENALTYCOST`	Factor to estimate initial penalty costs from objective function
`static int`	`SLPOCOUNT`	Number of SLP iterations over which to measure objective function variation for static objective (2) convergence criterion
`static int`	`SLPOPTIMALITYTOLTARGET`	When set, this defines a target optimality tolerance to which the linearizations are solved to
`static int`	`SLPOTOL_A`	Absolute static objective (2) convergence tolerance
`static int`	`SLPOTOL_R`	Relative static objective (2) convergence tolerance
`static int`	`SLPPENALTYDELTACOLUMN`	Index of column costing the penalty delta row
`static int`	`SLPPENALTYDELTAROW`	Index of equality row holding the penalties for delta vectors
`static int`	`SLPPENALTYDELTAS`	Number of penalty delta vectors
`static int`	`SLPPENALTYDELTATOTAL`	Total activity of penalty delta vectors
`static int`	`SLPPENALTYDELTAVALUE`	Total penalty cost attributed to penalty delta vectors
`static int`	`SLPPENALTYDELTAVECTORS`
`static int`	`SLPPENALTYERRORCOLUMN`	Index of column costing the penalty error row
`static int`	`SLPPENALTYERRORROW`	Index of equality row holding the penalties for penalty error vectors
`static int`	`SLPPENALTYERRORS`	Number of penalty error vectors
`static int`	`SLPPENALTYERRORTOTAL`	Total activity of penalty error vectors
`static int`	`SLPPENALTYERRORVALUE`	Total penalty cost attributed to penalty error vectors
`static int`	`SLPPENALTYINFOSTART`	Iteration from which to record row penalty information
`static int`	`SLPPLUSPENALTYERRORS`	Number of positive penalty error vectors
`static int`	`SLPQUICKCONVERGENCECHECK`
`static int`	`SLPREDUNDANTROW`
`static int`	`SLPRESETDELTAZ`
`static int`	`SLPRESIDUALERRORS`
`static int`	`SLPRETAINPREVIOUSVALUE`
`static int`	`SLPRETURNSOLUTION`	Selects whether `XPRSgetsolution` returns the final converged iterate or the best merit-function iterate
`static int`	`SLPRETURNSOLUTION_AUTOMATIC`
`static int`	`SLPRETURNSOLUTION_BEST`
`static int`	`SLPRETURNSOLUTION_FINALITERATE`
`static int`	`SLPROOTMIPDRIVEN`
`static int`	`SLPROWINFO_CURRENTPENALTYERROR`
`static int`	`SLPROWINFO_CURRENTPENALTYFACTOR`
`static int`	`SLPROWINFO_DUAL`
`static int`	`SLPROWINFO_MAXPENALTYERROR`
`static int`	`SLPROWINFO_NUMPENALTYERRORS`
`static int`	`SLPROWINFO_PENALTYCOLUMNMINUS`
`static int`	`SLPROWINFO_PENALTYCOLUMNMINUSDJ`
`static int`	`SLPROWINFO_PENALTYCOLUMNMINUSVALUE`
`static int`	`SLPROWINFO_PENALTYCOLUMNPLUS`
`static int`	`SLPROWINFO_PENALTYCOLUMNPLUSDJ`
`static int`	`SLPROWINFO_PENALTYCOLUMNPLUSVALUE`
`static int`	`SLPROWINFO_SLACK`
`static int`	`SLPROWINFO_TOTALPENALTYERROR`
`static int`	`SLPSAMECOUNT`	Number of steps reaching the step bound in the same direction before step bounds are increased
`static int`	`SLPSAMEDAMP`	Number of steps in same direction before damping factor is increased
`static int`	`SLPSBFROMABSVALUES`
`static int`	`SLPSBFROMVALUES`
`static int`	`SLPSBROWOFFSET`	Position of first character of SLP variable name used to create name of SLP lower and upper step bound rows
`static int`	`SLPSBSTART`	SLP iteration after which step bounds are first applied
`static int`	`SLPSBXCONVERGED`	Number of step-bounded variables converged only on extended criteria
`static int`	`SLPSCALE`	When to re-scale the SLP problem
`static int`	`SLPSCALECOUNT`	Iteration limit used in determining when to re-scale the SLP matrix
`static int`	`SLPSHRINK`	Multiplier to reduce a step bound
`static int`	`SLPSHRINKBIAS`	Defines an overwrite / adjustment of step bounds for improving iterations
`static int`	`SLPSKIPIVLPHEURISTICS`
`static int`	`SLPSLPTHENMIP`	Deprecated. since 48.00
`static int`	`SLPSTATUS`	Bitmap holding the problem convergence status
`static int`	`SLPSTATUS_ADAPTIVEITERS`
`static int`	`SLPSTATUS_CLAMPING`
`static int`	`SLPSTATUS_CONSECUTIVE_INFEAS`
`static int`	`SLPSTATUS_CONVERGEDOBJOBJ`
`static int`	`SLPSTATUS_CONVERGEDOBJSBX`
`static int`	`SLPSTATUS_CONVERGEDOBJUCC`
`static int`	`SLPSTATUS_ENFORCED`
`static int`	`SLPSTATUS_ERROTOL`
`static int`	`SLPSTATUS_EVTOL`
`static int`	`SLPSTATUS_INTEGERINFEASIBLE`
`static int`	`SLPSTATUS_KEEPBEST`
`static int`	`SLPSTATUS_LPINFEASIBLE`
`static int`	`SLPSTATUS_LPUNFINISHED`
`static int`	`SLPSTATUS_MAXSLPITERATIONS`
`static int`	`SLPSTATUS_MAXTIME`
`static int`	`SLPSTATUS_NOVARSINACTIVE`
`static int`	`SLPSTATUS_OBJQNONCONVEX`
`static int`	`SLPSTATUS_OTOL`
`static int`	`SLPSTATUS_POLISH_FAILURE`
`static int`	`SLPSTATUS_POLISHED`
`static int`	`SLPSTATUS_RESIDUALPENALTIES`
`static int`	`SLPSTATUS_USER`
`static int`	`SLPSTATUS_VARSLINKEDINACTIVE`
`static int`	`SLPSTATUS_VTOL`
`static int`	`SLPSTATUS_WTOL`
`static int`	`SLPSTATUS_XTOL`
`static int`	`SLPSTEPBOUNDING`	Selects the step bounding strategy used by SLP
`static int`	`SLPSTEPBOUNDING_ALWAYS`
`static int`	`SLPSTEPBOUNDING_ASREQUIRED`
`static int`	`SLPSTEPBOUNDING_NEVER`
`static int`	`SLPSTEPBOUNDROWS`
`static int`	`SLPSTEPBOUNDSASREQUIRED`	Deprecated. since 48.00
`static int`	`SLPSTOL_A`	Absolute slack convergence tolerance
`static int`	`SLPSTOL_R`	Relative slack convergence tolerance
`static int`	`SLPSWITCHTOPRIMAL`
`static int`	`SLPTOLSET_DELETE`
`static int`	`SLPTOLSET_RA`
`static int`	`SLPTOLSET_RI`
`static int`	`SLPTOLSET_RM`
`static int`	`SLPTOLSET_RS`
`static int`	`SLPTOLSET_TA`
`static int`	`SLPTOLSET_TC`
`static int`	`SLPTOLSET_TI`
`static int`	`SLPTOLSET_TM`
`static int`	`SLPTOLSET_TS`
`static int`	`SLPTOLSETBIT_RA`
`static int`	`SLPTOLSETBIT_RI`
`static int`	`SLPTOLSETBIT_RM`
`static int`	`SLPTOLSETBIT_RS`
`static int`	`SLPTOLSETBIT_TA`
`static int`	`SLPTOLSETBIT_TC`
`static int`	`SLPTOLSETBIT_TI`
`static int`	`SLPTOLSETBIT_TM`
`static int`	`SLPTOLSETBIT_TS`
`static int`	`SLPTOLSETS`	Number of tolerance sets.
`static int`	`SLPTRACEMASK_CASCADE`
`static int`	`SLPTRACEMASK_COLS`
`static int`	`SLPTRACEMASK_CONVERGE`
`static int`	`SLPTRACEMASK_DUAL`
`static int`	`SLPTRACEMASK_GENERALFIT`
`static int`	`SLPTRACEMASK_LINESEARCH`
`static int`	`SLPTRACEMASK_REDUCEDCOST`
`static int`	`SLPTRACEMASK_ROWS`
`static int`	`SLPTRACEMASK_SLACK`
`static int`	`SLPTRACEMASK_SLPVALUE`
`static int`	`SLPTRACEMASK_SOLUTION`
`static int`	`SLPTRACEMASK_STEPBOUND`
`static int`	`SLPTRACEMASK_TYPE`
`static int`	`SLPTRACEMASK_WEIGHT`
`static int`	`SLPTRACEMASKOPS`	Controls the information printed for `SLPTRACEMASK`.
`static int`	`SLPTRANSFERROW`
`static int`	`SLPUCCONSTRAINEDCOUNT`	Number of unconverged variables with coefficients in constraining rows
`static int`	`SLPUNCONVERGED`	Number of unconverged values
`static int`	`SLPUNCONVERGEDROW`
`static int`	`SLPUNFINISHEDLIMIT`	The number of consecutive SLP iterations that may have an unfinished status before the solve is terminated.
`static int`	`SLPUPDATEOFFSET`	Position of first character of SLP variable name used to create name of SLP update row
`static int`	`SLPUSEFULDELTA`
`static int`	`SLPVCOUNT`	Number of SLP iterations over which to measure static objective (3) convergence
`static int`	`SLPVLIMIT`	Number of SLP iterations after which static objective (3) convergence testing starts
`static int`	`SLPVTOL_A`	Absolute static objective (3) convergence tolerance
`static int`	`SLPVTOL_R`	Relative static objective (3) convergence tolerance
`static int`	`SLPWCOUNT`	Number of SLP iterations over which to measure the objective for the extended convergence continuation criterion
`static int`	`SLPWTOL_A`	Absolute extended convergence continuation tolerance
`static int`	`SLPWTOL_R`	Relative extended convergence continuation tolerance
`static int`	`SLPXCOUNT`	Number of SLP iterations over which to measure static objective (1) convergence
`static int`	`SLPXLIMIT`	Number of SLP iterations up to which static objective (1) convergence testing is performed
`static int`	`SLPXTOL_A`	Absolute static objective function (1) tolerance
`static int`	`SLPXTOL_R`	Relative static objective function (1) tolerance
`static int`	`SLPZEROCRITERION`	Bitmap determining the behavior of the placeholder deletion procedure
`static int`	`SLPZEROCRITERION_DELTANBDRROW`
`static int`	`SLPZEROCRITERION_DELTANBUPSATEROW`
`static int`	`SLPZEROCRITERION_NBDELTA`
`static int`	`SLPZEROCRITERION_NBSLPVAR`
`static int`	`SLPZEROCRITERION_PRINT`
`static int`	`SLPZEROCRITERION_SLPVARNBUPDATEROW`
`static int`	`SLPZEROCRITERIONCOUNT`	Number of consecutive times a placeholder entry is zero before being considered for deletion
`static int`	`SLPZEROCRITERIONSTART`	SLP iteration at which criteria for deletion of placeholder entries are first activated.
`static int`	`SLPZEROESRESET`	Number of placeholder entries set to zero
`static int`	`SLPZEROESRETAINED`	Number of potentially zero placeholders left untouched
`static int`	`SLPZEROESTOTAL`	Number of potential zero placeholder entries
`static int`	`SOLAVAILABLE_FEASIBLE`	Constant used in enumeration 'SOLAVAILABLE'
`static int`	`SOLAVAILABLE_NOTFOUND`	Constant used in enumeration 'SOLAVAILABLE'
`static int`	`SOLAVAILABLE_OPTIMAL`	Constant used in enumeration 'SOLAVAILABLE'
`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`	`SOLSTATUS`	Status of the solution of the last problem solved with XPRSoptimize.
`static int`	`SOLSTATUS_FEASIBLE`	Constant used in enumeration 'SOLSTATUS'
`static int`	`SOLSTATUS_INFEASIBLE`	Constant used in enumeration 'SOLSTATUS'
`static int`	`SOLSTATUS_NOTFOUND`	Constant used in enumeration 'SOLSTATUS'
`static int`	`SOLSTATUS_OPTIMAL`	Constant used in enumeration 'SOLSTATUS'
`static int`	`SOLSTATUS_UNBOUNDED`	Constant used in enumeration 'SOLSTATUS'
`static int`	`SOLTIMELIMIT`	The maximum time in seconds that the Optimizer will run a MIP solve before it terminates, given that a solution has been found.
`static int`	`SOLVEDOBJS`	Number of objectives that have been solved so far during a multi-objective solve.
`static int`	`SOLVESTATUS`	Status of the solve of the last problem solved with XPRSoptimize.
`static int`	`SOLVESTATUS_COMPLETED`	Constant used in enumeration 'SOLVESTATUS'
`static int`	`SOLVESTATUS_FAILED`	Constant used in enumeration 'SOLVESTATUS'
`static int`	`SOLVESTATUS_STOPPED`	Constant used in enumeration 'SOLVESTATUS'
`static int`	`SOLVESTATUS_UNSTARTED`	Constant used in enumeration 'SOLVESTATUS'
`static int`	`SOSREFTOL`	Specifies 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 MIP 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_GENERICERROR`	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_MIPSTAGE`	Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_NEXTOBJECTIVE`	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_NUMERICALERROR`	Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_SOLLIMIT`	Constant used in enumeration 'enum_stop_type'
`static int`	`STOP_SOLVECOMPLETE`	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`	`STOP_WORKLIMIT`	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`	Deprecated. since 47.00
`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`	`TIMELIMIT`	The maximum time in seconds that the Optimizer will run before it terminates, including the problem setup time and solution time.
`static int`	`TOK_COL`
`static int`	`TOK_CON`
`static int`	`TOK_DEL`
`static int`	`TOK_EOF`
`static int`	`TOK_FUN`
`static int`	`TOK_IFUN`
`static int`	`TOK_LB`
`static int`	`TOK_OP`
`static int`	`TOK_RB`
`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 tree file, the Optimizer can try to use data-compression techniques to reduce the size of the tree file on disk.
`static int`	`TREECOVERCUTS`	Deprecated. since 48.01
`static int`	`TREECUTSELECT`	Deprecated. since 48.01
`static int`	`TREEDIAGNOSTICS`	A bit-vector (see Section ) providing control over how various tree-management-related messages get printed in the tree log file during the branch-and-bound search.
`static int`	`TREEDIAGNOSTICS_MEMORY_SAVED_REPORTS`	Constant used in enumeration 'TREEDIAGNOSTICS'
`static int`	`TREEDIAGNOSTICS_MEMORY_SAVING_LOG`	Constant used in enumeration 'TREEDIAGNOSTICS'
`static int`	`TREEDIAGNOSTICS_MEMORY_USAGE_SUMMARIES`	Constant used in enumeration 'TREEDIAGNOSTICS'
`static int`	`TREEFILELOGINTERVAL`	This control sets the interval between progress messages output while writing tree data to the tree file, in seconds.
`static int`	`TREEFILESIZE`	The allocated size of the tree file, in megabytes.
`static int`	`TREEFILEUSAGE`	The number of megabytes of data from the branch-and-bound tree that have been saved to the tree file.
`static int`	`TREEGOMCUTS`	Deprecated. since 48.01
`static int`	`TREEMEMORYLIMIT`	A soft limit, in MB (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 tree 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`	Deprecated. since 48.01
`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_GLOBALQUICK`	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_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_PRIMALINTEGRAL`	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`	`TUNERTARGET_WORK`	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`	`USERFUNCTION_MAP`
`static int`	`USERFUNCTION_MAPDELTA`
`static int`	`USERFUNCTION_MULTIMAP`
`static int`	`USERFUNCTION_MULTIMAPDELTA`
`static int`	`USERFUNCTION_VECMAP`
`static int`	`USERFUNCTION_VECMAPDELTA`
`static int`	`USERSOLHEURISTIC`	Determines how much effort to put into running a large neighborhood search heuristic to find a feasible integer solution from a partial or infeasible user solution.
`static int`	`USERSOLSTATUS_ACCEPTED_FEASIBLE`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_ACCEPTED_OPTIMIZED`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_DROPPED`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_NOT_CHECKED`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_REJECTED_CUTOFF`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_REJECTED_FAILED_OPTIMIZE`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_REJECTED_INFEAS_NOSEARCH`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_REJECTED_PARTIAL_NOSEARCH`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_SEARCHED_NOSOL`	Constant used in enumeration 'USERSOLSTATUS'
`static int`	`USERSOLSTATUS_SEARCHED_SOL`	Constant used in enumeration 'USERSOLSTATUS'
`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_PRODUCT_UPDOWN_PSEUDO_COST`	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`	`VARSELECTION_WEIGHTED_COMBINATION_UPDOWN_PSEUDO_COST`	Constant used in enumeration 'VARSELECTION'
`static int`	`Version`
`static int`	`VERSION`	Deprecated. since 48.01
`static int`	`VersionBuild`
`static int`	`VersionFull`
`static int`	`VersionMajor`
`static int`	`VersionMinor`
`static int`	`WORK`	Amount of deterministic algorithmic "work" spent since the invocation of the search process.
`static int`	`WORKLIMIT`	The maximum work (measured in work units) that the Optimizer will run before it terminates.
`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`	Optimizer version.
`static int`	`XPVERSION_BUILD`	Optimizer version (build number).
`static int`	`XPVERSION_FULL`	Optimizer version (major, minor, build number).
`static int`	`XPVERSION_MAJOR`	Optimizer version (major number).
`static int`	`XPVERSION_MINOR`	Optimizer version (minor number).

- Field Detail
  - PLUSINFINITY
```
static final double PLUSINFINITY
```
    Positive infinity. Any value larger than this is considered infinite by Xpress.
    
    See Also:
    
    Constant Field Values
  - MINUSINFINITY
```
static final double MINUSINFINITY
```
    Negative infinity. Any value smaller than this is considered infinite by Xpress.
    
    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
  - MAXBANNERLENGTH
```
static final int MAXBANNERLENGTH
```
    Maximum length of banner message.
    
    See Also:
    
    Constant Field Values
  - XPVERSION
```
static final int XPVERSION
```
    Optimizer version.
    
    See Also:
    
    Constant Field Values
  - XPVERSION_MAJOR
```
static final int XPVERSION_MAJOR
```
    Optimizer version (major number).
    
    See Also:
    
    Constant Field Values
  - XPVERSION_MINOR
```
static final int XPVERSION_MINOR
```
    Optimizer version (minor number).
    
    See Also:
    
    Constant Field Values
  - XPVERSION_BUILD
```
static final int XPVERSION_BUILD
```
    Optimizer version (build number).
    
    See Also:
    
    Constant Field Values
  - XPVERSION_FULL
```
static final int XPVERSION_FULL
```
    Optimizer version (major, minor, build number).
    
    See Also:
    
    Constant Field Values
  - MAXMESSAGELENGTH
```
static final int MAXMESSAGELENGTH
```
    Maximum length of messages.
    
    See Also:
    
    Constant Field Values
  - DEFAULT_BRANCHING_PRIORITY
```
static final int DEFAULT_BRANCHING_PRIORITY
```
    Default branching priority for variables.
    
    See Also:
    
    Constant Field Values
  - JAVAXPRS_VERSION
```
static final java.lang.String JAVAXPRS_VERSION
```
    See Also:
    
    Constant Field Values
  - EXTRAROWS
```
static final int EXTRAROWS
```
    Specifies 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
```
    Specifies 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
```
    Specifies 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
```
    Simplex: Specifies 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.
    Examples using controls().setLPIterLimit:
    
    Tableau.java
    See Also:
    
    Constant Field Values
  - LPLOG
```
static final int LPLOG
```
    Simplex: The frequency at which the simplex log is printed.
    Examples using controls().setLPLog:
    
    ELSCut.java
    See Also:
    
    Constant Field Values
  - SCALING
```
@Deprecated
static final int SCALING
```
    Deprecated.
    since 48.00
    
    This bit-vector control (see Section ) 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'
    Examples using controls().setPresolve:
    
    ELS.java
    
    ELSCut.java
    
    FixBV.java
    
    FolioHeuristic.java
    
    Knapsack.java
    
    Tableau.java
    
    Trimloss.java
    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
```
    Specifies the minimum number of Simplex 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: Specifies the maximum number of nodes that will be explored.
    Examples using controls().setMaxNode:
    
    AddMipSol.java
    See Also:
    
    Constant Field Values
  - MAXTIME
```
@Deprecated
static final int MAXTIME
```
    Deprecated.
    since 41.00
    
    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 nodes.
    
    See Also:
    
    Constant Field Values
  - MAXMIPSOL
```
static final int MAXMIPSOL
```
    Branch and Bound: Specifies a limit on the number of integer solutions to be found by the Optimizer. The solve terminates once this limit is reached. 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 solution values.
    Examples using controls().setMaxMIPSol:
    
    AddMipSol.java
    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 LPs, standalone or during MIP optimization. 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
```
    MIP log print control.
    Examples using controls().setMIPLog:
    
    AddMipSol.java
    
    CuttingStock.java
    
    ELSCut.java
    
    Knapsack.java
    
    MostViolated.java
    
    RecursiveFinancialPlanning.java
    
    RoundInt.java
    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
```
    Specifies the 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'
    Examples using controls().setOutputLog:
    
    CuttingStock.java
    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 the last barrier iteration.
    
    See Also:
    
    Constant Field Values
  - CROSSOVER
```
static final int CROSSOVER
```
    Newton barrier and hybrid gradient: 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: Specifies 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; bit-vector-control (see Section ). Values are from enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - BAROUTPUT
```
static final int BAROUTPUT
```
    Newton barrier and hybrid gradient: 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
  - EXTRAMIPENTS
```
static final int EXTRAMIPENTS
```
    Specifies the initial number of extra MIP 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
```
    Determines the number of threads implemented to run the Newton-barrier and hybrid gradient algorithms.
    
    See Also:
    
    Constant Field Values
  - KEEPBASIS
```
static final int KEEPBASIS
```
    Simplex: This determines whether the basis should be kept when reoptimizing a problem. The choice is between using a crash basis created at the beginning of simplex or using a basis from a previous solve (if such exists). By default, this control gets (re)set automatically in various situations. By default, it will be automatically set to 1 after a solve that produced a valid basis. This will automatically warmstart a subsequent solve. Explicitly loading a starting basis will also set this control to 1. If the control is explicitly set to 0, any existing basis will be ignored for a new solve, and the Optimizer will start from an ad-hoc crash basis.
    
    See Also:
    
    Constant Field Values
  - CROSSOVEROPS
```
static final int CROSSOVEROPS
```
    Newton barrier and hybrid gradient: a bit-vector (see Section ) for adjusting the behavior of the crossover procedure. Values are from enumeration 'CROSSOVEROPS'
    
    See Also:
    
    Constant Field Values
  - VERSION
```
@Deprecated
static final int VERSION
```
    Deprecated.
    since 48.01
    
    The Optimizer version number, e.g., 4601 meaning release 46.01.
    
    See Also:
    
    Constant Field Values
  - CROSSOVERTHREADS
```
static final int CROSSOVERTHREADS
```
    Determines the maximum number of threads that parallel crossover is allowed to use.
    
    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
  - ELIMFILLIN
```
static final int ELIMFILLIN
```
    Specifies the 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 (see Section ) 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 at nodes. If set to 0, no processing will be performed. This is a bit-vector control (see Section ). 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.
    Examples using controls().getMIPThreads/controls().setMIPThreads:
    
    AddMipSol.java
    
    MostViolated.java
    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
```
    Specifies 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
  - CALLBACKFROMMAINTHREAD
```
static final int CALLBACKFROMMAINTHREAD
```
    Branch and Bound: specifies whether the MIP callbacks should only be called on the main thread.
    
    See Also:
    
    Constant Field Values
  - MAXMCOEFFBUFFERELEMS
```
static final int MAXMCOEFFBUFFERELEMS
```
    Specifies 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. Values are from enumeration 'REFINEOPS'
    
    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 (see Section ) for adjusting the behavior when a problem is dualized. Values are from enumeration 'DUALIZEOPS'
    
    See Also:
    
    Constant Field Values
  - CROSSOVERITERLIMIT
```
static final int CROSSOVERITERLIMIT
```
    Newton barrier and hybrid gradient: Specifies 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 (see Section ) specifies whether to sort rows, columns and MIP entities by their names when starting the presolve. With the default value 0, no sorting will take place. Values are from enumeration 'PRESORT'
    
    See Also:
    
    Constant Field Values
  - PREPERMUTE
```
static final int PREPERMUTE
```
    This bit-vector control (see Section ) specifies whether to randomly permute rows, columns and MIP entities when starting the presolve. With the default value 0, no permutation will take place. Values are from enumeration 'PREPERMUTE'
    
    See Also:
    
    Constant Field Values
  - PREPERMUTESEED
```
static final int PREPERMUTESEED
```
    This control specifies 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 (MB) 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: 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
```
@Deprecated
static final int SYMSELECT
```
    Deprecated.
    since 47.00
    
    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 MB (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
  - 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
```
@Deprecated
static final int QCCUTS
```
    Deprecated.
    since 48.01
    
    Branch and Bound: Limits 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 problems with a 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
```
@Deprecated
static final int COVERCUTS
```
    Deprecated.
    since 48.01
    
    Branch and Bound: Specifies the number of rounds of lifted cover inequalities at the root 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 root node, since these inequalities then apply to every subsequent node in the tree search.
    
    See Also:
    
    Constant Field Values
  - GOMCUTS
```
@Deprecated
static final int GOMCUTS
```
    Deprecated.
    since 48.01
    
    Branch and Bound: Specifies the number of rounds of Gomory or lift-and-project cuts at the root 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 general cut strategy in terms of limits on the number of cuts and of non-zero cut elements that can be added to the problem. A more aggressive cut strategy, allowing a greater number of cuts and non-zero cut elemenets in the subproblems, will typically result in fewer nodes to be explored, but at the cost of a slowdown in the node throughput (i.e., the more cuts are added, the harder it becomes to solve the LP relaxation of each node subproblem). On the other hand, a more conservative cut strategy will typically improve the node throughput, but at the cost of more nodes to be explored for solving the problem. Values are from enumeration 'CUTSTRATEGY'
    Examples using controls().setCutStrategy:
    
    AddMipSol.java
    
    ELS.java
    
    ELSCut.java
    
    FixBV.java
    
    FolioHeuristic.java
    
    Knapsack.java
    
    MostViolated.java
    
    RecursiveFinancialPlanning.java
    
    RoundInt.java
    
    SaveSol.java
    
    Trimloss.java
    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.
    
    See Also:
    
    Constant Field Values
  - TREECOVERCUTS
```
@Deprecated
static final int TREECOVERCUTS
```
    Deprecated.
    since 48.01
    
    Branch and Bound: Specifies the number of rounds of lifted cover inequalities generated at nodes other than the root node in the tree. Compare with the description for COVERCUTS.
    
    See Also:
    
    Constant Field Values
  - TREEGOMCUTS
```
@Deprecated
static final int TREEGOMCUTS
```
    Deprecated.
    since 48.01
    
    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.
    
    See Also:
    
    Constant Field Values
  - CUTSELECT
```
@Deprecated
static final int CUTSELECT
```
    Deprecated.
    since 48.01
    
    A bit-vector (see Section ) providing detailed control of the cuts created for the root node of a MIP solve. Use TREECUTSELECT to control cuts during the tree search. Values are from enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - TREECUTSELECT
```
@Deprecated
static final int TREECUTSELECT
```
    Deprecated.
    since 48.01
    
    A bit-vector (see Section ) providing detailed control of the cuts created during the tree search of a MIP solve. Use CUTSELECT to control cuts on the root node.
    
    See Also:
    
    Constant Field Values
  - DUALIZE
```
static final int DUALIZE
```
    For a linear problem or the initial linear relaxation of a MIP, determines whether to form and solve the dual 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
```
    Specifies the number of dual iterations to perform during strong branching for each MIP entity.
    
    See Also:
    
    Constant Field Values
  - SBBEST
```
static final int SBBEST
```
    Number of infeasible MIP entities to initialize pseudo costs for on each node.
    Examples using controls().setSBBest:
    
    AddMipSol.java
    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
  - 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
  - LNPBEST
```
static final int LNPBEST
```
    Specifies the maximum number of infeasible MIP entities to create lift-and-project cuts for during each round of Gomory cuts at the root 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 MIP 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 bit-vector control (see Section ) determines how the barrier algorithm applies regularization on the KKT system. Values are from enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - SBSELECT
```
static final int SBSELECT
```
    The size of the candidate list of MIP entities for strong branching.
    
    See Also:
    
    Constant Field Values
  - IISLOG
```
static final int IISLOG
```
    Selects how much information should be printed during the IIS procedure. Please refer to Appendix for a more detailed description of the IIS logging format.
    
    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
  - DUALSTRATEGY
```
static final int DUALSTRATEGY
```
    This bit-vector control (see Section ) specifies the dual simplex strategy. Values are from enumeration 'DUALSTRATEGY'
    
    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
  - BARSTART
```
static final int BARSTART
```
    Controls the computation of the starting point and warm-starting for the Newton barrier and the hybrid gradient algorithms.
    
    See Also:
    
    Constant Field Values
  - PRESOLVEPASSES
```
static final int PRESOLVEPASSES
```
    Number of reduction rounds to be performed in presolve
    
    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
```
    Specifies 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
```
    Specifies 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 root 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 large neighborhood search (LNS) 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 MIP 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
```
    Determines the number of physical CPU cores assumed to be present in the system by the barrier and hybrid gradient algorithms.
    
    See Also:
    
    Constant Field Values
  - MAXCHECKSONMAXTIME
```
static final int MAXCHECKSONMAXTIME
```
    This control is intended for use where optimization runs that are terminated using the TIMELIMIT (or the deprecated 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 TIMELIMIT 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 TIMELIMIT criterion during the last call to the optimization routine XPRSmipoptimize. Note that this attribute value will be negative if the Optimizer terminated on the TIMELIMIT criterion. To ensure that a reproduction of a run terminates in the same way the user should first ensure that TIMELIMIT is set to its default value or to a large value so the run does not terminate again on TIMELIMIT 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 MIP 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
  - MUTEXCALLBACKS
```
static final int MUTEXCALLBACKS
```
    Branch and Bound: This determines whether the callback routines are mutexed from within the Optimizer.
    Examples using controls().getMutexCallBacks/controls().setMutexCallBacks:
    
    MostViolated.java
    See Also:
    
    Constant Field Values
  - BARCRASH
```
static final int BARCRASH
```
    Newton barrier and hybrid gradient: 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
```
@Deprecated
static final int HEURSEARCHROOTSELECT
```
    Deprecated.
    since 48.00
    
    A bit-vector control (see Section ) for selecting which large neighborhood search (LNS) heuristics to apply on the root node of a MIP solve. Values are from enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHTREESELECT
```
@Deprecated
static final int HEURSEARCHTREESELECT
```
    Deprecated.
    since 48.00
    
    A bit-vector control (see Section ) for selecting which large neighborhood search (LNS) heuristics to apply during the tree search of a MIP solve. 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 tree search has finished with root cutting and heuristics. Values are from enumeration 'ALWAYSNEVERAUTOMATIC'
    
    See Also:
    
    Constant Field Values
  - FORCEOUTPUT
```
@Deprecated
static final int FORCEOUTPUT
```
    Deprecated.
    since 48.00
    
    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
  - PRIMALOPS
```
static final int PRIMALOPS
```
    Primal simplex: allows fine tuning the variable selection in the primal simplex solver. Values are from enumeration 'PRIMALOPS'
    
    See Also:
    
    Constant Field Values
  - DETERMINISTIC
```
static final int DETERMINISTIC
```
    Selects whether to use a deterministic or opportunistic mode when solving a problem using multiple threads.
    
    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
  - TREEMEMORYLIMIT
```
static final int TREEMEMORYLIMIT
```
    A soft limit, in MB (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 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 "tree 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 tree file, the Optimizer can try to use data-compression techniques to reduce the size of the tree file on disk. The TREECOMPRESSION control determines the strength of the data-compression algorithm used; higher values give superior data-compression at the effect 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 tree file.
    
    See Also:
    
    Constant Field Values
  - TREEDIAGNOSTICS
```
static final int TREEDIAGNOSTICS
```
    A bit-vector (see Section ) providing control over how various tree-management-related messages get printed in the tree log file during the branch-and-bound search. Values are from enumeration 'TREEDIAGNOSTICS'
    
    See Also:
    
    Constant Field Values
  - MAXTREEFILESIZE
```
static final int MAXTREEFILESIZE
```
    Specifies the maximum size, in megabytes (MB), to which a single tree file may grow. When the tree file reaches this limit, a second tree 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
  - 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 over binary columns positive definite when it is possible. This is achieved by making the matrix diagonally dominant and it enables solving nonconvex quadratic problems with binary columns without relying on linearization or resorting to the Xpress Global Solver. Values are from enumeration 'ALWAYSNEVERAUTOMATIC'
    
    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 large neighborhood search heuristic to find a feasible integer solution from a partial or infeasible user solution.
    
    See Also:
    
    Constant Field Values
  - PRECONVERTOBJTOCONS
```
static final int PRECONVERTOBJTOCONS
```
    Presolve: convert a linear or quadratic objective function into an objective transfer constraint
    
    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 during the root solve.
    
    See Also:
    
    Constant Field Values
  - THREADS
```
static final int THREADS
```
    The default number of threads used during optimization.
    Examples using controls().getThreads:
    
    MostViolated.java
    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 bit-vector (see Section ) 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 via a bit-vector (see Section ). Values are from enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - MIPRESTART
```
static final int MIPRESTART
```
    Branch and Bound: controls strategy for in-tree restarts. Values are from enumeration 'MIPRESTART'
    Examples using controls().getMipRestart/controls().setMipRestart:
    
    MostViolated.java
    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 number of cores assumed to be present 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 bit-vector control (see Section ) allows for the adjustment of returned solution values such that they are always within bounds. Values are from enumeration 'CLAMPING'
    
    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, Intel x86 or ARM vectorization instruction set that Barrier should run optimized code for. On AMD / Intel x86 platforms the SSE2, AVX and AVX2 instruction sets are supported while on ARM platforms the NEON architecture extension can be activated.
    
    See Also:
    
    Constant Field Values
  - BARALG
```
static final int BARALG
```
    This control determines which barrier algorithm is used to solve the problem. Notably, this is also the control to enable the primal-dual hybrid gradient algorithm.
    
    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
```
@Deprecated
static final int TREEQCCUTS
```
    Deprecated.
    since 48.01
    
    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.
    
    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 constraints 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 large neighborhood search (LNS) heuristics without objective or with an auxiliary objective should always be used, despite the automatic selection of the Optimizer. Deactivated by default.
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHROOTCUTFREQ
```
static final int HEURSEARCHROOTCUTFREQ
```
    How frequently to run the large neighborhood search (LNS) heuristics during root cutting. This is given as how many cut rounds to perform between runs of the heuristics. Set to zero to disable all LNS heuristics during root cutting.
    
    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
  - 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
  - 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
  - LPFLAGS
```
static final int LPFLAGS
```
    A bit-vector control (see Section ) 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 objective scaling factor, expressed as a power of 2. When set, it overwrites the automatic 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
  - TREEFILELOGINTERVAL
```
static final int TREEFILELOGINTERVAL
```
    This control sets the interval between progress messages output while writing tree data to the tree file, in seconds. The solve is slowed greatly while data is being written to the tree file and this output allows the user to see how much progress is being made.
    
    See Also:
    
    Constant Field Values
  - MIPDUALREDUCTIONS
```
static final int MIPDUALREDUCTIONS
```
    Branch and Bound: Limits operations that can reduce the MIP solution space.
    Examples using controls().setMIPDualReductions:
    
    MostViolated.java
    
    TSP.java
    
    TravelingSalesPerson.java
    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
```
@Deprecated
static final int AUTOSCALING
```
    Deprecated.
    since 48.00
    
    Whether the Optimizer should automatically select between different scaling algorithms. If the SCALING control is set, or SCALINGMETHOD is set to anything other than its automatic default, 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. A job of priority N will always get scheduled before a job of priority N-1, provided there is sufficient capacity.
    
    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 is always fired in a deterministic order during a parallel MIP solve. This applies only when the control DETERMINISTIC is set to 1.
    
    See Also:
    
    Constant Field Values
  - NUMERICALEMPHASIS
```
static final int NUMERICALEMPHASIS
```
    How much emphasis to place on numerical stability instead of solve speed.
    
    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.
    Examples using controls().setHeurEmphasis:
    
    AddMipSol.java
    
    Knapsack.java
    
    MostViolated.java
    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
  - CHECKINPUTDATA
```
static final int CHECKINPUTDATA
```
    Check input arrays for bad data.
    
    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
```
    Specifies the maximum number of seconds to wait for an I/O operation before it is cancelled.
    
    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
  - GLOBALNUMINITNLPCUTS
```
@Deprecated
static final int GLOBALNUMINITNLPCUTS
```
    Deprecated.
    since 48.01
    
    Specifies the maximum number of tangent cuts when setting up the initial relaxation during a global solve. By default, the algorithm chooses the number of cuts automatically. Adding more cuts tightens the problem, resulting in a smaller branch-and-bound tree, at the cost of slowing down each LP solve.
    
    See Also:
    
    Constant Field Values
  - CALLBACKCHECKTIMEDELAY
```
static final int CALLBACKCHECKTIMEDELAY
```
    Minimum delay in milliseconds between two consecutive executions of the CHECKTIME callback in the same solution process
    
    See Also:
    
    Constant Field Values
  - MULTIOBJOPS
```
static final int MULTIOBJOPS
```
    Modifies the behaviour of the Optimizer when solving multi-objective problems. Values are from enumeration 'MULTIOBJOPS'
    
    See Also:
    
    Constant Field Values
  - MULTIOBJLOG
```
static final int MULTIOBJLOG
```
    Log level for multi-objective optimization.
    
    See Also:
    
    Constant Field Values
  - LPBACKGROUNDTHREADS
```
static final int LPBACKGROUNDTHREADS
```
    Specifies the maximum number of threads to use for background work (typically heuristics) in parallel to the root LP relaxation of a MIP. This control can help finding feasible MIP solutions fast for models with difficult root LP relaxation. The algorithm employed is similar to the one used during pre-root parallel heuristics.
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDMAXTHREADS
```
static final int BACKGROUNDMAXTHREADS
```
    Limits the number of threads to use in background jobs (for example in parallel to the root cut loop).
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT
```
static final int BACKGROUNDSELECT
```
    Bit-vector control (see Section ) to select which tasks to run in background jobs (for example in parallel to the root cut loop). Values are from enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - GLOBALLSHEURSTRATEGY
```
static final int GLOBALLSHEURSTRATEGY
```
    When integer-feasible (for MINLP, any solution for NLP) but nonlinear-infeasible solutions are encountered within a global solve, the integer variables can be fixed and a local solver (as defined by the LOCALSOLVER control) can be called on the remaining continuous problem. This control defines the frequency and effort of such local solves. Values are from enumeration 'GLOBALLSHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALSPATIALBRANCHIFPREFERORIG
```
static final int GLOBALSPATIALBRANCHIFPREFERORIG
```
    Whether spatial branchings on original variables should be preferred over branching on auxiliary variables that were introduced by the reformulation of the global solver.
    
    See Also:
    
    Constant Field Values
  - PRECONFIGURATION
```
static final int PRECONFIGURATION
```
    MIP Presolve: determines whether binary rows with only few repeating coefficients should be reformulated. The reformulation enumerates the extremal feasible configurations of a row and introduces new columns and rows to model the choice between these extremal configurations. This presolve operation can be disabled as part of the (advanced) IP reductions PRESOLVEOPS.
    
    See Also:
    
    Constant Field Values
  - FEASIBILITYJUMP
```
static final int FEASIBILITYJUMP
```
    MIP: Decides if the Feasibility Jump heuristic should be run. The value for this control is either -1 (let Xpress decide), 0 (off) or a value that indicates for which type of models the heuristic should be run.
    
    See Also:
    
    Constant Field Values
  - IISOPS
```
static final int IISOPS
```
    Selects which part of the restrictions (bounds, constraints, entities) should always be kept in an IIS. This is useful if certain types of restrictions cannot be violated, thus they are known not to be the cause of infeasibility. The IIS obtained this way is irreducible only for the non-protected restrictions. This bit-vector control (see Section ) has an effect only on the deletion filter of the IIS procedure. Values are from enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - RLTCUTS
```
@Deprecated
static final int RLTCUTS
```
    Deprecated.
    since 48.01
    
    Determines whether RLT cuts should be separated in the Xpress Global Solver.
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHBACKGROUNDSELECT
```
static final int HEURSEARCHBACKGROUNDSELECT
```
    Bit-vector control (see Section ) to select which large neighborhood searches to run in the background (for example in parallel to the root cut loop). Values are from enumeration 'HEURSEARCHBACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - ALTERNATIVEREDCOSTS
```
@Deprecated
static final int ALTERNATIVEREDCOSTS
```
    Deprecated.
    since 48.00
    
    Controls aggressiveness of searching for alternative reduced cost.
    
    See Also:
    
    Constant Field Values
  - HEURSHIFTPROP
```
static final int HEURSHIFTPROP
```
    Determines whether the Shift-and-propagate primal heuristic should be executed. If enabled, Shift-and-propagate is an LP-free primal heuristic that is executed immediately after presolve.
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHCOPYCONTROLS
```
static final int HEURSEARCHCOPYCONTROLS
```
    Select how user-set controls should affect the subproblems solved by large neighborhood search (LNS) heuristics.
    
    See Also:
    
    Constant Field Values
  - GLOBALNLPCUTS
```
@Deprecated
static final int GLOBALNLPCUTS
```
    Deprecated.
    since 48.01
    
    Limits the number of rounds of outer approximation and convexification cuts generated for the root node, when solving an (MI)NLP to global optimality.
    
    See Also:
    
    Constant Field Values
  - GLOBALTREENLPCUTS
```
@Deprecated
static final int GLOBALTREENLPCUTS
```
    Deprecated.
    since 48.01
    
    Limits the number of rounds of outer approximation and convexification cuts generated for each node in the tree, when solving an (MI)NLP to global optimality.
    
    See Also:
    
    Constant Field Values
  - BARHGOPS
```
static final int BARHGOPS
```
    Bit-vector control (see Section ) options for the hybrid gradient algorithm. Bits 1, 2 and 3 control which norms of the coefficient matrix are used for solution normalization. The normalization factor is the maximum of the selected norms. By default, or if all three bits are set to 0, the L2 norm is used. The omega parameter referenced in bits 4, 5 and 6 is a measure of the relative magnitudes of the objective and the right-hand side. Additional scaling is controlled by bits 8-9. If no bit is set at all then a the default value is determined automatically based on the algorithm choice. Values are from enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGMAXRESTARTS
```
static final int BARHGMAXRESTARTS
```
    The maximum number of restarts in the hybrid gradient algorithm. Restarts play the role of iterations in the hybrid gradient algorithm. A log line is printed at every restart, unless BAROUTPUT is set to 0.
    
    See Also:
    
    Constant Field Values
  - MCFCUTSTRATEGY
```
@Deprecated
static final int MCFCUTSTRATEGY
```
    Deprecated.
    since 48.01
    
    Level of Multi-Commodity Flow (MCF) cutting planes separation: This specifies how aggressively MCF cuts should be separated. If the separation of MCF cuts is enabled, Xpress will try to detect a MCF network structure in the problem and, if such a structure is identified, it will separate specific cutting planes exploiting the identified network.
    
    See Also:
    
    Constant Field Values
  - PREROOTTHREADS
```
static final int PREROOTTHREADS
```
    Specifies an explicit number of threads that should be used for the Pre-root parallel heuristic phase. By default, this phase will use all threads available to the solver (as governed by the control THREADS).
    
    See Also:
    
    Constant Field Values
  - BARITERATIVE
```
static final int BARITERATIVE
```
    The maximum number of barrier iterations in which an iterative solver is used instead of the Cholesky decomposition.
    
    See Also:
    
    Constant Field Values
  - GLOBALPRESOLVEOBBT
```
static final int GLOBALPRESOLVEOBBT
```
    Controls the amount of work performed by Optimization-Based Bound Tightening (OBBT).
    
    See Also:
    
    Constant Field Values
  - SDPCUTSTRATEGY
```
@Deprecated
static final int SDPCUTSTRATEGY
```
    Deprecated.
    since 48.01
    
    Level of SDP cutting planes separation: This specifies how aggressively SDP cuts should be separated. Values are from enumeration 'SDPCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - DETERMINISTICLOG
```
static final int DETERMINISTICLOG
```
    Suppress non-deterministic log information in the standard MIP log. In particular, wall clock time stamps are replaced by (deterministic) work units.
    
    See Also:
    
    Constant Field Values
  - BARHGGPU
```
static final int BARHGGPU
```
    Whether to use a GPU for the hybrid gradient algorithm. Even though the GPU implementation of the hybrid gradient algorithm is identical in operation and functionality to the CPU implementation, the returned solutions can differ between the two versions due to the different architecture of the GPU. GPU support is not available in the deterministic concurrent LP algorithm.
    
    See Also:
    
    Constant Field Values
  - BARHGPRECISION
```
static final int BARHGPRECISION
```
    Whether to use single or double precision floating-point arithmetic in the hybrid gradient algorithm. The single precision implementation uses less memory and is, in general, faster than the double precision implementation. This control applies to both the CPU and the GPU implementation of the algorithm. The performance difference is greater for the GPU version. Values are from enumeration 'BARHGPRECISION'
    
    See Also:
    
    Constant Field Values
  - BARHGGPUBLOCKSIZE
```
static final int BARHGGPUBLOCKSIZE
```
    The size of CUDA blocks to use for the GPU calculations.
    
    See Also:
    
    Constant Field Values
  - BARHGGPUALG
```
static final int BARHGGPUALG
```
    Defines the GPU algorithm choice. The Nvidia linear algebra libraries offer various ways to calculate matrix-vector products. Some of these require more memory, but offer deterministic execution. On the other hand, there is a limited memory option, but with nondeterministic execution.
    
    See Also:
    
    Constant Field Values
  - GPUPLATFORM
```
static final int GPUPLATFORM
```
    Controls what kind of GPU support is enabled overall in Xpress. Individual solver components may disable GPU support.
    
    See Also:
    
    Constant Field Values
  - BARHGMINORITERATIONLIMIT
```
static final int BARHGMINORITERATIONLIMIT
```
    Minor iterations are faster but simplified steps in the algorithm. This control determines how many minor iterations can be performed before performing a full step.
    
    See Also:
    
    Constant Field Values
  - MAXTOTALTREEFILESIZE
```
static final int MAXTOTALTREEFILESIZE
```
    Specifies the maximum amount of disk space, in megabytes (MB), that can be used for storing tree data for a single problem. If more than this is required by the solve, it will terminate with an error.
    
    See Also:
    
    Constant Field Values
  - MIPSTOPSTAGE
```
static final int MIPSTOPSTAGE
```
    This control allows stopping a MIP solve in an early stage of the solution process. If the control is set to a stage that is already completed then the next optimization will stop immediately. If the solution process stops due to this control, the STOPSTATUS attribute is set to MIPSTAGE. Values are from enumeration 'MIPSTOPSTAGE'
    Examples using controls().setMIPStopStage:
    
    AddMipSol.java
    
    FixBV.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    MostViolated.java
    See Also:
    
    Constant Field Values
  - GPUCUDADEVICE
```
static final int GPUCUDADEVICE
```
    Controls which CUDA device should be used when GPU execution is enabled and there are multiple CUDA devices installed in a system. The first CUDA device number is 0. If the selected CUDA device is invalid or is not found, then an error is returned.
    
    See Also:
    
    Constant Field Values
  - ALTERNATIVELPSOLS
```
static final int ALTERNATIVELPSOLS
```
    Controls the collection of alternative LP solutions for cut separation and heuristics.
    
    See Also:
    
    Constant Field Values
  - POOLLIMIT
```
static final int POOLLIMIT
```
    Determines the maximum number of solutions to be collected during a solve with XPRSoptimize, XPRSmipoptimize or XPRSnlpoptimize. Multiple solutions can be collected from a MIP solve, a Global solve or an MISLP solve.
    Examples using controls().setPoolLimit:
    
    SolutionPool.java
    
    Sudoku.java
    See Also:
    
    Constant Field Values
  - POOLKEEPSOLS
```
static final int POOLKEEPSOLS
```
    Limits the number of collected solutions that should automatically be transferred into a next solve. Solutions collected from a MIP solve or from a Global solve can be transferred automatically as warm-start solutions for a subsequent solve, by setting this control to a positive value. Solutions will be transferred the first time a problem is modified after having been solved, or at the start of the next solve if no modifications were applied. The warm-starting is equivalent to calling XPRSaddmipsol on the POOLKEEPSOLS best solutions stored in the pool and therefore supports any solve type that can be warm-started by XPRSaddmipsol.
    Examples using controls().setPoolKeepSols:
    
    SolutionPool.java
    See Also:
    
    Constant Field Values
  - POOLENUMSTRATEGY
```
static final int POOLENUMSTRATEGY
```
    Enables extended branch-and-bound search strategies to identify and capture additional solutions into the solution pool. The built-in solution pool will collect solutions encountered during a branch-and-bound search, subject to the limitations imposed by controls such as POOLLIMIT, POOLRELGAP and POOLABSGAP. With the default setting of POOLENUMSTRATEGY=0 the collection will not affect the branch-and-bound search itself. When POOLENUMSTRATEGY > 0, more of the branch-and-bound tree will be explored and additional nodes will be searched based on whether they admit additional solutions that can be added to the solution pool. Values are from enumeration 'POOLENUMSTRATEGY'
    Examples using controls().setPoolEnumStrategy:
    
    SolutionPool.java
    
    Sudoku.java
    See Also:
    
    Constant Field Values
  - POOLDUPLICATECHECK
```
static final int POOLDUPLICATECHECK
```
    When extended branch-and-bound search for additional solutions has been enabled through POOLENUMSTRATEGY, this control determines which MIP column entities to consider when checking if two solutions should be considered duplicates. If two solutions are discovered with the same discrete values for the MIP column entities, only the solution with the better objective value is kept.
    
    See Also:
    
    Constant Field Values
  - NODEPRESOLVE
```
static final int NODEPRESOLVE
```
    This control determines whether some form of presolving should be performed at Branch and Bound nodes. Node presolve attempts to simplify the problem by detecting and removing redundant constraints, tightening variable bounds, etc. Values are from enumeration 'NODEPRESOLVE'
    Examples using controls().setNodePresolve:
    
    ELSCut.java
    
    FolioHeuristic.java
    See Also:
    
    Constant Field Values
  - NODEREDCOSTTIGHTEN
```
static final int NODEREDCOSTTIGHTEN
```
    This control determines whether reduced cost tightening is applied during Branch and Bound. Values are from enumeration 'NODEREDCOSTTIGHTEN'
    
    See Also:
    
    Constant Field Values
  - NODEAPPLIEDBOUNDS
```
static final int NODEAPPLIEDBOUNDS
```
    This control determines whether the solver is allowed to apply primal reductions at each node. The solver will use the constraints of the node to tighten the range of variables, often resulting in fixing their values. This can greatly simplify the problem and may even determine optimality or infeasibility of the node before the simplex method commences. Values are from enumeration 'NODEAPPLIEDBOUNDS'
    
    See Also:
    
    Constant Field Values
  - NODEDUALREDUCTIONS
```
static final int NODEDUALREDUCTIONS
```
    This control determines whether the solver is allowed to apply dual reductions at each node. Values are from enumeration 'DUALREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - CUTSEPCLIQUESTRATEGY
```
static final int CUTSEPCLIQUESTRATEGY
```
    Strategy for separation of clique cuts. A more aggressive strategy will increase the effort spent in clique cut separation and the frequency at which clique cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then clique cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPMIRSTRATEGY
```
static final int CUTSEPMIRSTRATEGY
```
    Strategy for separation of Mixed Integer Rounding (MIR) cuts. A more aggressive strategy will increase the effort spent in MIR cut separation and the frequency at which MIR cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then MIR cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPCOVERSTRATEGY
```
static final int CUTSEPCOVERSTRATEGY
```
    Strategy for separation of lifted cover cuts. A more aggressive strategy will increase the effort spent in lifted cover cut separation and the frequency at which lifted cover cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then lifted cover cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPFLOWPATHSTRATEGY
```
static final int CUTSEPFLOWPATHSTRATEGY
```
    Strategy for separation of flow path cuts. A more aggressive strategy will increase the effort spent in flow path cut separation and the frequency at which flow path cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then flow path cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPIMPLBOUNDSTRATEGY
```
static final int CUTSEPIMPLBOUNDSTRATEGY
```
    Strategy for separation of implication cuts. A more aggressive strategy will increase the effort spent in implication cut separation and the frequency at which implication cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then implication cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPGUBCOVERSTRATEGY
```
static final int CUTSEPGUBCOVERSTRATEGY
```
    Strategy for separation of lifted GUB cover cuts. A more aggressive strategy will increase the effort spent in lifted GUB cover cut separation and the frequency at which lifted GUB cover cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then lifted GUB cover cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPZEROHALFSTRATEGY
```
static final int CUTSEPZEROHALFSTRATEGY
```
    Strategy for separation of zero-half cuts. A more aggressive strategy will increase the effort spent in zero-half cut separation and the frequency at which zero-half cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then zero-half cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRONGCGSTRATEGY
```
static final int CUTSEPSTRONGCGSTRATEGY
```
    Strategy for separation of Strong Chvatal-Gomory (CG) cuts. A more aggressive strategy will increase the effort spent in Strong CG cut separation and the frequency at which Strong CG cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then Strong CG cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPFARKASSTRATEGY
```
static final int CUTSEPFARKASSTRATEGY
```
    Strategy for separation of Farkas cuts. A more aggressive strategy will increase the effort spent in Farkas cut separation and the frequency at which Farkas cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then Farkas cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPPATHMIXSTRATEGY
```
static final int CUTSEPPATHMIXSTRATEGY
```
    Strategy for separation of path mixing cuts. A more aggressive strategy will increase the effort spent in path mixing cut separation and the frequency at which path mixing cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then path mixing cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPMCFSTRATEGY
```
static final int CUTSEPMCFSTRATEGY
```
    Strategy for separation of Multi-Commodity Flow (MCF) cuts. A more aggressive strategy will increase the effort spent in MCF cut separation and the frequency at which MCF cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then MCF cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPGOMORYSTRATEGY
```
static final int CUTSEPGOMORYSTRATEGY
```
    Strategy for separation of Gomory cuts. A more aggressive strategy will increase the effort spent in Gomory cut separation and the frequency at which Gomory cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then Gomory cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPRLTSTRATEGY
```
static final int CUTSEPRLTSTRATEGY
```
    Strategy for separation of Reformulation-Linearization Technique (RLT) cuts. A more aggressive strategy will increase the effort spent in RLT cut separation and the frequency at which RLT cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then RLT cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSDPSTRATEGY
```
static final int CUTSEPSDPSTRATEGY
```
    Strategy for separation of semidefinite programming (SDP) cuts. A more aggressive strategy will increase the effort spent in SDP cut separation and the frequency at which SDP cuts are separated during the branch-and-bound tree search. If a conservative strategy is selected (i.e., value 1, XPRS_CUTSEPSTRATEGY_CONSERVATIVE), then SDP cuts will be separated only at the root node of the branch-and-bound tree. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRATEGY
```
static final int CUTSEPSTRATEGY
```
    Meta control specifying the cut separation strategy for every individual CUTSEP*STRATEGY control left at its default value of -1 (automatic). Setting CUTSEPSTRATEGY to a value other than -1 overrides the automatic decision for each cut separator whose own control is left to value -1 (automatic). An individual control (e.g. CUTSEPCLIQUESTRATEGY) that is set to a value other than -1 always takes precedence over this meta control. Values are from enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTAGGROWS
```
static final int CUTAGGROWS
```
    Strategy for row aggregation used when separating Mixed Integer Rounding (MIR) cuts, lifted cover cuts and Strong Chvatal-Gomory (CG) cuts. Row aggregation combines several rows of the problem into a single row from which a cut is then derived. A more aggressive strategy will try more and more complex row aggregations, which can uncover cuts that would otherwise be missed, at the cost of extra computational effort and, in some cases, at the cost of separating denser cutting planes that could slow down the node throughput. Values are from enumeration 'CUTAGGROWS'
    
    See Also:
    
    Constant Field Values
  - CUTFROMCUTROWS
```
static final int CUTFROMCUTROWS
```
    Strategy to decide whether cutting planes already added to the matrix may themselves be used as base rows for separating new Mixed Integer Rounding (MIR) cuts, lifted cover cuts and Strong Chvatal-Gomory (CG) cuts. A more aggressive strategy allows cutting from cut rows more often, which can uncover additional cuts, at the cost of extra computational effort and, in some cases, at the cost of separating denser cutting planes that could slow down the node throughput. Values are from enumeration 'CUTFROMCUTROWS'
    
    See Also:
    
    Constant Field Values
  - CUTMAXROUNDS
```
static final int CUTMAXROUNDS
```
    The number of rounds of cuts separated at the root node of the branch-and-bound tree search, for all MIP cut separators except Gomory cuts.
    
    See Also:
    
    Constant Field Values
  - CUTGOMMAXROUNDS
```
static final int CUTGOMMAXROUNDS
```
    The number of rounds of Gomory cuts or lift-and-project cuts separated at the root node of the branch-and-bound tree search.
    
    See Also:
    
    Constant Field Values
  - CUTOAMAXROUNDS
```
static final int CUTOAMAXROUNDS
```
    The number of rounds of Outer Approximation (OA) cuts for convex quadratic problems and for Second Order Cone Programs (SOCPs) separated at the root node of the branch-and-bound tree search.
    
    See Also:
    
    Constant Field Values
  - GLOBALCONVCUTMAXROUNDS
```
static final int GLOBALCONVCUTMAXROUNDS
```
    The number of rounds of outer approximation and convexification cuts separated at the root node of the branch-and-bound tree search, when solving an (MI)NLP to global optimality.
    
    See Also:
    
    Constant Field Values
  - CUTMAXTREEROUNDS
```
static final int CUTMAXTREEROUNDS
```
    The number of rounds of cuts separated at a node of the branch-and-bound tree search other than the root node, for all MIP cut separators except Gomory cuts.
    
    See Also:
    
    Constant Field Values
  - CUTGOMMAXTREEROUNDS
```
static final int CUTGOMMAXTREEROUNDS
```
    The number of rounds of Gomory cuts or lift-and-project cuts separated at a node of the branch-and-bound tree search other than the root node.
    
    See Also:
    
    Constant Field Values
  - CUTOAMAXTREEROUNDS
```
static final int CUTOAMAXTREEROUNDS
```
    The number of rounds of Outer Approximation (OA) cuts for convex quadratic problems and for Second Order Cone Programs (SOCPs) separated at a node of the branch-and-bound tree search other than the root node.
    
    See Also:
    
    Constant Field Values
  - GLOBALCONVCUTMAXTREEROUNDS
```
static final int GLOBALCONVCUTMAXTREEROUNDS
```
    The number of rounds of outer approximation and convexification cuts separated at a node of the branch-and-bound tree search other than the root node, when solving an (MI)NLP to global optimality.
    
    See Also:
    
    Constant Field Values
  - SCALINGMETHOD
```
static final int SCALINGMETHOD
```
    Which scaling method to use. Values are from enumeration 'SCALINGMETHOD'
    
    See Also:
    
    Constant Field Values
  - SCALINGORDER
```
static final int SCALINGORDER
```
    When scaling is applied relative to presolve. Values are from enumeration 'SCALINGORDER'
    
    See Also:
    
    Constant Field Values
  - SCALINGBIGM
```
static final int SCALINGBIGM
```
    Whether to apply special handling of big-M rows during scaling. Values are from enumeration 'SCALINGBIGM'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS
```
static final int SCALINGOPS
```
    This bit-vector control (see Section ) is allows finer-grained control of the scaling process. In most circumstances it should not be necessary to change it from it's default value. Values are from enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - GLOBALMISLPHEURSTRATEGY
```
static final int GLOBALMISLPHEURSTRATEGY
```
    Controls how aggressively a set of MISLP-based root heuristics are run at the root node when solving an (MI)NLP to global optimality. Values are from enumeration 'GLOBALMISLPHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - PREDUALREDUCTIONS
```
static final int PREDUALREDUCTIONS
```
    This control determines whether the solver is allowed to apply dual reductions during presolve. Values are from enumeration 'DUALREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - PRECLIQUELIFTING
```
static final int PRECLIQUELIFTING
```
    Presolve: Determines whether to do clique lifting. Values are from enumeration 'PRECLIQUELIFTING'
    
    See Also:
    
    Constant Field Values
  - PREMIPREDUCTIONS
```
static final int PREMIPREDUCTIONS
```
    Presolve: Determines whether to do integrality based reductions. Values are from enumeration 'PREMIPREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - PREMIPENTDETECT
```
static final int PREMIPENTDETECT
```
    Presolve: Determines whether to do integer variable and SOS detection. Values are from enumeration 'PREMIPENTDETECT'
    
    See Also:
    
    Constant Field Values
  - PREELIMINATIONS
```
static final int PREELIMINATIONS
```
    Presolve: Determines whether to performe variable eliminations. Values are from enumeration 'PREELIMINATIONS'
    
    See Also:
    
    Constant Field Values
  - GLOBALINITCUTSTRATEGY
```
static final int GLOBALINITCUTSTRATEGY
```
    Strategy for the initial tangent/secant convexification cuts added per nonlinear operator when setting up the initial LP relaxation during a global solve. Adding more cuts tightens the problem, resulting in a smaller branch-and-bound tree, at the cost of slowing down each LP solve. Values are from enumeration 'GLOBALINITCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURBEFORELPGPUMETHOD
```
static final int HEURBEFORELPGPUMETHOD
```
    Enables a GPU-accelerated heuristic of the specified type. If enabled, this heuristic is called as a BEFORELP heuristic for multiple rounds. The control value XPRS_HEURBEFORELPGPUMETHOD_FEASPUMP enables a GPU accelerated version of feasibility pump. In each round, the LP relaxation is approximately solved using the Primal Dual Hybrid Gradient algorithm on the GPU, The fractional solution is then rounded, and a heuristic is called to minimize the remaining violations. The effort spent on this final polishing step can be controlled by the user. Values are from enumeration 'HEURBEFORELPGPUMETHOD'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHSTRATEGY
```
static final int HEURSEARCHSTRATEGY
```
    Meta strategy control for large neighborhood search (LNS) heuristics. When set to a value other than automatic, it determines the frequency and effort of all LNS heuristics whose individual strategy control is set to automatic. Individual heuristic strategy controls take precedence over this setting. Values are from enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHRINSSTRATEGY
```
static final int HEURSEARCHRINSSTRATEGY
```
    Strategy control for the RINS ( R) large neighborhood search heuristic, an LNS heuristic that is potentially expensive but good for finding solutions that differ significantly from the incumbent. Values are from enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHLPFIRSTSTRATEGY
```
static final int HEURSEARCHLPFIRSTSTRATEGY
```
    Strategy control for the LP first ( L) large neighborhood search heuristic, an LNS heuristic with a small neighborhood centered around a node LP solution. Values are from enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHMIPFIRSTSTRATEGY
```
static final int HEURSEARCHMIPFIRSTSTRATEGY
```
    Strategy control for the MIP first ( M) large neighborhood search heuristic, an LNS heuristic with a small neighborhood centered around an integer solution. This heuristic will often provide smaller, incremental improvements to an incumbent solution. Values are from enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHCOMBINESTRATEGY
```
static final int HEURSEARCHCOMBINESTRATEGY
```
    Strategy control for the Combine ( C) large neighborhood search heuristic, which uses a neighborhood set up through the combination of multiple integer solutions. Values are from enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHZEROOBJSTRATEGY
```
static final int HEURSEARCHZEROOBJSTRATEGY
```
    Strategy control for the Zero Objective ( Z) large neighborhood search heuristic, an LNS heuristic without an objective function. Called seldom and only when no feasible solution is available. Values are from enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHANALYTICSTRATEGY
```
static final int HEURSEARCHANALYTICSTRATEGY
```
    Strategy control for the Analytic Center ( A) large neighborhood search heuristic, an LNS heuristic with an auxiliary objective function. Called seldom and only when no feasible solution is available. Values are from enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - ROWS
```
static final int ROWS
```
    Number of rows (i.e. constraints) in the matrix.
    Examples using attributes().getRows:
    
    CuttingStock.java
    
    FolioHeuristic.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    LoadLP.java
    
    Repair.java
    
    Tableau.java
    
    Trimloss.java
    See Also:
    
    Constant Field Values
  - SETS
```
static final int SETS
```
    Number of special ordered sets in the matrix.
    Examples using attributes().getSets:
    
    Repair.java
    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.
    Examples using attributes().getSimplexIter:
    
    Tableau.java
    See Also:
    
    Constant Field Values
  - LPSTATUS
```
static final int LPSTATUS
```
    LP solution status. Values are from enumeration 'LPSTATUS'
    Examples using attributes().getLPStatus:
    
    ELSCut.java
    
    FolioHeuristic.java
    
    FolioIIS.java
    
    FolioMipIIS.java
    
    FolioQC.java
    
    Knapsack.java
    
    MultipleProblems.java
    
    QuadraticProgramming.java
    
    Wagon.java
    See Also:
    
    Constant Field Values
  - MIPSTATUS
```
static final int MIPSTATUS
```
    (MIP) solution status. Values are from enumeration 'MIPSTATUS'
    Examples using attributes().getMIPStatus:
    
    ELSCut.java
    
    FixBV.java
    
    Folio.java
    
    FolioHeuristic.java
    
    FolioMipIIS.java
    
    FolioQC.java
    
    GlobalRHSParametrics.java
    
    MultipleProblems.java
    
    Pplan.java
    
    Pplan2.java
    
    PurchasePWL.java
    
    PurchaseSOS2.java
    
    SaveSol.java
    
    Trimloss.java
    
    Wagon.java
    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 MIP search. A node is counted as solved when it is either dropped or branched on.
    Examples using attributes().getNodes:
    
    ELSCut.java
    
    FixBV.java
    
    SaveSol.java
    See Also:
    
    Constant Field Values
  - NODEDEPTH
```
static final int NODEDEPTH
```
    Depth of the current node.
    Examples using attributes().getNodeDepth:
    
    ELSCut.java
    See Also:
    
    Constant Field Values
  - ACTIVENODES
```
static final int ACTIVENODES
```
    Number of outstanding nodes.
    Examples using attributes().getActiveNodes:
    
    SaveSol.java
    See Also:
    
    Constant Field Values
  - MIPSOLNODE
```
static final int MIPSOLNODE
```
    Node at which the last integer feasible solution was found.
    Examples using attributes().getMIPSolNode:
    
    SaveSol.java
    See Also:
    
    Constant Field Values
  - MIPSOLS
```
static final int MIPSOLS
```
    Number of integer solutions that have been found.
    Examples using attributes().getMIPSols:
    
    AddMipSol.java
    
    SaveSol.java
    See Also:
    
    Constant Field Values
  - COLS
```
static final int COLS
```
    Number of columns (i.e. variables) in the matrix.
    Examples using attributes().getCols:
    
    AddMipSol.java
    
    CuttingStock.java
    
    FolioHeuristic.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    Knapsack.java
    
    MostViolated.java
    
    Repair.java
    
    RoundInt.java
    
    Tableau.java
    
    Trimloss.java
    See Also:
    
    Constant Field Values
  - SPAREROWS
```
static final int SPAREROWS
```
    Number of spare rows in the matrix.
    Examples using attributes().getSpareRows:
    
    Tableau.java
    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 MIP 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 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 for a list of possible error numbers, the errors 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.
    Examples using attributes().getMIPInfeas:
    
    AddMipSol.java
    
    Knapsack.java
    See Also:
    
    Constant Field Values
  - PRESOLVESTATE
```
static final int PRESOLVESTATE
```
    Problem status as a bit-vector (compare Section ). 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 non-zeros in the objective.
    
    See Also:
    
    Constant Field Values
  - NUMIIS
```
static final int NUMIIS
```
    Number of IISs found. You should first query the IISSOLSTATUS attribute to make sure that the IIS procedure terminated successfully.
    
    See Also:
    
    Constant Field Values
  - MIPENTS
```
static final int MIPENTS
```
    Number of MIP entities (i.e. binary, integer, semi-continuous, partial integer, and semi-continuous integer variables) but excluding the number of special ordered sets.
    Examples using attributes().getMIPEnts:
    
    AddMipSol.java
    
    FixBV.java
    
    Repair.java
    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.
    Examples using attributes().getMIPThreadID:
    
    MostViolated.java
    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
  - CROSSOVERITER
```
static final int CROSSOVERITER
```
    Number of simplex iterations performed in crossover.
    
    See Also:
    
    Constant Field Values
  - SOLSTATUS
```
static final int SOLSTATUS
```
    Status of the solution of the last problem solved with XPRSoptimize. Values are from enumeration 'SOLSTATUS'
    Examples using attributes().getSolStatus:
    
    AddMipSol.java
    
    BinBurglar.java
    
    BoolVars.java
    
    Boxes02.java
    
    Capbgt2l.java
    
    CapitalBudgeting.java
    
    ContractAllocation.java
    
    CuttingStock.java
    
    ELS.java
    
    ELSCut.java
    
    ELSManagedCuts.java
    
    FacilityLocationArray.java
    
    FacilityLocationCollection.java
    
    FixBV.java
    
    FolioCB.java
    
    FolioHeuristic.java
    
    FolioIIS.java
    
    FolioInit.java
    
    FolioMip1.java
    
    FolioMip2.java
    
    FolioMipIIS.java
    
    FolioQC.java
    
    FolioQP.java
    
    GeneralConstraints.java
    
    Glidert.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    GoalProg.java
    
    Knapsack.java
    
    LoadLP.java
    
    MostViolated.java
    
    MultipleKnapsack_Arrays.java
    
    MultipleKnapsack_Collections.java
    
    MultipleProblems.java
    
    PiecewiseLinear.java
    
    PolygonObjects.java
    
    ProductionPlanning_Index.java
    
    RecursiveFinancialPlanning.java
    
    Sangraalind.java
    
    SaveSol.java
    
    SolutionPool.java
    
    SpecialOrderedSets.java
    
    SpecialOrderedSetsQuadratic.java
    
    TSP.java
    
    Tableau.java
    
    TravelingSalesPerson.java
    
    Trimloss.java
    
    Wagon.java
    See Also:
    
    Constant Field Values
  - CUTROUNDS
```
static final int CUTROUNDS
```
    Number of rounds of cuts applied to the current node of a branch-and-bound search.
    Examples using attributes().getCutRounds:
    
    ELSManagedCuts.java
    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.
    Examples using attributes().getCallbackCount_OptNode:
    
    AddMipSol.java
    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 non-zeros in the original objective 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 (not including the null terminator).
    
    See Also:
    
    Constant Field Values
  - STOPSTATUS
```
static final int STOPSTATUS
```
    Status of the optimization process.
    Examples using attributes().getStopStatus:
    
    AddMipSol.java
    
    FixBV.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    GoalProg.java
    
    Knapsack.java
    
    LoadLP.java
    
    MostViolated.java
    
    SaveSol.java
    
    TSP.java
    
    Tableau.java
    
    TravelingSalesPerson.java
    
    Trimloss.java
    See Also:
    
    Constant Field Values
  - ORIGINALMIPENTS
```
static final int ORIGINALMIPENTS
```
    Number of MIP 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 tree file.
    
    See Also:
    
    Constant Field Values
  - CURRENTNODE
```
static final int CURRENTNODE
```
    The unique identifier of the current node in the tree search.
    Examples using attributes().getCurrentNode:
    
    Knapsack.java
    
    RoundInt.java
    
    SaveSol.java
    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
  - TREEFILESIZE
```
static final int TREEFILESIZE
```
    The allocated size of the tree file, in megabytes. Because data can be removed from the tree file during the branch and bound search, the size of the tree file is usually greater than the amount of data currently within it (represented by the TREEFILEUSAGE attribute).
    
    See Also:
    
    Constant Field Values
  - TREEFILEUSAGE
```
static final int TREEFILEUSAGE
```
    The number of megabytes of data from the branch-and-bound tree that have been saved to the tree file. Note that the actual allocated size of the tree file (represented by the TREEFILESIZE attribute) 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.
    Examples using attributes().getCoresDetected:
    
    MostViolated.java
    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
  - OPTIMIZETYPEUSED
```
static final int OPTIMIZETYPEUSED
```
    The type of solver used in the last call to XPRSoptimize, XPRSmipoptimize, XPRSlpoptimize or XPRSnlpoptimize. Values are from enumeration 'OPTIMIZETYPE'
    
    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
```
    The number of general constraints (i.e. MIN/MAX/AND/OR/ABS constraints) in the problem.
    
    See Also:
    
    Constant Field Values
  - GENCONCOLS
```
static final int GENCONCOLS
```
    Number of input variables in general constraints (i.e. MIN/MAX/AND/OR/ABS constraints) in the problem.
    
    See Also:
    
    Constant Field Values
  - GENCONVALS
```
static final int GENCONVALS
```
    Number of constant values in general constraints (MIN/MAX 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
  - MEMORYLIMITDETECTED
```
static final int MEMORYLIMITDETECTED
```
    The detected amount of memory accessible to the solver process, in megabytes. This is the minimum of physical memory, virtual memory limitations, and detected container limitations (Linux only).
    
    See Also:
    
    Constant Field Values
  - RESTARTS
```
static final int RESTARTS
```
    Total number of restarts performed.
    
    See Also:
    
    Constant Field Values
  - SOLVESTATUS
```
static final int SOLVESTATUS
```
    Status of the solve of the last problem solved with XPRSoptimize. Values are from enumeration 'SOLVESTATUS'
    Examples using attributes().getSolveStatus:
    
    AddMipSol.java
    
    CapitalBudgeting.java
    
    ELSCut.java
    
    ELSManagedCuts.java
    
    FixBV.java
    
    FolioCB.java
    
    FolioHeuristic.java
    
    FolioIIS.java
    
    FolioInit.java
    
    FolioMip1.java
    
    FolioMip2.java
    
    FolioMipIIS.java
    
    FolioQC.java
    
    FolioQP.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    GoalProg.java
    
    Knapsack.java
    
    LoadLP.java
    
    MostViolated.java
    
    MultipleProblems.java
    
    SaveSol.java
    
    SolutionPool.java
    
    TSP.java
    
    Tableau.java
    
    Trimloss.java
    
    Wagon.java
    See Also:
    
    Constant Field Values
  - GLOBALBOUNDINGBOXAPPLIED
```
static final int GLOBALBOUNDINGBOXAPPLIED
```
    Whether a bounding box equal to the absolute value of the GLOBALBOUNDINGBOX control was applied to the problem after the initial solve came back infeasible and if so, to which variables.
    
    See Also:
    
    Constant Field Values
  - OBJECTIVES
```
static final int OBJECTIVES
```
    Number of objectives in the problem.
    Examples using attributes().getObjectives:
    
    CapitalBudgeting.java
    See Also:
    
    Constant Field Values
  - SOLVEDOBJS
```
static final int SOLVEDOBJS
```
    Number of objectives that have been solved so far during a multi-objective solve.
    Examples using attributes().getSolvedObjs:
    
    CapitalBudgeting.java
    See Also:
    
    Constant Field Values
  - OBJSTOSOLVE
```
static final int OBJSTOSOLVE
```
    Number of objectives that will be solved during the current multi-objective solve.
    
    See Also:
    
    Constant Field Values
  - GLOBALNLPINFEAS
```
static final int GLOBALNLPINFEAS
```
    Number of nonlinear infeasibilities at the current node of a global solve, measured as the number of violated atomic formulas.
    
    See Also:
    
    Constant Field Values
  - IISSOLSTATUS
```
static final int IISSOLSTATUS
```
    IIS solution status. Values are from enumeration 'IISSOLSTATUS'
    Examples using attributes().getIISSolStatus:
    
    IISExample.java
    See Also:
    
    Constant Field Values
  - INPUTROWS
```
static final int INPUTROWS
```
    Number of rows (i.e. constraints) in the original matrix before nonlinear reformulations.
    Examples using attributes().getInputRows:
    
    Repair.java
    See Also:
    
    Constant Field Values
  - INPUTCOLS
```
static final int INPUTCOLS
```
    Number of columns (i.e. variables) in the original matrix before nonlinear reformulations.
    Examples using attributes().getInputCols:
    
    Repair.java
    See Also:
    
    Constant Field Values
  - POOLSIZE
```
static final int POOLSIZE
```
    The number of solutions that have been collected during the last solve.
    Examples using attributes().getPoolSize:
    
    SolutionPool.java
    
    Sudoku.java
    See Also:
    
    Constant Field Values
  - OPTIMIZERVERSION
```
static final int OPTIMIZERVERSION
```
    The Optimizer version number, e.g., 4601 meaning release 46.01.
    
    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
  - 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
  - TUNERMAXTIME
```
static final int TUNERMAXTIME
```
    Tuner: The maximum time in seconds that the tuner will run before it terminates.
    
    See Also:
    
    Constant Field Values
  - MATRIXTOL
```
static final int MATRIXTOL
```
    The zero tolerance for 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.
    Examples using controls().getMatrixTol:
    
    MostViolated.java
    See Also:
    
    Constant Field Values
  - PIVOTTOL
```
static final int PIVOTTOL
```
    Simplex: Specifies the zero tolerance for pivot 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.
    Examples using controls().getFeasTol:
    
    FolioHeuristic.java
    See Also:
    
    Constant Field Values
  - OUTPUTTOL
```
static final int OUTPUTTOL
```
    Specifies the zero tolerance on print values.
    
    See Also:
    
    Constant Field Values
  - SOSREFTOL
```
static final int SOSREFTOL
```
    Specifies the minimum relative gap between the ordering values of elements in a special ordered set. Within the same set, two ordering values must not be the same and for any two values the gap divided by the absolute value of the larger of the two 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
```
    Specifies the zero tolerance for eta vector 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.
    Examples using controls().getMIPTol/controls().setMIPTol:
    
    AddMipSol.java
    
    Knapsack.java
    
    RoundInt.java
    See Also:
    
    Constant Field Values
  - MIPTOLTARGET
```
static final int MIPTOLTARGET
```
    Specifies the target MIPTOL value used by the automatic MIP solution refiner as defined by REFINEOPS.
    
    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 controls 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.
    Examples using controls().getMIPAbsCutoff/controls().setMIPAbsCutoff:
    
    AddMipSol.java
    
    Knapsack.java
    See Also:
    
    Constant Field Values
  - MIPRELCUTOFF
```
static final int MIPRELCUTOFF
```
    Branch and Bound: Percentage of the incumbent 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 tree 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 tree 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 branch and bound tree search will terminate. Branch and bound tree search will stop if:
    | MIPOBJVAL - BESTBOUND| <= MIPRELSTOP * 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 tree 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. 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
```
    Specifies the factor by which the problem will be perturbed prior to optimization by dual simplex. 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.
    
    See Also:
    
    Constant Field Values
  - BARGAPSTOP
```
static final int BARGAPSTOP
```
    Newton barrier and hybrid gradient: 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 and hybrid gradient: 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 and hybrid gradient: 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
  - 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 tree 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 branch and bound tree 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
```
    Threshold for the barrier to handle large bounds.
    
    See Also:
    
    Constant Field Values
  - PPFACTOR
```
static final int PPFACTOR
```
    The partial pricing candidate list sizing parameter.
    
    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 the 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 MIP 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 large neighborhood search (LNS) 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 tree 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 tree 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 tree 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 tree file, which can cause performance issues if these nodes are required later in the solve.
    
    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 tree 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 tree 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 tree 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 tree 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 tree 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
  - MAXIMPLIEDBOUND
```
static final int MAXIMPLIEDBOUND
```
    Presolve: When tighter bounds are calculated during MIP or nonlinear 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
  - NODEPROBINGEFFORT
```
static final int NODEPROBINGEFFORT
```
    Adjusts the overall level of node probing.
    
    See Also:
    
    Constant Field Values
  - INPUTTOL
```
static final int INPUTTOL
```
    The zero tolerance for input values. If any value is less than or equal to INPUTTOL in absolute value, it is treated as zero. 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. 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
  - CPIALPHA
```
static final int CPIALPHA
```
    decay term for confined primal integral computation.
    
    See Also:
    
    Constant Field Values
  - GLOBALSPATIALBRANCHPROPAGATIONEFFORT
```
static final int GLOBALSPATIALBRANCHPROPAGATIONEFFORT
```
    Limits the effort that is spent on propagation during spatial branching.
    
    See Also:
    
    Constant Field Values
  - GLOBALSPATIALBRANCHCUTTINGEFFORT
```
static final int GLOBALSPATIALBRANCHCUTTINGEFFORT
```
    Limits the effort that is spent on creating cuts during spatial branching.
    
    See Also:
    
    Constant Field Values
  - GLOBALBOUNDINGBOX
```
static final int GLOBALBOUNDINGBOX
```
    If a nonlinear problem cannot be solved due to appearing unbounded, it can automatically be regularized by the application of a bounding box on the variables. If this control is set to a negative value, in a second solving attempt all original variables will be bounded by the absolute value of this control. If set to a positive value, there will be a third solving attempt afterwards, if necessary, in which also all auxiliary variables are bounded by this value.
    
    See Also:
    
    Constant Field Values
  - TIMELIMIT
```
static final int TIMELIMIT
```
    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 nodes.
    Examples using controls().setTimeLimit:
    
    Folio.java
    See Also:
    
    Constant Field Values
  - SOLTIMELIMIT
```
static final int SOLTIMELIMIT
```
    The maximum time in seconds that the Optimizer will run a MIP solve before it terminates, given that a solution has been found. As long as no solution has been found, this control will have no effect.
    
    See Also:
    
    Constant Field Values
  - REPAIRINFEASTIMELIMIT
```
static final int REPAIRINFEASTIMELIMIT
```
    Overall time limit for the repairinfeas tool
    
    See Also:
    
    Constant Field Values
  - BARHGEXTRAPOLATE
```
static final int BARHGEXTRAPOLATE
```
    Extrapolation parameter for the hybrid gradient algorithm. Although theory suggests that a value of 1 is best, slightly smaller values perform better in general.
    
    See Also:
    
    Constant Field Values
  - WORKLIMIT
```
static final int WORKLIMIT
```
    The maximum work (measured in work units) that the Optimizer will run before it terminates. WORK is accumulated during the search and ever increasing. In contrast to TIME, WORK is independent of the hardware and platform on which the search is conducted. The WORKLIMIT serves as a deterministic stopping criterion. When it is reached, it leaves the Optimizer in a reproducible state.
    
    See Also:
    
    Constant Field Values
  - CALLBACKCHECKTIMEWORKDELAY
```
static final int CALLBACKCHECKTIMEWORKDELAY
```
    Minimum delay in work units between two consecutive executions of the CHECKTIME callback in the same solution process
    
    See Also:
    
    Constant Field Values
  - PREROOTWORKLIMIT
```
static final int PREROOTWORKLIMIT
```
    Set an explicit work limit in work units for the Pre-root parallel heuristic phase. Any positive value also enables this phase and runs it until the PREROOTWORKLIMIT units of work are hit.
    
    See Also:
    
    Constant Field Values
  - PREROOTEFFORT
```
static final int PREROOTEFFORT
```
    Dial for the work spent during the Pre-root parallel heuristic phase. A positive value sets a suitable work limit that is dependent on problem-characteristics. Changing the value up/or down dials the work spent in this phase up or down. This control also enables/disables Pre-root parallel heuristics.
    
    See Also:
    
    Constant Field Values
  - BARHGRELTOL
```
static final int BARHGRELTOL
```
    Relative feasibility tolerance for the hybrid gradient algorithm.
    
    See Also:
    
    Constant Field Values
  - BARHGHALPERN
```
static final int BARHGHALPERN
```
    Defines the balance between the regular and the Halpern updates during the iterations. Increasing this parameter increases the Halpern reduction.
    
    See Also:
    
    Constant Field Values
  - POOLRELGAP
```
static final int POOLRELGAP
```
    Limit on the relative gap between the objective function values of the best and worst solutions in the pool. If the best solution in the pool has objective value o-best, and o-pool is the value of another solution in the pool, they must satisfy | o-pool - o-best | < POOLRELGAP * | o-best |. If a new best solution is discovered, any existing solutions that would violate this restriction are purged from the pool. This restriction is in addition to any other restrictions on the collected solutions.
    Examples using controls().setPoolRelGap:
    
    SolutionPool.java
    See Also:
    
    Constant Field Values
  - POOLABSGAP
```
static final int POOLABSGAP
```
    Limit on the absolute gap between the objective function values of the best and worst solutions in the pool. If the best solution in the pool has objective value o-best, and o-pool is the value of another solution in the pool, they must satisfy | o-pool - o-best | < POOLABSGAP. If a new best solution is discovered, any existing solutions that would violate this restriction are purged from the pool. This restriction is in addition to any other restrictions on the collected solutions.
    
    See Also:
    
    Constant Field Values
  - HEURBEFORELPGPUEFFORT
```
static final int HEURBEFORELPGPUEFFORT
```
    Effort dial to control the effort spent inside the selected GPU heuristic method. If a GPU-accelerated heuristic method has been selected, this control can be used to increase or decrease the overall effort spent by the heuristic. For the heuristic enabled by setting HEURBEFORELPGPUMETHOD to XPRS_HEURBEFORELPGPUMETHOD_FEASPUMP, the effort parameter controls the iterations spent inside the primal-dual hybrid gradient algorithm.
    
    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
  - TIME
```
static final int TIME
```
    Time spent solving the problem as measured by the optimizer.
    
    See Also:
    
    Constant Field Values
  - LPOBJVAL
```
static final int LPOBJVAL
```
    Value of the objective function of the last LP solved.
    Examples using attributes().getLPObjVal:
    
    FolioCB.java
    
    Knapsack.java
    
    LoadLP.java
    
    RoundInt.java
    
    SaveSol.java
    
    Tableau.java
    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 best integer solution found.
    Examples using attributes().getMIPObjVal:
    
    AddMipSol.java
    
    ContractAllocation.java
    
    FixBV.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    Knapsack.java
    
    MostViolated.java
    
    SaveSol.java
    
    TSP.java
    
    TravelingSalesPerson.java
    
    Trimloss.java
    See Also:
    
    Constant Field Values
  - BESTBOUND
```
static final int BESTBOUND
```
    Value of the best bound determined so far by the MIP search. For purely continuous problems this is set to the optimal objective value (or infinity if the problem is infeasible).
    Examples using attributes().getBestBound:
    
    SaveSol.java
    See Also:
    
    Constant Field Values
  - OBJRHS
```
static final int OBJRHS
```
    Fixed part of the objective function.
    
    See Also:
    
    Constant Field Values
  - MIPBESTOBJVAL
```
@Deprecated
static final int MIPBESTOBJVAL
```
    Deprecated.
    since 48.00
    
    Attribute of type Double.
    
    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
  - OBSERVEDPRIMALINTEGRAL
```
static final int OBSERVEDPRIMALINTEGRAL
```
    Value of the (observed) primal integral.
    
    See Also:
    
    Constant Field Values
  - CPISCALEFACTOR
```
static final int CPISCALEFACTOR
```
    scale factor from primal integral computation.
    
    See Also:
    
    Constant Field Values
  - OBJVAL
```
static final int OBJVAL
```
    Value of the objective function of the last problem solved with XPRSoptimize.
    Examples using attributes().getObjVal:
    
    AddMipSol.java
    
    BinBurglar.java
    
    BoolVars.java
    
    Boxes02.java
    
    Capbgt2l.java
    
    CapitalBudgeting.java
    
    Catenary.java
    
    ContractAllocation.java
    
    CuttingStock.java
    
    ELS.java
    
    ELSCut.java
    
    ELSManagedCuts.java
    
    FacilityLocationArray.java
    
    FacilityLocationCollection.java
    
    FixBV.java
    
    Folio.java
    
    FolioCB.java
    
    FolioHeuristic.java
    
    FolioInit.java
    
    FolioMip1.java
    
    FolioMip2.java
    
    FolioQC.java
    
    FolioQP.java
    
    GeneralConstraints.java
    
    GlobalObjectiveParametrics.java
    
    GlobalRHSParametrics.java
    
    Knapsack.java
    
    LoadLP.java
    
    MostViolated.java
    
    MultipleKnapsack_Arrays.java
    
    MultipleKnapsack_Collections.java
    
    MultipleProblems.java
    
    PiecewiseLinear.java
    
    Polygon.java
    
    PolygonMap.java
    
    PolygonMapDelta.java
    
    PolygonMultiMap.java
    
    PolygonMultiMapDelta.java
    
    PolygonObjects.java
    
    PolygonVecMap.java
    
    PolygonVecMapDelta.java
    
    Pplan.java
    
    Pplan2.java
    
    ProductionPlanning_Index.java
    
    PurchasePWL.java
    
    PurchaseSOS2.java
    
    QuadraticProgramming.java
    
    RecursiveFinancialPlanning.java
    
    Sangraalind.java
    
    SaveSol.java
    
    SolutionPool.java
    
    SpecialOrderedSets.java
    
    SpecialOrderedSetsQuadratic.java
    
    Trimloss.java
    
    Wagon.java
    See Also:
    
    Constant Field Values
  - WORK
```
static final int WORK
```
    Amount of deterministic algorithmic "work" spent since the invocation of the search process. Work is measured in work units. In contrast with TIME, WORK is deterministic. It is also independent of the platform and hardware used. At the end of a search, the optimizer reports both the accumulated total work as well as the speed at which WORK has been accumulated (measured in work units per second) in the log file. The accumulation of work depends on the size of the model being solved, the involved algorithms, and the stage of the search.
    
    See Also:
    
    Constant Field Values
  - POOLBESTBOUND
```
static final int POOLBESTBOUND
```
    Best bound on the objective value of any MIP solution that can be found in the remainder of the branch-and-bound search. If solution enumeration is enabled, by setting POOLENUMSTRATEGY >0, this attribute provides a bound on any undiscovered solution that can be added to the pool.
    
    See Also:
    
    Constant Field Values
  - MPSRHSNAME
```
static final int MPSRHSNAME
```
    When reading an MPS file, this control determines which entries from the RHS section will be read. 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
```
    When reading an MPS file, this control determines which neutral row will be read as the objective function. If this control is set when reading a multi-objective MPS file, only the named objective will be read; all other objectives will be ignored. 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
```
    When reading an MPS file, this control determines which entries from the RANGES section will be read. 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
```
    When reading an MPS file, this control determines which entries from the BOUNDS section will be read. 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
```
@Deprecated
static final int OBJNAME
```
    Deprecated.
    since 41.00
    
    Attribute of type String.
    
    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 or hybrid gradient 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.
    Examples using controls().setOutputLog:
    
    CuttingStock.java
    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.
    Examples using controls().setOutputLog:
    
    CuttingStock.java
    See Also:
    
    Constant Field Values
  - NLPFUNCEVAL
```
static final int NLPFUNCEVAL
```
    Bit map for determining the method of evaluating user functions and their derivatives
    
    See Also:
    
    Constant Field Values
  - NLPLOG
```
static final int NLPLOG
```
    Level of printing during SLP iterations
    
    See Also:
    
    Constant Field Values
  - NLPEVALUATE
```
static final int NLPEVALUATE
```
    Evaluation strategy for user functions
    
    See Also:
    
    Constant Field Values
  - NLPPRESOLVE
```
static final int NLPPRESOLVE
```
    This control determines whether presolving should be performed on the nonlinear problem prior to starting the main algorithm
    
    See Also:
    
    Constant Field Values
  - SLPLOG
```
static final int SLPLOG
```
    Frequency with which SLP status is printed
    
    See Also:
    
    Constant Field Values
  - LOCALSOLVER
```
static final int LOCALSOLVER
```
    Selects the library to use for local solves
    Examples using controls().setLocalSolver:
    
    Glidert.java
    See Also:
    
    Constant Field Values
  - NLPSTOPOUTOFRANGE
```
static final int NLPSTOPOUTOFRANGE
```
    Stop optimization and return error code if internal function argument is out of range
    
    See Also:
    
    Constant Field Values
  - NLPTHREADSAFEUSERFUNC
```
static final int NLPTHREADSAFEUSERFUNC
```
    Defines if user functions are allowed to be called in parallel
    
    See Also:
    
    Constant Field Values
  - NLPJACOBIAN
```
static final int NLPJACOBIAN
```
    First order differentiation mode when using analytical derivatives
    
    See Also:
    
    Constant Field Values
  - NLPHESSIAN
```
static final int NLPHESSIAN
```
    Second order differentiation mode when using analytical derivatives
    
    See Also:
    
    Constant Field Values
  - MULTISTART
```
static final int MULTISTART
```
    The multistart main control. Defines if the multistart search is to be initiated, or if only the baseline model is to be solved.
    
    See Also:
    
    Constant Field Values
  - MULTISTART_THREADS
```
static final int MULTISTART_THREADS
```
    The maximum number of threads to be used in multistart
    
    See Also:
    
    Constant Field Values
  - MULTISTART_MAXSOLVES
```
static final int MULTISTART_MAXSOLVES
```
    The maximum number of jobs to create during the multistart search.
    
    See Also:
    
    Constant Field Values
  - MULTISTART_MAXTIME
```
static final int MULTISTART_MAXTIME
```
    The maximum total time to be spent in the multistart search.
    
    See Also:
    
    Constant Field Values
  - NLPMAXTIME
```
static final int NLPMAXTIME
```
    The maximum time in seconds that the SLP optimization will run before it terminates
    
    See Also:
    
    Constant Field Values
  - NLPDERIVATIVES
```
static final int NLPDERIVATIVES
```
    Bitmap describing the method of calculating derivatives
    
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE
```
static final int NLPREFORMULATE
```
    Controls the problem reformulations carried out before augmentation. This allows SLP to take advantage of dedicated algorithms for special problem classes.
    
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEOPS
```
static final int NLPPRESOLVEOPS
```
    Bitmap indicating the SLP presolve actions to be taken
    
    See Also:
    
    Constant Field Values
  - MULTISTART_LOG
```
static final int MULTISTART_LOG
```
    The level of logging during the multistart run.
    
    See Also:
    
    Constant Field Values
  - MULTISTART_SEED
```
static final int MULTISTART_SEED
```
    Random seed used for the automatic generation of initial point when loading multistart presets
    
    See Also:
    
    Constant Field Values
  - MULTISTART_POOLSIZE
```
static final int MULTISTART_POOLSIZE
```
    The maximum number of problem objects allowed to pool up before synchronization in the deterministic multistart.
    
    See Also:
    
    Constant Field Values
  - NLPPOSTSOLVE
```
static final int NLPPOSTSOLVE
```
    This control determines whether postsolving should be performed automatically
    
    See Also:
    
    Constant Field Values
  - NLPDETERMINISTIC
```
static final int NLPDETERMINISTIC
```
    Determines if the parallel features of SLP should be guaranteed to be deterministic
    
    See Also:
    
    Constant Field Values
  - NLPPRESOLVELEVEL
```
static final int NLPPRESOLVELEVEL
```
    This control determines the level of changes presolve may carry out on the problem and whether column/row indices may change
    
    See Also:
    
    Constant Field Values
  - NLPPROBING
```
static final int NLPPROBING
```
    This control determines whether probing on a subset of variables should be performed prior to starting the main algorithm. Probing runs bound reduction multiple times in order to further tighten the bounding box.
    
    See Also:
    
    Constant Field Values
  - NLPCALCTHREADS
```
static final int NLPCALCTHREADS
```
    Number of threads used for formula and derivatives evaluations
    
    See Also:
    
    Constant Field Values
  - NLPTHREADS
```
static final int NLPTHREADS
```
    Default number of threads to be used
    
    See Also:
    
    Constant Field Values
  - NLPFINDIV
```
static final int NLPFINDIV
```
    Option for running a heuristic to find a feasible initial point
    
    See Also:
    
    Constant Field Values
  - NLPLINQUADBR
```
static final int NLPLINQUADBR
```
    Use linear and quadratic constraints and objective function to further reduce bounds on all variables
    
    See Also:
    
    Constant Field Values
  - NLPSOLVER
```
static final int NLPSOLVER
```
    Controls whether to call FICO Xpress Global or one of the local solvers
    Examples using controls().setNLPSolver:
    
    Boxes02.java
    
    Glidert.java
    
    PolygonMap.java
    
    PolygonMapDelta.java
    
    PolygonObjects.java
    
    PolygonVecMap.java
    
    PolygonVecMapDelta.java
    See Also:
    
    Constant Field Values
  - SLPALGORITHM
```
static final int SLPALGORITHM
```
    Bit map describing the SLP algorithm(s) to be used
    
    See Also:
    
    Constant Field Values
  - SLPAUGMENTATION
```
static final int SLPAUGMENTATION
```
    Bit map describing the SLP augmentation method(s) to be used
    
    See Also:
    
    Constant Field Values
  - SLPBARLIMIT
```
static final int SLPBARLIMIT
```
    Number of initial SLP iterations using the barrier method
    
    See Also:
    
    Constant Field Values
  - SLPCASCADE
```
static final int SLPCASCADE
```
    Bit map describing the cascading to be used
    
    See Also:
    
    Constant Field Values
  - SLPCASCADENLIMIT
```
static final int SLPCASCADENLIMIT
```
    Maximum number of iterations for cascading with non-linear determining rows
    
    See Also:
    
    Constant Field Values
  - SLPDAMPSTART
```
static final int SLPDAMPSTART
```
    SLP iteration at which damping is activated
    
    See Also:
    
    Constant Field Values
  - SLPCUTSTRATEGY
```
static final int SLPCUTSTRATEGY
```
    Determines which cuts to apply in the MISLP search when the default SLP-in-MIP strategy is used.
    
    See Also:
    
    Constant Field Values
  - SLPDELTAZLIMIT
```
static final int SLPDELTAZLIMIT
```
    Number of SLP iterations during which to apply XPRS_SLPDELTA_Z
    
    See Also:
    
    Constant Field Values
  - SLPINFEASLIMIT
```
static final int SLPINFEASLIMIT
```
    The maximum number of consecutive infeasible or unbounded SLP iterations which can occur before Xpress-SLP terminates
    
    See Also:
    
    Constant Field Values
  - SLPITERLIMIT
```
static final int SLPITERLIMIT
```
    The maximum number of SLP iterations
    
    See Also:
    
    Constant Field Values
  - SLPSAMECOUNT
```
static final int SLPSAMECOUNT
```
    Number of steps reaching the step bound in the same direction before step bounds are increased
    
    See Also:
    
    Constant Field Values
  - SLPSAMEDAMP
```
static final int SLPSAMEDAMP
```
    Number of steps in same direction before damping factor is increased
    
    See Also:
    
    Constant Field Values
  - SLPSBSTART
```
static final int SLPSBSTART
```
    SLP iteration after which step bounds are first applied
    
    See Also:
    
    Constant Field Values
  - SLPXCOUNT
```
static final int SLPXCOUNT
```
    Number of SLP iterations over which to measure static objective (1) convergence
    
    See Also:
    
    Constant Field Values
  - SLPXLIMIT
```
static final int SLPXLIMIT
```
    Number of SLP iterations up to which static objective (1) convergence testing is performed
    
    See Also:
    
    Constant Field Values
  - SLPDELAYUPDATEROWS
```
static final int SLPDELAYUPDATEROWS
```
    Number of SLP iterations before update rows are fully activated
    
    See Also:
    
    Constant Field Values
  - SLPAUTOSAVE
```
static final int SLPAUTOSAVE
```
    Frequency with which to save the model
    
    See Also:
    
    Constant Field Values
  - SLPANALYZE
```
static final int SLPANALYZE
```
    Bit map activating additional options supporting model / solution path analysis
    
    See Also:
    
    Constant Field Values
  - SLPOCOUNT
```
static final int SLPOCOUNT
```
    Number of SLP iterations over which to measure objective function variation for static objective (2) convergence criterion
    
    See Also:
    
    Constant Field Values
  - SLPMIPALGORITHM
```
static final int SLPMIPALGORITHM
```
    Bitmap describing the MISLP algorithms to be used
    
    See Also:
    
    Constant Field Values
  - SLPMIPRELAXSTEPBOUNDS
```
static final int SLPMIPRELAXSTEPBOUNDS
```
    Bitmap describing the step-bound relaxation strategy during MISLP
    
    See Also:
    
    Constant Field Values
  - SLPMIPFIXSTEPBOUNDS
```
static final int SLPMIPFIXSTEPBOUNDS
```
    Bitmap describing the step-bound fixing strategy during MISLP
    
    See Also:
    
    Constant Field Values
  - SLPMIPITERLIMIT
```
static final int SLPMIPITERLIMIT
```
    Maximum number of SLP iterations at each node
    
    See Also:
    
    Constant Field Values
  - SLPMIPCUTOFFLIMIT
```
static final int SLPMIPCUTOFFLIMIT
```
    Number of SLP iterations to check when considering a node for cutting off
    
    See Also:
    
    Constant Field Values
  - SLPMIPOCOUNT
```
static final int SLPMIPOCOUNT
```
    Number of SLP iterations at each node over which to measure objective function variation
    
    See Also:
    
    Constant Field Values
  - SLPMIPDEFAULTALGORITHM
```
static final int SLPMIPDEFAULTALGORITHM
```
    Default algorithm to be used during the tree search in MISLP
    
    See Also:
    
    Constant Field Values
  - SLPMIPLOG
```
static final int SLPMIPLOG
```
    Frequency with which MIP status is printed
    
    See Also:
    
    Constant Field Values
  - SLPDELTAOFFSET
```
static final int SLPDELTAOFFSET
```
    Position of first character of SLP variable name used to create name of delta vector
    
    See Also:
    
    Constant Field Values
  - SLPUPDATEOFFSET
```
static final int SLPUPDATEOFFSET
```
    Position of first character of SLP variable name used to create name of SLP update row
    
    See Also:
    
    Constant Field Values
  - SLPERROROFFSET
```
static final int SLPERROROFFSET
```
    Position of first character of constraint name used to create name of penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPSBROWOFFSET
```
static final int SLPSBROWOFFSET
```
    Position of first character of SLP variable name used to create name of SLP lower and upper step bound rows
    
    See Also:
    
    Constant Field Values
  - SLPVCOUNT
```
static final int SLPVCOUNT
```
    Number of SLP iterations over which to measure static objective (3) convergence
    
    See Also:
    
    Constant Field Values
  - SLPVLIMIT
```
static final int SLPVLIMIT
```
    Number of SLP iterations after which static objective (3) convergence testing starts
    
    See Also:
    
    Constant Field Values
  - SLPSCALE
```
static final int SLPSCALE
```
    When to re-scale the SLP problem
    
    See Also:
    
    Constant Field Values
  - SLPSCALECOUNT
```
static final int SLPSCALECOUNT
```
    Iteration limit used in determining when to re-scale the SLP matrix
    
    See Also:
    
    Constant Field Values
  - SLPECFCHECK
```
static final int SLPECFCHECK
```
    Check feasibility at the point of linearization for extended convergence criteria
    
    See Also:
    
    Constant Field Values
  - SLPMIPCUTOFFCOUNT
```
static final int SLPMIPCUTOFFCOUNT
```
    Number of SLP iterations to check when considering a node for cutting off
    
    See Also:
    
    Constant Field Values
  - SLPWCOUNT
```
static final int SLPWCOUNT
```
    Number of SLP iterations over which to measure the objective for the extended convergence continuation criterion
    
    See Also:
    
    Constant Field Values
  - SLPUNFINISHEDLIMIT
```
static final int SLPUNFINISHEDLIMIT
```
    The number of consecutive SLP iterations that may have an unfinished status before the solve is terminated.
    
    See Also:
    
    Constant Field Values
  - SLPCONVERGENCEOPS
```
static final int SLPCONVERGENCEOPS
```
    Bit map describing which convergence tests should be carried out
    
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERION
```
static final int SLPZEROCRITERION
```
    Bitmap determining the behavior of the placeholder deletion procedure
    
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERIONSTART
```
static final int SLPZEROCRITERIONSTART
```
    SLP iteration at which criteria for deletion of placeholder entries are first activated.
    
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERIONCOUNT
```
static final int SLPZEROCRITERIONCOUNT
```
    Number of consecutive times a placeholder entry is zero before being considered for deletion
    
    See Also:
    
    Constant Field Values
  - SLPLSPATTERNLIMIT
```
static final int SLPLSPATTERNLIMIT
```
    Number of iterations in the pattern search preceding the line search
    
    See Also:
    
    Constant Field Values
  - SLPLSITERLIMIT
```
static final int SLPLSITERLIMIT
```
    Number of iterations in the line search
    
    See Also:
    
    Constant Field Values
  - SLPLSSTART
```
static final int SLPLSSTART
```
    Iteration in which to active the line search
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYINFOSTART
```
static final int SLPPENALTYINFOSTART
```
    Iteration from which to record row penalty information
    
    See Also:
    
    Constant Field Values
  - SLPFILTER
```
static final int SLPFILTER
```
    Bit map for controlling solution updates
    
    See Also:
    
    Constant Field Values
  - SLPTRACEMASKOPS
```
static final int SLPTRACEMASKOPS
```
    Controls the information printed for SLPTRACEMASK. The order in which the information is printed is determined by the order of bits in SLPTRACEMASKOPS.
    
    See Also:
    
    Constant Field Values
  - SLPLSZEROLIMIT
```
static final int SLPLSZEROLIMIT
```
    Maximum number of zero length line search steps before line search is deactivated
    
    See Also:
    
    Constant Field Values
  - SLPHEURSTRATEGY
```
static final int SLPHEURSTRATEGY
```
    Branch and Bound: This specifies the MINLP 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
  - SLPBARCROSSOVERSTART
```
static final int SLPBARCROSSOVERSTART
```
    Default crossover activation behaviour for barrier start
    
    See Also:
    
    Constant Field Values
  - SLPBARSTALLINGLIMIT
```
static final int SLPBARSTALLINGLIMIT
```
    Number of iterations to allow numerical failures in barrier before switching to dual
    
    See Also:
    
    Constant Field Values
  - SLPBARSTALLINGOBJLIMIT
```
static final int SLPBARSTALLINGOBJLIMIT
```
    Number of iterations over which to measure the objective change for barrier iterations with no crossover
    
    See Also:
    
    Constant Field Values
  - SLPBARSTARTOPS
```
static final int SLPBARSTARTOPS
```
    Controls behaviour when the barrier is used to solve the linearizations
    
    See Also:
    
    Constant Field Values
  - SLPGRIDHEURSELECT
```
static final int SLPGRIDHEURSELECT
```
    Bit map selecting which heuristics to run if the problem has a variable with an integer delta
    
    See Also:
    
    Constant Field Values
  - SLPSTEPBOUNDING
```
static final int SLPSTEPBOUNDING
```
    Selects the step bounding strategy used by SLP
    
    See Also:
    
    Constant Field Values
  - SLPRETURNSOLUTION
```
static final int SLPRETURNSOLUTION
```
    Selects whether XPRSgetsolution returns the final converged iterate or the best merit-function iterate
    
    See Also:
    
    Constant Field Values
  - SLPMISLPALGORITHM
```
static final int SLPMISLPALGORITHM
```
    Selects the MISLP strategy used to combine SLP with the branch-and-bound search
    
    See Also:
    
    Constant Field Values
  - NLPINFINITY
```
static final int NLPINFINITY
```
    Value returned by a divide-by-zero in a formula
    
    See Also:
    
    Constant Field Values
  - NLPZERO
```
static final int NLPZERO
```
    Absolute tolerance
    
    See Also:
    
    Constant Field Values
  - NLPDEFAULTIV
```
static final int NLPDEFAULTIV
```
    Default initial value for an SLP variable if none is explicitly given
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONTOL_A
```
static final int NLPVALIDATIONTOL_A
```
    Absolute tolerance for the XSLPvalidate procedure
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONTOL_R
```
static final int NLPVALIDATIONTOL_R
```
    Relative tolerance for the XSLPvalidate procedure
    
    See Also:
    
    Constant Field Values
  - NLPPRIMALINTEGRALREF
```
static final int NLPPRIMALINTEGRALREF
```
    Reference solution value to take into account when calculating the primal integral
    
    See Also:
    
    Constant Field Values
  - NLPPRIMALINTEGRALALPHA
```
static final int NLPPRIMALINTEGRALALPHA
```
    Decay term for primal integral computation
    
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEZERO
```
static final int NLPPRESOLVEZERO
```
    Minimum absolute value for a variable which is identified as nonzero during SLP presolve
    
    See Also:
    
    Constant Field Values
  - NLPMERITLAMBDA
```
static final int NLPMERITLAMBDA
```
    Factor by which the net objective is taken into account in the merit function
    
    See Also:
    
    Constant Field Values
  - MSMAXBOUNDRANGE
```
static final int MSMAXBOUNDRANGE
```
    Defines the maximum range inside which initial points are generated by multistart presets
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONTOL_K
```
static final int NLPVALIDATIONTOL_K
```
    Relative tolerance for the XSLPvalidatekkt procedure
    
    See Also:
    
    Constant Field Values
  - NLPPRESOLVE_ELIMTOL
```
static final int NLPPRESOLVE_ELIMTOL
```
    Tolerance for nonlinear eliminations during SLP presolve
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONTARGET_R
```
static final int NLPVALIDATIONTARGET_R
```
    Feasibility target tolerance
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONTARGET_K
```
static final int NLPVALIDATIONTARGET_K
```
    Optimality target tolerance
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONFACTOR
```
static final int NLPVALIDATIONFACTOR
```
    Minimum improvement in validation targets to continue iterating
    
    See Also:
    
    Constant Field Values
  - SLPDAMP
```
static final int SLPDAMP
```
    Damping factor for updating values of variables
    
    See Also:
    
    Constant Field Values
  - SLPDAMPEXPAND
```
static final int SLPDAMPEXPAND
```
    Multiplier to increase damping factor during dynamic damping
    
    See Also:
    
    Constant Field Values
  - SLPDAMPSHRINK
```
static final int SLPDAMPSHRINK
```
    Multiplier to decrease damping factor during dynamic damping
    
    See Also:
    
    Constant Field Values
  - SLPDELTA_A
```
static final int SLPDELTA_A
```
    Absolute perturbation of values for calculating numerical derivatives
    
    See Also:
    
    Constant Field Values
  - SLPDELTA_R
```
static final int SLPDELTA_R
```
    Relative perturbation of values for calculating numerical derivatives
    
    See Also:
    
    Constant Field Values
  - SLPDELTA_Z
```
static final int SLPDELTA_Z
```
    Tolerance used when calculating derivatives
    
    See Also:
    
    Constant Field Values
  - SLPDELTACOST
```
static final int SLPDELTACOST
```
    Initial penalty cost multiplier for penalty delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPDELTAMAXCOST
```
static final int SLPDELTAMAXCOST
```
    Maximum penalty cost multiplier for penalty delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPDJTOL
```
static final int SLPDJTOL
```
    Tolerance on DJ value for determining if a variable is at its step bound
    
    See Also:
    
    Constant Field Values
  - SLPERRORCOST
```
static final int SLPERRORCOST
```
    Initial penalty cost multiplier for penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPERRORMAXCOST
```
static final int SLPERRORMAXCOST
```
    Maximum penalty cost multiplier for penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPERRORTOL_A
```
static final int SLPERRORTOL_A
```
    Absolute tolerance for error vectors
    
    See Also:
    
    Constant Field Values
  - SLPEXPAND
```
static final int SLPEXPAND
```
    Multiplier to increase a step bound
    
    See Also:
    
    Constant Field Values
  - SLPMAXWEIGHT
```
static final int SLPMAXWEIGHT
```
    Maximum penalty weight for delta or error vectors
    
    See Also:
    
    Constant Field Values
  - SLPMINWEIGHT
```
static final int SLPMINWEIGHT
```
    Minimum penalty weight for delta or error vectors
    
    See Also:
    
    Constant Field Values
  - SLPSHRINK
```
static final int SLPSHRINK
```
    Multiplier to reduce a step bound
    
    See Also:
    
    Constant Field Values
  - SLPCTOL
```
static final int SLPCTOL
```
    Closure convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPATOL_A
```
static final int SLPATOL_A
```
    Absolute delta convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPATOL_R
```
static final int SLPATOL_R
```
    Relative delta convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPMTOL_A
```
static final int SLPMTOL_A
```
    Absolute effective matrix element convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPMTOL_R
```
static final int SLPMTOL_R
```
    Relative effective matrix element convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPITOL_A
```
static final int SLPITOL_A
```
    Absolute impact convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPITOL_R
```
static final int SLPITOL_R
```
    Relative impact convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPSTOL_A
```
static final int SLPSTOL_A
```
    Absolute slack convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPSTOL_R
```
static final int SLPSTOL_R
```
    Relative slack convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPMVTOL
```
static final int SLPMVTOL
```
    Marginal value tolerance for determining if a constraint is slack
    
    See Also:
    
    Constant Field Values
  - SLPXTOL_A
```
static final int SLPXTOL_A
```
    Absolute static objective function (1) tolerance
    
    See Also:
    
    Constant Field Values
  - SLPXTOL_R
```
static final int SLPXTOL_R
```
    Relative static objective function (1) tolerance
    
    See Also:
    
    Constant Field Values
  - SLPDEFAULTSTEPBOUND
```
static final int SLPDEFAULTSTEPBOUND
```
    Minimum initial value for the step bound of an SLP variable if none is explicitly given
    
    See Also:
    
    Constant Field Values
  - SLPDAMPMAX
```
static final int SLPDAMPMAX
```
    Maximum value for the damping factor of a variable during dynamic damping
    
    See Also:
    
    Constant Field Values
  - SLPDAMPMIN
```
static final int SLPDAMPMIN
```
    Minimum value for the damping factor of a variable during dynamic damping
    
    See Also:
    
    Constant Field Values
  - SLPDELTACOSTFACTOR
```
static final int SLPDELTACOSTFACTOR
```
    Factor for increasing cost multiplier on total penalty delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPERRORCOSTFACTOR
```
static final int SLPERRORCOSTFACTOR
```
    Factor for increasing cost multiplier on total penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPERRORTOL_P
```
static final int SLPERRORTOL_P
```
    Absolute tolerance for printing error vectors
    
    See Also:
    
    Constant Field Values
  - SLPCASCADETOL_PA
```
static final int SLPCASCADETOL_PA
```
    Absolute cascading print tolerance
    
    See Also:
    
    Constant Field Values
  - SLPCASCADETOL_PR
```
static final int SLPCASCADETOL_PR
```
    Relative cascading print tolerance
    
    See Also:
    
    Constant Field Values
  - SLPOTOL_A
```
static final int SLPOTOL_A
```
    Absolute static objective (2) convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPOTOL_R
```
static final int SLPOTOL_R
```
    Relative static objective (2) convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPDELTA_X
```
static final int SLPDELTA_X
```
    Minimum absolute value of delta coefficients to be retained
    
    See Also:
    
    Constant Field Values
  - SLPGRANULARITY
```
static final int SLPGRANULARITY
```
    Base for calculating penalty costs
    
    See Also:
    
    Constant Field Values
  - SLPMIPCUTOFF_A
```
static final int SLPMIPCUTOFF_A
```
    Absolute objective function cutoff for MIP termination
    
    See Also:
    
    Constant Field Values
  - SLPMIPCUTOFF_R
```
static final int SLPMIPCUTOFF_R
```
    Relative objective function cutoff for MIP termination
    
    See Also:
    
    Constant Field Values
  - SLPMIPOTOL_A
```
static final int SLPMIPOTOL_A
```
    Absolute objective function tolerance for MIP termination
    
    See Also:
    
    Constant Field Values
  - SLPMIPOTOL_R
```
static final int SLPMIPOTOL_R
```
    Relative objective function tolerance for MIP termination
    
    See Also:
    
    Constant Field Values
  - SLPESCALATION
```
static final int SLPESCALATION
```
    Factor for increasing cost multiplier on individual penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPOBJTOPENALTYCOST
```
static final int SLPOBJTOPENALTYCOST
```
    Factor to estimate initial penalty costs from objective function
    
    See Also:
    
    Constant Field Values
  - SLPSHRINKBIAS
```
static final int SLPSHRINKBIAS
```
    Defines an overwrite / adjustment of step bounds for improving iterations
    
    See Also:
    
    Constant Field Values
  - SLPFEASTOLTARGET
```
static final int SLPFEASTOLTARGET
```
    When set, this defines a target feasibility tolerance to which the linearizations are solved to
    
    See Also:
    
    Constant Field Values
  - SLPOPTIMALITYTOLTARGET
```
static final int SLPOPTIMALITYTOLTARGET
```
    When set, this defines a target optimality tolerance to which the linearizations are solved to
    
    See Also:
    
    Constant Field Values
  - SLPDELTA_INFINITY
```
static final int SLPDELTA_INFINITY
```
    Maximum value for partial derivatives
    
    See Also:
    
    Constant Field Values
  - SLPVTOL_A
```
static final int SLPVTOL_A
```
    Absolute static objective (3) convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPVTOL_R
```
static final int SLPVTOL_R
```
    Relative static objective (3) convergence tolerance
    
    See Also:
    
    Constant Field Values
  - SLPETOL_A
```
static final int SLPETOL_A
```
    Absolute tolerance on penalty vectors
    
    See Also:
    
    Constant Field Values
  - SLPETOL_R
```
static final int SLPETOL_R
```
    Relative tolerance on penalty vectors
    
    See Also:
    
    Constant Field Values
  - SLPEVTOL_A
```
static final int SLPEVTOL_A
```
    Absolute tolerance on total penalty costs
    
    See Also:
    
    Constant Field Values
  - SLPEVTOL_R
```
static final int SLPEVTOL_R
```
    Relative tolerance on total penalty costs
    
    See Also:
    
    Constant Field Values
  - SLPDELTA_ZERO
```
static final int SLPDELTA_ZERO
```
    Absolute zero acceptance tolerance used when calculating derivatives
    
    See Also:
    
    Constant Field Values
  - SLPMINSBFACTOR
```
static final int SLPMINSBFACTOR
```
    Factor by which step bounds can be decreased beneath SLPATOL_A
    
    See Also:
    
    Constant Field Values
  - SLPCLAMPVALIDATIONTOL_A
```
static final int SLPCLAMPVALIDATIONTOL_A
```
    Absolute validation tolerance for applying SLPCLAMPSHRINK
    
    See Also:
    
    Constant Field Values
  - SLPCLAMPVALIDATIONTOL_R
```
static final int SLPCLAMPVALIDATIONTOL_R
```
    Relative validation tolerance for applying SLPCLAMPSHRINK
    
    See Also:
    
    Constant Field Values
  - SLPCLAMPSHRINK
```
static final int SLPCLAMPSHRINK
```
    Shrink ratio used to impose strict convergence on variables converged in extended criteria only
    
    See Also:
    
    Constant Field Values
  - SLPECFTOL_A
```
static final int SLPECFTOL_A
```
    Absolute tolerance on testing feasibility at the point of linearization
    
    See Also:
    
    Constant Field Values
  - SLPECFTOL_R
```
static final int SLPECFTOL_R
```
    Relative tolerance on testing feasibility at the point of linearization
    
    See Also:
    
    Constant Field Values
  - SLPWTOL_A
```
static final int SLPWTOL_A
```
    Absolute extended convergence continuation tolerance
    
    See Also:
    
    Constant Field Values
  - SLPWTOL_R
```
static final int SLPWTOL_R
```
    Relative extended convergence continuation tolerance
    
    See Also:
    
    Constant Field Values
  - SLPMATRIXTOL
```
static final int SLPMATRIXTOL
```
    Nonzero tolerance for dropping coefficients from the linearization.
    
    See Also:
    
    Constant Field Values
  - SLPDRFIXRANGE
```
static final int SLPDRFIXRANGE
```
    The range around the previous value where variables are fixed in cascading if the determining column is below SLPDRCOLTOL.
    
    See Also:
    
    Constant Field Values
  - SLPDRCOLTOL
```
static final int SLPDRCOLTOL
```
    The minimum absolute magnitude of a determining column, for which the determined variable is still regarded as well defined
    
    See Also:
    
    Constant Field Values
  - SLPMIPERRORTOL_A
```
static final int SLPMIPERRORTOL_A
```
    Absolute penalty error cost tolerance for MIP cut-off
    
    See Also:
    
    Constant Field Values
  - SLPMIPERRORTOL_R
```
static final int SLPMIPERRORTOL_R
```
    Relative penalty error cost tolerance for MIP cut-off
    
    See Also:
    
    Constant Field Values
  - SLPCDTOL_A
```
static final int SLPCDTOL_A
```
    Absolute tolerance for deducing constant derivatives
    
    See Also:
    
    Constant Field Values
  - SLPCDTOL_R
```
static final int SLPCDTOL_R
```
    Relative tolerance for deducing constant derivatives
    
    See Also:
    
    Constant Field Values
  - SLPENFORCEMAXCOST
```
static final int SLPENFORCEMAXCOST
```
    Maximum penalty cost in the objective before enforcing most violating rows
    
    See Also:
    
    Constant Field Values
  - SLPENFORCECOSTSHRINK
```
static final int SLPENFORCECOSTSHRINK
```
    Factor by which to decrease the current penalty multiplier when enforcing rows.
    
    See Also:
    
    Constant Field Values
  - SLPDRCOLDJTOL
```
static final int SLPDRCOLDJTOL
```
    Reduced cost tolerance on the delta variable when fixing due to the determining column being below SLPDRCOLTOL.
    
    See Also:
    
    Constant Field Values
  - SLPBARSTALLINGTOL
```
static final int SLPBARSTALLINGTOL
```
    Required change in the objective when progress is measured in barrier iterations without crossover
    
    See Also:
    
    Constant Field Values
  - SLPOBJTHRESHOLD
```
static final int SLPOBJTHRESHOLD
```
    Assumed maximum value of the objective function in absolute value.
    
    See Also:
    
    Constant Field Values
  - SLPBOUNDTHRESHOLD
```
static final int SLPBOUNDTHRESHOLD
```
    The maximum size of a bound that can be introduced by nonlinear presolve.
    
    See Also:
    
    Constant Field Values
  - NLPORIGINALROWS
```
static final int NLPORIGINALROWS
```
    Number of model rows in the extended original problem
    
    See Also:
    
    Constant Field Values
  - NLPORIGINALCOLS
```
static final int NLPORIGINALCOLS
```
    Number of model columns in the extended original problem
    
    See Also:
    
    Constant Field Values
  - NLPUFS
```
static final int NLPUFS
```
    Number of user functions
    
    See Also:
    
    Constant Field Values
  - NLPIFS
```
static final int NLPIFS
```
    Number of internal functions
    
    See Also:
    
    Constant Field Values
  - NLPEQUALSCOLUMN
```
static final int NLPEQUALSCOLUMN
```
    Index of the reserved "=" column
    
    See Also:
    
    Constant Field Values
  - NLPVARIABLES
```
static final int NLPVARIABLES
```
    Number of SLP variables
    
    See Also:
    
    Constant Field Values
  - NLPIMPLICITVARIABLES
```
static final int NLPIMPLICITVARIABLES
```
    Number of SLP variables appearing only in coefficients
    
    See Also:
    
    Constant Field Values
  - NONLINEARCONSTRAINTS
```
static final int NONLINEARCONSTRAINTS
```
    Number of nonlinear constraints in the problem
    
    See Also:
    
    Constant Field Values
  - NLPUSERFUNCCALLS
```
static final int NLPUSERFUNCCALLS
```
    Number of calls made to user functions
    
    See Also:
    
    Constant Field Values
  - NLPUSEDERIVATIVES
```
static final int NLPUSEDERIVATIVES
```
    Indicates whether numeric or analytic derivatives were used to create the linear approximations and solve the problem
    
    See Also:
    
    Constant Field Values
  - NLPKEEPBESTITER
```
static final int NLPKEEPBESTITER
```
    The iteration in which the returned solution has been found.
    
    See Also:
    
    Constant Field Values
  - NLPSTATUS
```
static final int NLPSTATUS
```
    The solution status of the problem.
    
    See Also:
    
    Constant Field Values
  - LOCALSOLVERSELECTED
```
static final int LOCALSOLVERSELECTED
```
    Includes information of which Xpress solver has been used to solve the problem
    
    See Also:
    
    Constant Field Values
  - NLPMODELROWS
```
static final int NLPMODELROWS
```
    Number of model rows in the problem
    
    See Also:
    
    Constant Field Values
  - NLPMODELCOLS
```
static final int NLPMODELCOLS
```
    Number of model columns in the problem
    
    See Also:
    
    Constant Field Values
  - NLPJOBID
```
static final int NLPJOBID
```
    Unique identifier for the current job
    
    See Also:
    
    Constant Field Values
  - NLPSTOPSTATUS
```
static final int NLPSTOPSTATUS
```
    Status of the optimization process.
    
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEELIMINATIONS
```
static final int NLPPRESOLVEELIMINATIONS
```
    Number of SLP variables eliminated by XSLPpresolve
    
    See Also:
    
    Constant Field Values
  - SLPITER
```
static final int SLPITER
```
    SLP iteration count
    
    See Also:
    
    Constant Field Values
  - SLPSTATUS
```
static final int SLPSTATUS
```
    Bitmap holding the problem convergence status
    
    See Also:
    
    Constant Field Values
  - SLPUNCONVERGED
```
static final int SLPUNCONVERGED
```
    Number of unconverged values
    
    See Also:
    
    Constant Field Values
  - SLPSBXCONVERGED
```
static final int SLPSBXCONVERGED
```
    Number of step-bounded variables converged only on extended criteria
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYDELTAROW
```
static final int SLPPENALTYDELTAROW
```
    Index of equality row holding the penalties for delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYDELTACOLUMN
```
static final int SLPPENALTYDELTACOLUMN
```
    Index of column costing the penalty delta row
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYERRORROW
```
static final int SLPPENALTYERRORROW
```
    Index of equality row holding the penalties for penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYERRORCOLUMN
```
static final int SLPPENALTYERRORCOLUMN
```
    Index of column costing the penalty error row
    
    See Also:
    
    Constant Field Values
  - SLPCOEFFICIENTS
```
static final int SLPCOEFFICIENTS
```
    Number of nonlinear coefficients
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYDELTAS
```
static final int SLPPENALTYDELTAS
```
    Number of penalty delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYERRORS
```
static final int SLPPENALTYERRORS
```
    Number of penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPPLUSPENALTYERRORS
```
static final int SLPPLUSPENALTYERRORS
```
    Number of positive penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPMINUSPENALTYERRORS
```
static final int SLPMINUSPENALTYERRORS
```
    Number of negative penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPUCCONSTRAINEDCOUNT
```
static final int SLPUCCONSTRAINEDCOUNT
```
    Number of unconverged variables with coefficients in constraining rows
    
    See Also:
    
    Constant Field Values
  - SLPMIPNODES
```
static final int SLPMIPNODES
```
    Number of nodes explored in SLP-in-MIP. This includes any nodes for which a non-linear solve has been carried out.
    
    See Also:
    
    Constant Field Values
  - SLPMIPITER
```
static final int SLPMIPITER
```
    Total number of SLP iterations in MISLP
    
    See Also:
    
    Constant Field Values
  - SLPTOLSETS
```
static final int SLPTOLSETS
```
    Number of tolerance sets.
    
    See Also:
    
    Constant Field Values
  - SLPECFCOUNT
```
static final int SLPECFCOUNT
```
    Number of infeasible constraints found at the point of linearization
    
    See Also:
    
    Constant Field Values
  - SLPDELTAS
```
static final int SLPDELTAS
```
    Number of delta vectors created during augmentation
    
    See Also:
    
    Constant Field Values
  - SLPZEROESRESET
```
static final int SLPZEROESRESET
```
    Number of placeholder entries set to zero
    
    See Also:
    
    Constant Field Values
  - SLPZEROESTOTAL
```
static final int SLPZEROESTOTAL
```
    Number of potential zero placeholder entries
    
    See Also:
    
    Constant Field Values
  - SLPZEROESRETAINED
```
static final int SLPZEROESRETAINED
```
    Number of potentially zero placeholders left untouched
    
    See Also:
    
    Constant Field Values
  - SLPNONCONSTANTCOEFFS
```
static final int SLPNONCONSTANTCOEFFS
```
    Number of coefficients in the augmented problem that might change between SLP iterations
    
    See Also:
    
    Constant Field Values
  - SLPMIPSOLS
```
static final int SLPMIPSOLS
```
    Number of integer solutions found in MISLP. This includes solutions found during the tree search or any heuristics.
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONINDEX_K
```
static final int NLPVALIDATIONINDEX_K
```
    Relative first order optimality validation index
    
    See Also:
    
    Constant Field Values
  - NLPOPTTIME
```
static final int NLPOPTTIME
```
    Time spent in optimization
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONINDEX_A
```
static final int NLPVALIDATIONINDEX_A
```
    Absolute validation index
    
    See Also:
    
    Constant Field Values
  - NLPVALIDATIONINDEX_R
```
static final int NLPVALIDATIONINDEX_R
```
    Relative validation index
    
    See Also:
    
    Constant Field Values
  - NLPOBJVAL
```
static final int NLPOBJVAL
```
    Objective function value excluding any penalty costs
    
    See Also:
    
    Constant Field Values
  - SLPCURRENTDELTACOST
```
static final int SLPCURRENTDELTACOST
```
    Current value of penalty cost multiplier for penalty delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPCURRENTERRORCOST
```
static final int SLPCURRENTERRORCOST
```
    Current value of penalty cost multiplier for penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYERRORTOTAL
```
static final int SLPPENALTYERRORTOTAL
```
    Total activity of penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYERRORVALUE
```
static final int SLPPENALTYERRORVALUE
```
    Total penalty cost attributed to penalty error vectors
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYDELTATOTAL
```
static final int SLPPENALTYDELTATOTAL
```
    Total activity of penalty delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPPENALTYDELTAVALUE
```
static final int SLPPENALTYDELTAVALUE
```
    Total penalty cost attributed to penalty delta vectors
    
    See Also:
    
    Constant Field Values
  - SLPERRORCOSTS
```
static final int SLPERRORCOSTS
```
    Total penalty costs in the solution
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_NEWPOINT
```
static final int KNITRO_PARAM_NEWPOINT
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_HONORBNDS
```
static final int KNITRO_PARAM_HONORBNDS
```
    Indicates whether or not to enforce satisfaction of simple variable bounds throughout the optimization.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_ALGORITHM
```
static final int KNITRO_PARAM_ALGORITHM
```
    Indicates which algorithm to use to solve nonlinear problems
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_MURULE
```
static final int KNITRO_PARAM_BAR_MURULE
```
    Indicates which strategy to use for modifying the barrier parameter mu in the barrier algorithms.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_FEASIBLE
```
static final int KNITRO_PARAM_BAR_FEASIBLE
```
    Specifies whether special emphasis is placed on getting and staying feasible in the interior-point algorithms.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_GRADOPT
```
static final int KNITRO_PARAM_GRADOPT
```
    Specifies how to compute the gradients of the objective and constraint functions.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_HESSOPT
```
static final int KNITRO_PARAM_HESSOPT
```
    Specifies how to compute the (approximate) Hessian of the Lagrangian.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_INITPT
```
static final int KNITRO_PARAM_BAR_INITPT
```
    Indicates whether an initial point strategy is used with barrier algorithms.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MAXCGIT
```
static final int KNITRO_PARAM_MAXCGIT
```
    Specifies the maximum number of conjugate gradient (CG) iterations Knitro is allowed to perform during one minor iteration.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MAXIT
```
static final int KNITRO_PARAM_MAXIT
```
    Specifies the maximum number of iterations before termination.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_OUTLEV
```
static final int KNITRO_PARAM_OUTLEV
```
    Controls the level of output produced by Knitro.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_SCALE
```
static final int KNITRO_PARAM_SCALE
```
    Performs a scaling of the objective and constraint functions based on their values at the initial point.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_SOC
```
static final int KNITRO_PARAM_SOC
```
    Specifies whether or not to try second order corrections (SOC).
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_DELTA
```
static final int KNITRO_PARAM_DELTA
```
    Specifies the initial trust region radius scaling factor used to determine the initial trust region size.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_FEASMODETOL
```
static final int KNITRO_PARAM_BAR_FEASMODETOL
```
    Specifies the tolerance in the equation that determines whether Knitro will force subsequent iterates to remain feasible.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_FEASTOL
```
static final int KNITRO_PARAM_FEASTOL
```
    Specifies the final relative stopping tolerance for the feasibility error.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_FEASTOLABS
```
static final int KNITRO_PARAM_FEASTOLABS
```
    Specifies the final absolute stopping tolerance for the feasibility error.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_INITMU
```
static final int KNITRO_PARAM_BAR_INITMU
```
    Specifies the initial value for the barrier parameter mu used with the barrier algorithms. This option has no effect on the Active Set algorithm.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_OBJRANGE
```
static final int KNITRO_PARAM_OBJRANGE
```
    Specifies the extreme limits of the objective function for purposes of determining unboundedness.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_OPTTOL
```
static final int KNITRO_PARAM_OPTTOL
```
    Specifies the final relative stopping tolerance for the KKT (optimality) error.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_OPTTOLABS
```
static final int KNITRO_PARAM_OPTTOLABS
```
    Specifies the final absolute stopping tolerance for the KKT (optimality) error.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_PIVOT
```
static final int KNITRO_PARAM_PIVOT
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_XTOL
```
static final int KNITRO_PARAM_XTOL
```
    The optimization process will terminate if the relative change in all components of the solution point estimate is less than KNITRO_PARAM_XTOL.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_DEBUG
```
static final int KNITRO_PARAM_DEBUG
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MULTISTART
```
static final int KNITRO_PARAM_MULTISTART
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MSMAXSOLVES
```
static final int KNITRO_PARAM_MSMAXSOLVES
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MSMAXBNDRANGE
```
static final int KNITRO_PARAM_MSMAXBNDRANGE
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_LMSIZE
```
static final int KNITRO_PARAM_LMSIZE
```
    Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_MAXCROSSIT
```
static final int KNITRO_PARAM_BAR_MAXCROSSIT
```
    Specifies the maximum number of crossover iterations before termination.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BLASOPTION
```
static final int KNITRO_PARAM_BLASOPTION
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_MAXREFACTOR
```
static final int KNITRO_PARAM_BAR_MAXREFACTOR
```
    Indicates the maximum number of refactorizations of the KKT system per iteration of the Interior/Direct algorithm before reverting to a CG step.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_MAXBACKTRACK
```
static final int KNITRO_PARAM_BAR_MAXBACKTRACK
```
    Indicates the maximum allowable number of backtracks during the linesearch of the Interior/Direct algorithm before reverting to a CG step.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_PENRULE
```
static final int KNITRO_PARAM_BAR_PENRULE
```
    Indicates which penalty parameter strategy to use for determining whether or not to accept a trial iterate.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_PENCONS
```
static final int KNITRO_PARAM_BAR_PENCONS
```
    Indicates whether a penalty approach is applied to the constraints.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MSNUMTOSAVE
```
static final int KNITRO_PARAM_MSNUMTOSAVE
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MSSAVETOL
```
static final int KNITRO_PARAM_MSSAVETOL
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MSTERMINATE
```
static final int KNITRO_PARAM_MSTERMINATE
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MSSTARTPTRANGE
```
static final int KNITRO_PARAM_MSSTARTPTRANGE
```
    Control of type Double.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_INFEASTOL
```
static final int KNITRO_PARAM_INFEASTOL
```
    Specifies the (relative) tolerance used for declaring infeasibility of a model.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_LINSOLVER
```
static final int KNITRO_PARAM_LINSOLVER
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_DIRECTINTERVAL
```
static final int KNITRO_PARAM_BAR_DIRECTINTERVAL
```
    Controls the maximum number of consecutive conjugate gradient (CG) steps before Knitro will try to enforce that a step is taken using direct linear algebra.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_PRESOLVE
```
static final int KNITRO_PARAM_PRESOLVE
```
    Determines whether or not to use the Knitro presolver to try to simplify the model by removing variables or constraints.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_PRESOLVE_TOL
```
static final int KNITRO_PARAM_PRESOLVE_TOL
```
    Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_SWITCHRULE
```
static final int KNITRO_PARAM_BAR_SWITCHRULE
```
    Indicates whether or not the barrier algorithms will allow switching from an optimality phase to a pure feasibility phase.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MA_TERMINATE
```
static final int KNITRO_PARAM_MA_TERMINATE
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MSSEED
```
static final int KNITRO_PARAM_MSSEED
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_BAR_RELAXCONS
```
static final int KNITRO_PARAM_BAR_RELAXCONS
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_NCVX_QCQP_INIT
```
static final int KNITRO_PARAM_NCVX_QCQP_INIT
```
    Specifies the initialization strategy used for non-convex QPs and QCQPs.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_SOLTYPE
```
static final int KNITRO_PARAM_SOLTYPE
```
    This option specifies the solution returned by Knitro. Generally, the solution converged to by Knitro is a locally optimal solution that corresponds to the best feasible solution found. However, on rare occasions, Knitro may encounter a feasible solution during the optimization process that has a better objective value than the final solution converged to by Knitro. Setting KNITRO_PARAM_SOLTYPE = 1 in this case will return this iterate.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_METHOD
```
static final int KNITRO_PARAM_MIP_METHOD
```
    Specifies which MIP method to use.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_BRANCHRULE
```
static final int KNITRO_PARAM_MIP_BRANCHRULE
```
    Specifies which branching rule to use for MIP branch and bound procedure.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_SELECTRULE
```
static final int KNITRO_PARAM_MIP_SELECTRULE
```
    Specifies the MIP select rule for choosing the next node in the branch and bound tree.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_INTGAPABS
```
static final int KNITRO_PARAM_MIP_INTGAPABS
```
    The absolute integrality gap stop tolerance for MIP.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_INTGAPREL
```
static final int KNITRO_PARAM_MIP_INTGAPREL
```
    The relative integrality gap stop tolerance for MIP.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_OUTLEVEL
```
static final int KNITRO_PARAM_MIP_OUTLEVEL
```
    Specifies how much MIP information to print.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_OUTINTERVAL
```
static final int KNITRO_PARAM_MIP_OUTINTERVAL
```
    Specifies node printing interval for KNITRO_PARAM_MIP_OUTLEVEL when KNITRO_PARAM_MIP_OUTLEVEL > 0.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_DEBUG
```
static final int KNITRO_PARAM_MIP_DEBUG
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_IMPLICATNS
```
static final int KNITRO_PARAM_MIP_IMPLICATNS
```
    Specifies whether or not to add constraints to the MIP derived from logical implications.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_GUB_BRANCH
```
static final int KNITRO_PARAM_MIP_GUB_BRANCH
```
    Specifies whether or not to branch on generalized upper bounds (GUBs).
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_KNAPSACK
```
static final int KNITRO_PARAM_MIP_KNAPSACK
```
    Specifies rules for adding MIP knapsack cuts.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_ROUNDING
```
static final int KNITRO_PARAM_MIP_ROUNDING
```
    Specifies the MIP rounding rule to apply.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_ROOTALG
```
static final int KNITRO_PARAM_MIP_ROOTALG
```
    Specifies which algorithm to use for the root node solve in MIP (same options as KNITRO_PARAM_ALGORITHM user option).
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_LPALG
```
static final int KNITRO_PARAM_MIP_LPALG
```
    Specifies which algorithm to use for any linear programming (LP) subproblem solves that may occur in the MIP branch and bound procedure.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_MAXNODES
```
static final int KNITRO_PARAM_MIP_MAXNODES
```
    Specifies the maximum number of nodes explored.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_HEURISTIC
```
static final int KNITRO_PARAM_MIP_HEURISTIC
```
    Specifies which MIP heuristic search approach to apply to try to find an initial integer feasible point.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_HEUR_MAXIT
```
static final int KNITRO_PARAM_MIP_HEUR_MAXIT
```
    Specifies the maximum number of iterations to allow for MIP heuristic, if one is enabled.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_PSEUDOINIT
```
static final int KNITRO_PARAM_MIP_PSEUDOINIT
```
    Specifies the method used to initialize pseudo-costs corresponding to variables that have not yet been branched on in the MIP method.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_STRONG_MAXIT
```
static final int KNITRO_PARAM_MIP_STRONG_MAXIT
```
    Specifies the maximum number of iterations to allow for MIP strong branching solves.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_STRONG_CANDLIM
```
static final int KNITRO_PARAM_MIP_STRONG_CANDLIM
```
    Specifies the maximum number of candidates to explore for MIP strong branching.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_MIP_STRONG_LEVEL
```
static final int KNITRO_PARAM_MIP_STRONG_LEVEL
```
    Specifies the maximum number of tree levels on which to perform MIP strong branching.
    
    See Also:
    
    Constant Field Values
  - KNITRO_PARAM_PAR_NUMTHREADS
```
static final int KNITRO_PARAM_PAR_NUMTHREADS
```
    Control of type Integer.
    
    See Also:
    
    Constant Field Values
  - SOLSTATUS_NOTFOUND
```
static final int SOLSTATUS_NOTFOUND
```
    Constant used in enumeration 'SOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLSTATUS_OPTIMAL
```
static final int SOLSTATUS_OPTIMAL
```
    Constant used in enumeration 'SOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLSTATUS_FEASIBLE
```
static final int SOLSTATUS_FEASIBLE
```
    Constant used in enumeration 'SOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLSTATUS_INFEASIBLE
```
static final int SOLSTATUS_INFEASIBLE
```
    Constant used in enumeration 'SOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLSTATUS_UNBOUNDED
```
static final int SOLSTATUS_UNBOUNDED
```
    Constant used in enumeration 'SOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLVESTATUS_UNSTARTED
```
static final int SOLVESTATUS_UNSTARTED
```
    Constant used in enumeration 'SOLVESTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLVESTATUS_STOPPED
```
static final int SOLVESTATUS_STOPPED
```
    Constant used in enumeration 'SOLVESTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLVESTATUS_FAILED
```
static final int SOLVESTATUS_FAILED
```
    Constant used in enumeration 'SOLVESTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLVESTATUS_COMPLETED
```
static final int SOLVESTATUS_COMPLETED
```
    Constant used in enumeration 'SOLVESTATUS'
    
    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
  - IIS_UNSTARTED
```
static final int IIS_UNSTARTED
```
    Constant used in enumeration 'IISSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - IIS_FEASIBLE
```
static final int IIS_FEASIBLE
```
    Constant used in enumeration 'IISSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - IIS_COMPLETED
```
static final int IIS_COMPLETED
```
    Constant used in enumeration 'IISSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - IIS_UNFINISHED
```
static final int IIS_UNFINISHED
```
    Constant used in enumeration 'IISSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - SOLAVAILABLE_NOTFOUND
```
static final int SOLAVAILABLE_NOTFOUND
```
    Constant used in enumeration 'SOLAVAILABLE'
    
    See Also:
    
    Constant Field Values
  - SOLAVAILABLE_OPTIMAL
```
static final int SOLAVAILABLE_OPTIMAL
```
    Constant used in enumeration 'SOLAVAILABLE'
    
    See Also:
    
    Constant Field Values
  - SOLAVAILABLE_FEASIBLE
```
static final int SOLAVAILABLE_FEASIBLE
```
    Constant used in enumeration 'SOLAVAILABLE'
    
    See Also:
    
    Constant Field Values
  - OPTIMIZETYPE_NONE
```
static final int OPTIMIZETYPE_NONE
```
    Constant used in enumeration 'OPTIMIZETYPE'
    
    See Also:
    
    Constant Field Values
  - OPTIMIZETYPE_LP
```
static final int OPTIMIZETYPE_LP
```
    Constant used in enumeration 'OPTIMIZETYPE'
    
    See Also:
    
    Constant Field Values
  - OPTIMIZETYPE_MIP
```
static final int OPTIMIZETYPE_MIP
```
    Constant used in enumeration 'OPTIMIZETYPE'
    
    See Also:
    
    Constant Field Values
  - OPTIMIZETYPE_LOCAL
```
static final int OPTIMIZETYPE_LOCAL
```
    Constant used in enumeration 'OPTIMIZETYPE'
    
    See Also:
    
    Constant Field Values
  - OPTIMIZETYPE_GLOBAL
```
static final int OPTIMIZETYPE_GLOBAL
```
    Constant used in enumeration 'OPTIMIZETYPE'
    
    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_GENERICERROR
```
static final int STOP_GENERICERROR
```
    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_SOLVECOMPLETE
```
static final int STOP_SOLVECOMPLETE
```
    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
  - STOP_NUMERICALERROR
```
static final int STOP_NUMERICALERROR
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_WORKLIMIT
```
static final int STOP_WORKLIMIT
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_NEXTOBJECTIVE
```
static final int STOP_NEXTOBJECTIVE
```
    Constant used in enumeration 'enum_stop_type'
    
    See Also:
    
    Constant Field Values
  - STOP_MIPSTAGE
```
static final int STOP_MIPSTAGE
```
    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_AUTOMATIC
```
static final int BACKTRACKALG_AUTOMATIC
```
    Constant used in enumeration 'BACKTRACKALG'
    
    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
  - BACKTRACKALG_DEEPEST_BEST_BOUND
```
static final int BACKTRACKALG_DEEPEST_BEST_BOUND
```
    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
  - BRANCH_INC_SOL_FIRST
```
static final int BRANCH_INC_SOL_FIRST
```
    Constant used in enumeration 'BRANCHCHOICE'
    
    See Also:
    
    Constant Field Values
  - BRANCH_ROOTNODE_SOL_FARTHER
```
static final int BRANCH_ROOTNODE_SOL_FARTHER
```
    Constant used in enumeration 'BRANCHCHOICE'
    
    See Also:
    
    Constant Field Values
  - ALG_MANUAL_MATRIX_BLOCKING
```
static final int ALG_MANUAL_MATRIX_BLOCKING
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_SINGLE_PASS_BLOCKING
```
static final int ALG_SINGLE_PASS_BLOCKING
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_NONSEPARABLE_QP
```
static final int ALG_NONSEPARABLE_QP
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_MANUAL_CORRECTOR_WEIGHT
```
static final int ALG_MANUAL_CORRECTOR_WEIGHT
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_CORRECTOR_WEIGHT_ON
```
static final int ALG_CORRECTOR_WEIGHT_ON
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_MANUAL_REFINEMENT
```
static final int ALG_MANUAL_REFINEMENT
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_PCGM_REFINEMENT
```
static final int ALG_PCGM_REFINEMENT
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_QMR_REFINEMENT
```
static final int ALG_QMR_REFINEMENT
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_AUGMENTED_REFINEMENT
```
static final int ALG_AUGMENTED_REFINEMENT
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_MAX_ACCURACY_REFINEMENT
```
static final int ALG_MAX_ACCURACY_REFINEMENT
```
    Constant used in enumeration 'CHOLESKYALG'
    
    See Also:
    
    Constant Field Values
  - ALG_AUTOMATIC
```
static final int ALG_AUTOMATIC
```
    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
  - DUALGRADIENT_DIRECTSTEEPESTEDGE
```
static final int DUALGRADIENT_DIRECTSTEEPESTEDGE
```
    Constant used in enumeration 'DUALGRADIENT'
    
    See Also:
    
    Constant Field Values
  - DUALGRADIENT_SPARSEDEVEX
```
static final int DUALGRADIENT_SPARSEDEVEX
```
    Constant used in enumeration 'DUALGRADIENT'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_SWITCH_TO_PRIMAL
```
static final int DUALSTRATEGY_SWITCH_TO_PRIMAL
```
    Constant used in enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_STOP_SOLVE_WHEN_UNSTABLE
```
static final int DUALSTRATEGY_STOP_SOLVE_WHEN_UNSTABLE
```
    Constant used in enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_AGRESSIVE_CUTOFF
```
static final int DUALSTRATEGY_AGRESSIVE_CUTOFF
```
    Constant used in enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_USE_DUAL_FOR_UNSHIFT
```
static final int DUALSTRATEGY_USE_DUAL_FOR_UNSHIFT
```
    Constant used in enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_AGRESSIVE_PIVOTING
```
static final int DUALSTRATEGY_AGRESSIVE_PIVOTING
```
    Constant used in enumeration 'DUALSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - DUALSTRATEGY_FORCE_DUAL_WHEN_UNSTABLE
```
static final int DUALSTRATEGY_FORCE_DUAL_WHEN_UNSTABLE
```
    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_RINS
```
static final int HEURSEARCH_RINS
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_LPFIRST
```
static final int HEURSEARCH_LPFIRST
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_MIPFIRST
```
static final int HEURSEARCH_MIPFIRST
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_COMBINESOLS
```
static final int HEURSEARCH_COMBINESOLS
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_ZEROOBJ
```
static final int HEURSEARCH_ZEROOBJ
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCH_ANALYTIC
```
static final int HEURSEARCH_ANALYTIC
```
    Constant used in enumeration 'HEURSEARCHSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_AUTOMATIC
```
@Deprecated
static final int HEURSTRATEGY_AUTOMATIC
```
    Deprecated.
    since 42.00
    
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_NONE
```
@Deprecated
static final int HEURSTRATEGY_NONE
```
    Deprecated.
    since 42.00
    
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_BASIC
```
@Deprecated
static final int HEURSTRATEGY_BASIC
```
    Deprecated.
    since 42.00
    
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_ENHANCED
```
@Deprecated
static final int HEURSTRATEGY_ENHANCED
```
    Deprecated.
    since 42.00
    
    Constant used in enumeration 'HEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSTRATEGY_EXTENSIVE
```
@Deprecated
static final int HEURSTRATEGY_EXTENSIVE
```
    Deprecated.
    since 42.00
    
    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
```
@Deprecated
static final int PRESOLVEOPS_DUALREDUCTIONS
```
    Deprecated.
    since 48.00
    
    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
```
@Deprecated
static final int PRESOLVEOPS_VARIABLEELIMINATIONS
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOIPREDUCTIONS
```
@Deprecated
static final int PRESOLVEOPS_NOIPREDUCTIONS
```
    Deprecated.
    since 48.00
    
    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
```
@Deprecated
static final int PRESOLVEOPS_NOADVANCEDIPREDUCTIONS
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOINTEGERELIMINATIONS
```
@Deprecated
static final int PRESOLVEOPS_NOINTEGERELIMINATIONS
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOSOLUTIONENUMERATION
```
static final int PRESOLVEOPS_NOSOLUTIONENUMERATION
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_LINEARLYDEPENDANTROWREMOVAL
```
@Deprecated
static final int PRESOLVEOPS_LINEARLYDEPENDANTROWREMOVAL
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOINTEGERVARIABLEANDSOSDETECTION
```
@Deprecated
static final int PRESOLVEOPS_NOINTEGERVARIABLEANDSOSDETECTION
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOIMPLIEDBOUNDS
```
static final int PRESOLVEOPS_NOIMPLIEDBOUNDS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOCLIQUEPRESOLVE
```
@Deprecated
static final int PRESOLVEOPS_NOCLIQUEPRESOLVE
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NOMOD2REDUCTIONS
```
static final int PRESOLVEOPS_NOMOD2REDUCTIONS
```
    Constant used in enumeration 'PRESOLVEOPS'
    
    See Also:
    
    Constant Field Values
  - PRESOLVEOPS_NODUALREDONGLOBALS
```
@Deprecated
static final int PRESOLVEOPS_NODUALREDONGLOBALS
```
    Deprecated.
    since 48.00
    
    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
```
@Deprecated
static final int MIPPRESOLVE_REDUCED_COST_FIXING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_LOGIC_PREPROCESSING
```
@Deprecated
static final int MIPPRESOLVE_LOGIC_PREPROCESSING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_ALLOW_CHANGE_BOUNDS
```
@Deprecated
static final int MIPPRESOLVE_ALLOW_CHANGE_BOUNDS
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'MIPPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - MIPPRESOLVE_DUAL_REDUCTIONS
```
@Deprecated
static final int MIPPRESOLVE_DUAL_REDUCTIONS
```
    Deprecated.
    since 48.00
    
    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
```
@Deprecated
static final int MIPPRESOLVE_ALLOW_TREE_RESTART
```
    Deprecated.
    since 48.00
    
    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
  - PRESOLVE_REMOVEREDUNDANTBOUNDS
```
static final int PRESOLVE_REMOVEREDUNDANTBOUNDS
```
    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
  - PRICING_STEEPEST_EDGE
```
static final int PRICING_STEEPEST_EDGE
```
    Constant used in enumeration 'PRICING'
    
    See Also:
    
    Constant Field Values
  - PRICING_STEEPEST_EDGE_UNIT_WEIGHTS
```
static final int PRICING_STEEPEST_EDGE_UNIT_WEIGHTS
```
    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
  - VARSELECTION_WEIGHTED_COMBINATION_UPDOWN_PSEUDO_COST
```
static final int VARSELECTION_WEIGHTED_COMBINATION_UPDOWN_PSEUDO_COST
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - VARSELECTION_PRODUCT_UPDOWN_PSEUDO_COST
```
static final int VARSELECTION_PRODUCT_UPDOWN_PSEUDO_COST
```
    Constant used in enumeration 'VARSELECTION'
    
    See Also:
    
    Constant Field Values
  - SCALING_ROW_SCALING
```
@Deprecated
static final int SCALING_ROW_SCALING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_COLUMN_SCALING
```
@Deprecated
static final int SCALING_COLUMN_SCALING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_ROW_SCALING_AGAIN
```
@Deprecated
static final int SCALING_ROW_SCALING_AGAIN
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_MAXIMUM
```
@Deprecated
static final int SCALING_MAXIMUM
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_CURTIS_REID
```
@Deprecated
static final int SCALING_CURTIS_REID
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_BY_MAX_ELEM_NOT_GEO_MEAN
```
@Deprecated
static final int SCALING_BY_MAX_ELEM_NOT_GEO_MEAN
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_BIGM
```
@Deprecated
static final int SCALING_BIGM
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_SIMPLEX_OBJECTIVE_SCALING
```
@Deprecated
static final int SCALING_SIMPLEX_OBJECTIVE_SCALING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_IGNORE_QUADRATIC_ROW_PART
```
@Deprecated
static final int SCALING_IGNORE_QUADRATIC_ROW_PART
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_BEFORE_PRESOLVE
```
@Deprecated
static final int SCALING_BEFORE_PRESOLVE
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_NO_SCALING_ROWS_UP
```
@Deprecated
static final int SCALING_NO_SCALING_ROWS_UP
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_NO_SCALING_COLUMNS_DOWN
```
@Deprecated
static final int SCALING_NO_SCALING_COLUMNS_DOWN
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_DISABLE_GLOBAL_OBJECTIVE_SCALING
```
@Deprecated
static final int SCALING_DISABLE_GLOBAL_OBJECTIVE_SCALING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_RHS_SCALING
```
@Deprecated
static final int SCALING_RHS_SCALING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_NO_AGGRESSIVE_Q_SCALING
```
@Deprecated
static final int SCALING_NO_AGGRESSIVE_Q_SCALING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - SCALING_SLACK_SCALING
```
@Deprecated
static final int SCALING_SLACK_SCALING
```
    Deprecated.
    since 48.00
    
    Constant used in enumeration 'SCALING'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_CLIQUE
```
@Deprecated
static final int CUTSELECT_CLIQUE
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_MIR
```
@Deprecated
static final int CUTSELECT_MIR
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_COVER
```
@Deprecated
static final int CUTSELECT_COVER
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_FLOWPATH
```
@Deprecated
static final int CUTSELECT_FLOWPATH
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_IMPLICATION
```
@Deprecated
static final int CUTSELECT_IMPLICATION
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_LIFT_AND_PROJECT
```
@Deprecated
static final int CUTSELECT_LIFT_AND_PROJECT
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_DISABLE_CUT_ROWS
```
@Deprecated
static final int CUTSELECT_DISABLE_CUT_ROWS
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_GUB_COVER
```
@Deprecated
static final int CUTSELECT_GUB_COVER
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'CUTSELECT'
    
    See Also:
    
    Constant Field Values
  - CUTSELECT_DEFAULT
```
@Deprecated
static final int CUTSELECT_DEFAULT
```
    Deprecated.
    since 48.01
    
    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_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
  - CROSSOVEROPS_RETURN_BARSOL_ON_FAILURE
```
static final int CROSSOVEROPS_RETURN_BARSOL_ON_FAILURE
```
    Constant used in enumeration 'CROSSOVEROPS'
    
    See Also:
    
    Constant Field Values
  - CROSSOVEROPS_SKIP_SECOND_PART
```
static final int CROSSOVEROPS_SKIP_SECOND_PART
```
    Constant used in enumeration 'CROSSOVEROPS'
    
    See Also:
    
    Constant Field Values
  - CROSSOVEROPS_PUSH_UNSTABLE
```
static final int CROSSOVEROPS_PUSH_UNSTABLE
```
    Constant used in enumeration 'CROSSOVEROPS'
    
    See Also:
    
    Constant Field Values
  - CROSSOVEROPS_CAREFUL
```
static final int CROSSOVEROPS_CAREFUL
```
    Constant used in enumeration 'CROSSOVEROPS'
    
    See Also:
    
    Constant Field Values
  - PRESORT_ROWS
```
static final int PRESORT_ROWS
```
    Constant used in enumeration 'PRESORT'
    
    See Also:
    
    Constant Field Values
  - PRESORT_COLUMNS
```
static final int PRESORT_COLUMNS
```
    Constant used in enumeration 'PRESORT'
    
    See Also:
    
    Constant Field Values
  - PRESORT_ENTITIES
```
static final int PRESORT_ENTITIES
```
    Constant used in enumeration 'PRESORT'
    
    See Also:
    
    Constant Field Values
  - PREPERMUTE_ROWS
```
static final int PREPERMUTE_ROWS
```
    Constant used in enumeration 'PREPERMUTE'
    
    See Also:
    
    Constant Field Values
  - PREPERMUTE_COLUMNS
```
static final int PREPERMUTE_COLUMNS
```
    Constant used in enumeration 'PREPERMUTE'
    
    See Also:
    
    Constant Field Values
  - PREPERMUTE_ENTITIES
```
static final int PREPERMUTE_ENTITIES
```
    Constant used in enumeration 'PREPERMUTE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_STANDARD
```
static final int BARREGULARIZE_STANDARD
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_REDUCED
```
static final int BARREGULARIZE_REDUCED
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_KEEPDEPENDENTROWS
```
static final int BARREGULARIZE_KEEPDEPENDENTROWS
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_KEEPDEGENERATEROWS
```
static final int BARREGULARIZE_KEEPDEGENERATEROWS
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_RESTRICTTOINFEASIBLE
```
static final int BARREGULARIZE_RESTRICTTOINFEASIBLE
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_DISABLEITERATIONS
```
static final int BARREGULARIZE_DISABLEITERATIONS
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_FORCEITERATIONS
```
static final int BARREGULARIZE_FORCEITERATIONS
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - BARREGULARIZE_AUTOMATIC
```
static final int BARREGULARIZE_AUTOMATIC
```
    Constant used in enumeration 'BARREGULARIZE'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_PRIMALPHASE1TRADITIONAL
```
static final int QSIMPLEXOPS_PRIMALPHASE1TRADITIONAL
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_PRIMALPHASE1BIGM
```
static final int QSIMPLEXOPS_PRIMALPHASE1BIGM
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_DUALPHASE1TRADITIONAL
```
static final int QSIMPLEXOPS_DUALPHASE1TRADITIONAL
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_DUALPHASE1BIGM
```
static final int QSIMPLEXOPS_DUALPHASE1BIGM
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_FORCEDUALBOUNDS
```
static final int QSIMPLEXOPS_FORCEDUALBOUNDS
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_NOWARMSTART
```
static final int QSIMPLEXOPS_NOWARMSTART
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_NODUALCRASH
```
static final int QSIMPLEXOPS_NODUALCRASH
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_EXTENDEDDUALCRASH
```
static final int QSIMPLEXOPS_EXTENDEDDUALCRASH
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_CAUTIOUSPERTURBATION
```
static final int QSIMPLEXOPS_CAUTIOUSPERTURBATION
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_TRADITIONALSCALE
```
static final int QSIMPLEXOPS_TRADITIONALSCALE
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_NOBARRIERFALLBACK
```
static final int QSIMPLEXOPS_NOBARRIERFALLBACK
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_PHASE1PRIMAL
```
static final int QSIMPLEXOPS_PHASE1PRIMAL
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_PHASE1DUAL
```
static final int QSIMPLEXOPS_PHASE1DUAL
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_PHASE1BARRIER
```
static final int QSIMPLEXOPS_PHASE1BARRIER
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_PARTIALPRICING
```
static final int QSIMPLEXOPS_PARTIALPRICING
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_FULLPRICING
```
static final int QSIMPLEXOPS_FULLPRICING
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - QSIMPLEXOPS_CROSSOVERCLEANUP
```
static final int QSIMPLEXOPS_CROSSOVERCLEANUP
```
    Constant used in enumeration 'QSIMPLEXOPS'
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT_FEASJUMP
```
static final int BACKGROUNDSELECT_FEASJUMP
```
    Constant used in enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT_FASTBB
```
static final int BACKGROUNDSELECT_FASTBB
```
    Constant used in enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT_FASTBB_HEUR
```
static final int BACKGROUNDSELECT_FASTBB_HEUR
```
    Constant used in enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT_FIXPROPAGATEREPAIR
```
static final int BACKGROUNDSELECT_FIXPROPAGATEREPAIR
```
    Constant used in enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT_PARCUTLOOP
```
static final int BACKGROUNDSELECT_PARCUTLOOP
```
    Constant used in enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT_ZEROOBJ
```
static final int BACKGROUNDSELECT_ZEROOBJ
```
    Constant used in enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - BACKGROUNDSELECT_AUTOMATIC
```
static final int BACKGROUNDSELECT_AUTOMATIC
```
    Constant used in enumeration 'BACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - PRIMALOPS_AGGRESSIVE_DJSCALE
```
static final int PRIMALOPS_AGGRESSIVE_DJSCALE
```
    Constant used in enumeration 'PRIMALOPS'
    
    See Also:
    
    Constant Field Values
  - PRIMALOPS_CONVENTIONAL_DJSCALE
```
static final int PRIMALOPS_CONVENTIONAL_DJSCALE
```
    Constant used in enumeration 'PRIMALOPS'
    
    See Also:
    
    Constant Field Values
  - PRIMALOPS_CONSERVATIVE_PARTIAL_PRICING_SWITCH
```
static final int PRIMALOPS_CONSERVATIVE_PARTIAL_PRICING_SWITCH
```
    Constant used in enumeration 'PRIMALOPS'
    
    See Also:
    
    Constant Field Values
  - PRIMALOPS_DYNAMIC_PRICING_SWITCH
```
static final int PRIMALOPS_DYNAMIC_PRICING_SWITCH
```
    Constant used in enumeration 'PRIMALOPS'
    
    See Also:
    
    Constant Field Values
  - PRIMALOPS_NOABORTCYCLING
```
static final int PRIMALOPS_NOABORTCYCLING
```
    Constant used in enumeration 'PRIMALOPS'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHBACKGROUNDSELECT_LPFIRST
```
static final int HEURSEARCHBACKGROUNDSELECT_LPFIRST
```
    Constant used in enumeration 'HEURSEARCHBACKGROUNDSELECT'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHBACKGROUNDSELECT_AUTOMATIC
```
static final int HEURSEARCHBACKGROUNDSELECT_AUTOMATIC
```
    Constant used in enumeration 'HEURSEARCHBACKGROUNDSELECT'
    
    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
  - TREEDIAGNOSTICS_MEMORY_SAVING_LOG
```
static final int TREEDIAGNOSTICS_MEMORY_SAVING_LOG
```
    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
  - BARPRESOLVEOPS_FULL_MATRIX_ELIMINATION
```
static final int BARPRESOLVEOPS_FULL_MATRIX_ELIMINATION
```
    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
  - PREDOMCOL_GENERAL
```
static final int PREDOMCOL_GENERAL
```
    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
  - 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_GLOBALQUICK
```
static final int TUNERMETHOD_GLOBALQUICK
```
    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
  - TUNERTARGET_PRIMALINTEGRAL
```
static final int TUNERTARGET_PRIMALINTEGRAL
```
    Constant used in enumeration 'TUNERTARGET'
    
    See Also:
    
    Constant Field Values
  - TUNERTARGET_WORK
```
static final int TUNERTARGET_WORK
```
    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
  - OBJECTIVE_PRIORITY
```
static final int OBJECTIVE_PRIORITY
```
    Constant used in enumeration 'OBJCONTROL'
    
    See Also:
    
    Constant Field Values
  - OBJECTIVE_WEIGHT
```
static final int OBJECTIVE_WEIGHT
```
    Constant used in enumeration 'OBJCONTROL'
    
    See Also:
    
    Constant Field Values
  - OBJECTIVE_ABSTOL
```
static final int OBJECTIVE_ABSTOL
```
    Constant used in enumeration 'OBJCONTROL'
    
    See Also:
    
    Constant Field Values
  - OBJECTIVE_RELTOL
```
static final int OBJECTIVE_RELTOL
```
    Constant used in enumeration 'OBJCONTROL'
    
    See Also:
    
    Constant Field Values
  - OBJECTIVE_RHS
```
static final int OBJECTIVE_RHS
```
    Constant used in enumeration 'OBJCONTROL'
    
    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
  - NAMES_ROW
```
static final int NAMES_ROW
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_COLUMN
```
static final int NAMES_COLUMN
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_SET
```
static final int NAMES_SET
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_PWLCONS
```
static final int NAMES_PWLCONS
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_GENCONS
```
static final int NAMES_GENCONS
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_OBJECTIVE
```
static final int NAMES_OBJECTIVE
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_USERFUNC
```
static final int NAMES_USERFUNC
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_INTERNALFUNC
```
static final int NAMES_INTERNALFUNC
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_USERFUNCNOCASE
```
static final int NAMES_USERFUNCNOCASE
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - NAMES_INTERNALFUNCNOCASE
```
static final int NAMES_INTERNALFUNCNOCASE
```
    Constant used in enumeration 'NAMESPACES'
    
    See Also:
    
    Constant Field Values
  - GLOBALBOUNDINGBOX_NOT_APPLIED
```
static final int GLOBALBOUNDINGBOX_NOT_APPLIED
```
    Constant used in enumeration 'GLOBALBOUNDINGBOX'
    
    See Also:
    
    Constant Field Values
  - GLOBALBOUNDINGBOX_ORIGINAL
```
static final int GLOBALBOUNDINGBOX_ORIGINAL
```
    Constant used in enumeration 'GLOBALBOUNDINGBOX'
    
    See Also:
    
    Constant Field Values
  - GLOBALBOUNDINGBOX_AUXILIARY
```
static final int GLOBALBOUNDINGBOX_AUXILIARY
```
    Constant used in enumeration 'GLOBALBOUNDINGBOX'
    
    See Also:
    
    Constant Field Values
  - MULTIOBJOPS_ENABLED
```
static final int MULTIOBJOPS_ENABLED
```
    Constant used in enumeration 'MULTIOBJOPS'
    
    See Also:
    
    Constant Field Values
  - MULTIOBJOPS_PRESOLVE
```
static final int MULTIOBJOPS_PRESOLVE
```
    Constant used in enumeration 'MULTIOBJOPS'
    
    See Also:
    
    Constant Field Values
  - MULTIOBJOPS_RCFIXING
```
static final int MULTIOBJOPS_RCFIXING
```
    Constant used in enumeration 'MULTIOBJOPS'
    
    See Also:
    
    Constant Field Values
  - MULTIOBJOPS_NOSOLVEATTRIBS
```
static final int MULTIOBJOPS_NOSOLVEATTRIBS
```
    Constant used in enumeration 'MULTIOBJOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_BINARY
```
static final int IISOPS_BINARY
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_ZEROLOWER
```
static final int IISOPS_ZEROLOWER
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_FIXEDVAR
```
static final int IISOPS_FIXEDVAR
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_BOUND
```
static final int IISOPS_BOUND
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_GENINTEGRALITY
```
static final int IISOPS_GENINTEGRALITY
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_INTEGRALITY
```
static final int IISOPS_INTEGRALITY
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_VARIABLE
```
static final int IISOPS_VARIABLE
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_EQUALITY
```
static final int IISOPS_EQUALITY
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_GENERAL
```
static final int IISOPS_GENERAL
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_PWL
```
static final int IISOPS_PWL
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_SET
```
static final int IISOPS_SET
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_INDICATOR
```
static final int IISOPS_INDICATOR
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_DELAYED
```
static final int IISOPS_DELAYED
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - IISOPS_CONSTRAINT
```
static final int IISOPS_CONSTRAINT
```
    Constant used in enumeration 'IISOPS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_NOT_CHECKED
```
static final int USERSOLSTATUS_NOT_CHECKED
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_ACCEPTED_FEASIBLE
```
static final int USERSOLSTATUS_ACCEPTED_FEASIBLE
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_ACCEPTED_OPTIMIZED
```
static final int USERSOLSTATUS_ACCEPTED_OPTIMIZED
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_SEARCHED_SOL
```
static final int USERSOLSTATUS_SEARCHED_SOL
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_SEARCHED_NOSOL
```
static final int USERSOLSTATUS_SEARCHED_NOSOL
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_REJECTED_INFEAS_NOSEARCH
```
static final int USERSOLSTATUS_REJECTED_INFEAS_NOSEARCH
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_REJECTED_PARTIAL_NOSEARCH
```
static final int USERSOLSTATUS_REJECTED_PARTIAL_NOSEARCH
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_REJECTED_FAILED_OPTIMIZE
```
static final int USERSOLSTATUS_REJECTED_FAILED_OPTIMIZE
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_DROPPED
```
static final int USERSOLSTATUS_DROPPED
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - USERSOLSTATUS_REJECTED_CUTOFF
```
static final int USERSOLSTATUS_REJECTED_CUTOFF
```
    Constant used in enumeration 'USERSOLSTATUS'
    
    See Also:
    
    Constant Field Values
  - GLOBALLSHEURSTRATEGY_DEFAULT
```
static final int GLOBALLSHEURSTRATEGY_DEFAULT
```
    Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALLSHEURSTRATEGY_NONE
```
static final int GLOBALLSHEURSTRATEGY_NONE
```
    Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALLSHEURSTRATEGY_CONSERVATIVE
```
static final int GLOBALLSHEURSTRATEGY_CONSERVATIVE
```
    Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALLSHEURSTRATEGY_MODERATE
```
static final int GLOBALLSHEURSTRATEGY_MODERATE
```
    Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALLSHEURSTRATEGY_AGGRESSIVE
```
static final int GLOBALLSHEURSTRATEGY_AGGRESSIVE
```
    Constant used in enumeration 'GLOBALLSHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_ASYM_AVG
```
static final int BARHGOPS_ASYM_AVG
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_START_L1
```
static final int BARHGOPS_START_L1
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_START_L2
```
static final int BARHGOPS_START_L2
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_START_LINF
```
static final int BARHGOPS_START_LINF
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_RESTART_L2
```
static final int BARHGOPS_RESTART_L2
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_OMEGA_CONTRACT
```
static final int BARHGOPS_OMEGA_CONTRACT
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_OMEGA_INF
```
static final int BARHGOPS_OMEGA_INF
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_NOHALPERN
```
static final int BARHGOPS_NOHALPERN
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_OBJSCALE
```
static final int BARHGOPS_OBJSCALE
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BARHGOPS_RHSSCALE
```
static final int BARHGOPS_RHSSCALE
```
    Constant used in enumeration 'BARHGOPS'
    
    See Also:
    
    Constant Field Values
  - BASISSTATUS_NONBASIC_LOWER
```
static final int BASISSTATUS_NONBASIC_LOWER
```
    Constant used in enumeration 'BASISSTATUS'
    
    See Also:
    
    Constant Field Values
  - BASISSTATUS_BASIC
```
static final int BASISSTATUS_BASIC
```
    Constant used in enumeration 'BASISSTATUS'
    
    See Also:
    
    Constant Field Values
  - BASISSTATUS_NONBASIC_UPPER
```
static final int BASISSTATUS_NONBASIC_UPPER
```
    Constant used in enumeration 'BASISSTATUS'
    
    See Also:
    
    Constant Field Values
  - BASISSTATUS_SUPERBASIC
```
static final int BASISSTATUS_SUPERBASIC
```
    Constant used in enumeration 'BASISSTATUS'
    
    See Also:
    
    Constant Field Values
  - SDPCUTSTRATEGY_DEFAULT
```
@Deprecated
static final int SDPCUTSTRATEGY_DEFAULT
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'SDPCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - SDPCUTSTRATEGY_NONE
```
@Deprecated
static final int SDPCUTSTRATEGY_NONE
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'SDPCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - SDPCUTSTRATEGY_CONSERVATIVE
```
@Deprecated
static final int SDPCUTSTRATEGY_CONSERVATIVE
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'SDPCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - SDPCUTSTRATEGY_MODERATE
```
@Deprecated
static final int SDPCUTSTRATEGY_MODERATE
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'SDPCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - SDPCUTSTRATEGY_AGGRESSIVE
```
@Deprecated
static final int SDPCUTSTRATEGY_AGGRESSIVE
```
    Deprecated.
    since 48.01
    
    Constant used in enumeration 'SDPCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - BARHGPRECISION_AUTOMATIC
```
static final int BARHGPRECISION_AUTOMATIC
```
    Constant used in enumeration 'BARHGPRECISION'
    
    See Also:
    
    Constant Field Values
  - BARHGPRECISION_SINGLE
```
static final int BARHGPRECISION_SINGLE
```
    Constant used in enumeration 'BARHGPRECISION'
    
    See Also:
    
    Constant Field Values
  - BARHGPRECISION_DOUBLE
```
static final int BARHGPRECISION_DOUBLE
```
    Constant used in enumeration 'BARHGPRECISION'
    
    See Also:
    
    Constant Field Values
  - MIPSTOPSTAGE_NONE
```
static final int MIPSTOPSTAGE_NONE
```
    Constant used in enumeration 'MIPSTOPSTAGE'
    
    See Also:
    
    Constant Field Values
  - MIPSTOPSTAGE_PRESOLVE
```
static final int MIPSTOPSTAGE_PRESOLVE
```
    Constant used in enumeration 'MIPSTOPSTAGE'
    
    See Also:
    
    Constant Field Values
  - MIPSTOPSTAGE_PREROOTHEURS
```
static final int MIPSTOPSTAGE_PREROOTHEURS
```
    Constant used in enumeration 'MIPSTOPSTAGE'
    
    See Also:
    
    Constant Field Values
  - MIPSTOPSTAGE_INITIALRELAXATION
```
static final int MIPSTOPSTAGE_INITIALRELAXATION
```
    Constant used in enumeration 'MIPSTOPSTAGE'
    
    See Also:
    
    Constant Field Values
  - MIPSTOPSTAGE_ROOTNODE
```
static final int MIPSTOPSTAGE_ROOTNODE
```
    Constant used in enumeration 'MIPSTOPSTAGE'
    
    See Also:
    
    Constant Field Values
  - HEURBEFORELPGPUMETHOD_AUTOMATIC
```
static final int HEURBEFORELPGPUMETHOD_AUTOMATIC
```
    Constant used in enumeration 'HEURBEFORELPGPUMETHOD'
    
    See Also:
    
    Constant Field Values
  - HEURBEFORELPGPUMETHOD_OFF
```
static final int HEURBEFORELPGPUMETHOD_OFF
```
    Constant used in enumeration 'HEURBEFORELPGPUMETHOD'
    
    See Also:
    
    Constant Field Values
  - HEURBEFORELPGPUMETHOD_FEASPUMP
```
static final int HEURBEFORELPGPUMETHOD_FEASPUMP
```
    Constant used in enumeration 'HEURBEFORELPGPUMETHOD'
    
    See Also:
    
    Constant Field Values
  - POOLENUMSTRATEGY_STANDARD
```
static final int POOLENUMSTRATEGY_STANDARD
```
    Constant used in enumeration 'POOLENUMSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - POOLENUMSTRATEGY_EXTENDED
```
static final int POOLENUMSTRATEGY_EXTENDED
```
    Constant used in enumeration 'POOLENUMSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - POOLENUMSTRATEGY_FULL
```
static final int POOLENUMSTRATEGY_FULL
```
    Constant used in enumeration 'POOLENUMSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - NODEPRESOLVE_AUTOMATIC
```
static final int NODEPRESOLVE_AUTOMATIC
```
    Constant used in enumeration 'NODEPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - NODEPRESOLVE_OFF
```
static final int NODEPRESOLVE_OFF
```
    Constant used in enumeration 'NODEPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - NODEPRESOLVE_CONSERVATIVE
```
static final int NODEPRESOLVE_CONSERVATIVE
```
    Constant used in enumeration 'NODEPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - NODEPRESOLVE_MODERATE
```
static final int NODEPRESOLVE_MODERATE
```
    Constant used in enumeration 'NODEPRESOLVE'
    
    See Also:
    
    Constant Field Values
  - NODEREDCOSTTIGHTEN_AUTOMATIC
```
static final int NODEREDCOSTTIGHTEN_AUTOMATIC
```
    Constant used in enumeration 'NODEREDCOSTTIGHTEN'
    
    See Also:
    
    Constant Field Values
  - NODEREDCOSTTIGHTEN_OFF
```
static final int NODEREDCOSTTIGHTEN_OFF
```
    Constant used in enumeration 'NODEREDCOSTTIGHTEN'
    
    See Also:
    
    Constant Field Values
  - NODEREDCOSTTIGHTEN_MODERATE
```
static final int NODEREDCOSTTIGHTEN_MODERATE
```
    Constant used in enumeration 'NODEREDCOSTTIGHTEN'
    
    See Also:
    
    Constant Field Values
  - NODEREDCOSTTIGHTEN_AGGRESSIVE
```
static final int NODEREDCOSTTIGHTEN_AGGRESSIVE
```
    Constant used in enumeration 'NODEREDCOSTTIGHTEN'
    
    See Also:
    
    Constant Field Values
  - NODEAPPLIEDBOUNDS_AUTOMATIC
```
static final int NODEAPPLIEDBOUNDS_AUTOMATIC
```
    Constant used in enumeration 'NODEAPPLIEDBOUNDS'
    
    See Also:
    
    Constant Field Values
  - NODEAPPLIEDBOUNDS_OFF
```
static final int NODEAPPLIEDBOUNDS_OFF
```
    Constant used in enumeration 'NODEAPPLIEDBOUNDS'
    
    See Also:
    
    Constant Field Values
  - NODEAPPLIEDBOUNDS_MIPENTITIES
```
static final int NODEAPPLIEDBOUNDS_MIPENTITIES
```
    Constant used in enumeration 'NODEAPPLIEDBOUNDS'
    
    See Also:
    
    Constant Field Values
  - NODEAPPLIEDBOUNDS_ALL
```
static final int NODEAPPLIEDBOUNDS_ALL
```
    Constant used in enumeration 'NODEAPPLIEDBOUNDS'
    
    See Also:
    
    Constant Field Values
  - DUALREDUCTIONS_AUTOMATIC
```
static final int DUALREDUCTIONS_AUTOMATIC
```
    Constant used in enumeration 'DUALREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - DUALREDUCTIONS_OFF
```
static final int DUALREDUCTIONS_OFF
```
    Constant used in enumeration 'DUALREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - DUALREDUCTIONS_ALL
```
static final int DUALREDUCTIONS_ALL
```
    Constant used in enumeration 'DUALREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - DUALREDUCTIONS_NONMIPENTITIES
```
static final int DUALREDUCTIONS_NONMIPENTITIES
```
    Constant used in enumeration 'DUALREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRATEGY_AUTOENFORCED
```
static final int CUTSEPSTRATEGY_AUTOENFORCED
```
    Constant used in enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRATEGY_AUTOMATIC
```
static final int CUTSEPSTRATEGY_AUTOMATIC
```
    Constant used in enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRATEGY_OFF
```
static final int CUTSEPSTRATEGY_OFF
```
    Constant used in enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRATEGY_CONSERVATIVE
```
static final int CUTSEPSTRATEGY_CONSERVATIVE
```
    Constant used in enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRATEGY_MODERATE
```
static final int CUTSEPSTRATEGY_MODERATE
```
    Constant used in enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTSEPSTRATEGY_AGGRESSIVE
```
static final int CUTSEPSTRATEGY_AGGRESSIVE
```
    Constant used in enumeration 'CUTSEPSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - CUTAGGROWS_AUTOMATIC
```
static final int CUTAGGROWS_AUTOMATIC
```
    Constant used in enumeration 'CUTAGGROWS'
    
    See Also:
    
    Constant Field Values
  - CUTAGGROWS_OFF
```
static final int CUTAGGROWS_OFF
```
    Constant used in enumeration 'CUTAGGROWS'
    
    See Also:
    
    Constant Field Values
  - CUTAGGROWS_CONSERVATIVE
```
static final int CUTAGGROWS_CONSERVATIVE
```
    Constant used in enumeration 'CUTAGGROWS'
    
    See Also:
    
    Constant Field Values
  - CUTAGGROWS_MODERATE
```
static final int CUTAGGROWS_MODERATE
```
    Constant used in enumeration 'CUTAGGROWS'
    
    See Also:
    
    Constant Field Values
  - CUTAGGROWS_AGGRESSIVE
```
static final int CUTAGGROWS_AGGRESSIVE
```
    Constant used in enumeration 'CUTAGGROWS'
    
    See Also:
    
    Constant Field Values
  - CUTAGGROWS_VERYAGGRESSIVE
```
static final int CUTAGGROWS_VERYAGGRESSIVE
```
    Constant used in enumeration 'CUTAGGROWS'
    
    See Also:
    
    Constant Field Values
  - CUTFROMCUTROWS_AUTOMATIC
```
static final int CUTFROMCUTROWS_AUTOMATIC
```
    Constant used in enumeration 'CUTFROMCUTROWS'
    
    See Also:
    
    Constant Field Values
  - CUTFROMCUTROWS_OFF
```
static final int CUTFROMCUTROWS_OFF
```
    Constant used in enumeration 'CUTFROMCUTROWS'
    
    See Also:
    
    Constant Field Values
  - CUTFROMCUTROWS_CONSERVATIVE
```
static final int CUTFROMCUTROWS_CONSERVATIVE
```
    Constant used in enumeration 'CUTFROMCUTROWS'
    
    See Also:
    
    Constant Field Values
  - CUTFROMCUTROWS_MODERATE
```
static final int CUTFROMCUTROWS_MODERATE
```
    Constant used in enumeration 'CUTFROMCUTROWS'
    
    See Also:
    
    Constant Field Values
  - CUTFROMCUTROWS_AGGRESSIVE
```
static final int CUTFROMCUTROWS_AGGRESSIVE
```
    Constant used in enumeration 'CUTFROMCUTROWS'
    
    See Also:
    
    Constant Field Values
  - SCALINGMETHOD_AUTOMATIC
```
static final int SCALINGMETHOD_AUTOMATIC
```
    Constant used in enumeration 'SCALINGMETHOD'
    
    See Also:
    
    Constant Field Values
  - SCALINGMETHOD_OFF
```
static final int SCALINGMETHOD_OFF
```
    Constant used in enumeration 'SCALINGMETHOD'
    
    See Also:
    
    Constant Field Values
  - SCALINGMETHOD_MAXIMUM
```
static final int SCALINGMETHOD_MAXIMUM
```
    Constant used in enumeration 'SCALINGMETHOD'
    
    See Also:
    
    Constant Field Values
  - SCALINGMETHOD_GEOMETRICMEAN
```
static final int SCALINGMETHOD_GEOMETRICMEAN
```
    Constant used in enumeration 'SCALINGMETHOD'
    
    See Also:
    
    Constant Field Values
  - SCALINGMETHOD_CURTISREID
```
static final int SCALINGMETHOD_CURTISREID
```
    Constant used in enumeration 'SCALINGMETHOD'
    
    See Also:
    
    Constant Field Values
  - SCALINGMETHOD_MAXIMUMCURTISREID
```
static final int SCALINGMETHOD_MAXIMUMCURTISREID
```
    Constant used in enumeration 'SCALINGMETHOD'
    
    See Also:
    
    Constant Field Values
  - SCALINGORDER_AUTOMATIC
```
static final int SCALINGORDER_AUTOMATIC
```
    Constant used in enumeration 'SCALINGORDER'
    
    See Also:
    
    Constant Field Values
  - SCALINGORDER_BEFOREPRESOLVE
```
static final int SCALINGORDER_BEFOREPRESOLVE
```
    Constant used in enumeration 'SCALINGORDER'
    
    See Also:
    
    Constant Field Values
  - SCALINGORDER_AFTERPRESOLVE
```
static final int SCALINGORDER_AFTERPRESOLVE
```
    Constant used in enumeration 'SCALINGORDER'
    
    See Also:
    
    Constant Field Values
  - SCALINGORDER_BEFOREANDAFTERPRESOLVE
```
static final int SCALINGORDER_BEFOREANDAFTERPRESOLVE
```
    Constant used in enumeration 'SCALINGORDER'
    
    See Also:
    
    Constant Field Values
  - SCALINGBIGM_AUTOMATIC
```
static final int SCALINGBIGM_AUTOMATIC
```
    Constant used in enumeration 'SCALINGBIGM'
    
    See Also:
    
    Constant Field Values
  - SCALINGBIGM_OFF
```
static final int SCALINGBIGM_OFF
```
    Constant used in enumeration 'SCALINGBIGM'
    
    See Also:
    
    Constant Field Values
  - SCALINGBIGM_ON
```
static final int SCALINGBIGM_ON
```
    Constant used in enumeration 'SCALINGBIGM'
    
    See Also:
    
    Constant Field Values
  - SCALINGSIMPLEXOBJ_AUTOMATIC
```
static final int SCALINGSIMPLEXOBJ_AUTOMATIC
```
    Constant used in enumeration 'SCALINGSIMPLEXOBJ'
    
    See Also:
    
    Constant Field Values
  - SCALINGSIMPLEXOBJ_OFF
```
static final int SCALINGSIMPLEXOBJ_OFF
```
    Constant used in enumeration 'SCALINGSIMPLEXOBJ'
    
    See Also:
    
    Constant Field Values
  - SCALINGSIMPLEXOBJ_ON
```
static final int SCALINGSIMPLEXOBJ_ON
```
    Constant used in enumeration 'SCALINGSIMPLEXOBJ'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_ROW_SCALING
```
static final int SCALINGOPS_ROW_SCALING
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_COLUMN_SCALING
```
static final int SCALINGOPS_COLUMN_SCALING
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_ROW_SCALING_AGAIN
```
static final int SCALINGOPS_ROW_SCALING_AGAIN
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_IGNORE_QUADRATIC_ROW_PART
```
static final int SCALINGOPS_IGNORE_QUADRATIC_ROW_PART
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_NO_SCALING_ROWS_UP
```
static final int SCALINGOPS_NO_SCALING_ROWS_UP
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_NO_SCALING_COLUMNS_DOWN
```
static final int SCALINGOPS_NO_SCALING_COLUMNS_DOWN
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_DISABLE_GLOBAL_OBJECTIVE_SCALING
```
static final int SCALINGOPS_DISABLE_GLOBAL_OBJECTIVE_SCALING
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_RHS_SCALING
```
static final int SCALINGOPS_RHS_SCALING
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_NO_AGGRESSIVE_Q_SCALING
```
static final int SCALINGOPS_NO_AGGRESSIVE_Q_SCALING
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - SCALINGOPS_SLACK_SCALING
```
static final int SCALINGOPS_SLACK_SCALING
```
    Constant used in enumeration 'SCALINGOPS'
    
    See Also:
    
    Constant Field Values
  - GLOBALMISLPHEURSTRATEGY_AUTOMATIC
```
static final int GLOBALMISLPHEURSTRATEGY_AUTOMATIC
```
    Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALMISLPHEURSTRATEGY_OFF
```
static final int GLOBALMISLPHEURSTRATEGY_OFF
```
    Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALMISLPHEURSTRATEGY_CONSERVATIVE
```
static final int GLOBALMISLPHEURSTRATEGY_CONSERVATIVE
```
    Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALMISLPHEURSTRATEGY_MODERATE
```
static final int GLOBALMISLPHEURSTRATEGY_MODERATE
```
    Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALMISLPHEURSTRATEGY_AGGRESSIVE
```
static final int GLOBALMISLPHEURSTRATEGY_AGGRESSIVE
```
    Constant used in enumeration 'GLOBALMISLPHEURSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHSTRATEGY_AUTOENFORCED
```
static final int HEURSEARCHSTRATEGY_AUTOENFORCED
```
    Constant used in enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHSTRATEGY_AUTOMATIC
```
static final int HEURSEARCHSTRATEGY_AUTOMATIC
```
    Constant used in enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHSTRATEGY_OFF
```
static final int HEURSEARCHSTRATEGY_OFF
```
    Constant used in enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHSTRATEGY_CONSERVATIVE
```
static final int HEURSEARCHSTRATEGY_CONSERVATIVE
```
    Constant used in enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHSTRATEGY_MODERATE
```
static final int HEURSEARCHSTRATEGY_MODERATE
```
    Constant used in enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - HEURSEARCHSTRATEGY_AGGRESSIVE
```
static final int HEURSEARCHSTRATEGY_AGGRESSIVE
```
    Constant used in enumeration 'HEURSEARCHSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - PRECLIQUELIFTING_AUTOMATIC
```
static final int PRECLIQUELIFTING_AUTOMATIC
```
    Constant used in enumeration 'PRECLIQUELIFTING'
    
    See Also:
    
    Constant Field Values
  - PRECLIQUELIFTING_OFF
```
static final int PRECLIQUELIFTING_OFF
```
    Constant used in enumeration 'PRECLIQUELIFTING'
    
    See Also:
    
    Constant Field Values
  - PRECLIQUELIFTING_ON
```
static final int PRECLIQUELIFTING_ON
```
    Constant used in enumeration 'PRECLIQUELIFTING'
    
    See Also:
    
    Constant Field Values
  - PREMIPREDUCTIONS_AUTOMATIC
```
static final int PREMIPREDUCTIONS_AUTOMATIC
```
    Constant used in enumeration 'PREMIPREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - PREMIPREDUCTIONS_OFF
```
static final int PREMIPREDUCTIONS_OFF
```
    Constant used in enumeration 'PREMIPREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - PREMIPREDUCTIONS_SIMPLE
```
static final int PREMIPREDUCTIONS_SIMPLE
```
    Constant used in enumeration 'PREMIPREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - PREMIPREDUCTIONS_ADVANCED
```
static final int PREMIPREDUCTIONS_ADVANCED
```
    Constant used in enumeration 'PREMIPREDUCTIONS'
    
    See Also:
    
    Constant Field Values
  - PREMIPENTDETECT_AUTOMATIC
```
static final int PREMIPENTDETECT_AUTOMATIC
```
    Constant used in enumeration 'PREMIPENTDETECT'
    
    See Also:
    
    Constant Field Values
  - PREMIPENTDETECT_OFF
```
static final int PREMIPENTDETECT_OFF
```
    Constant used in enumeration 'PREMIPENTDETECT'
    
    See Also:
    
    Constant Field Values
  - PREMIPENTDETECT_ON
```
static final int PREMIPENTDETECT_ON
```
    Constant used in enumeration 'PREMIPENTDETECT'
    
    See Also:
    
    Constant Field Values
  - PREELIMINATIONS_AUTOMATIC
```
static final int PREELIMINATIONS_AUTOMATIC
```
    Constant used in enumeration 'PREELIMINATIONS'
    
    See Also:
    
    Constant Field Values
  - PREELIMINATIONS_OFF
```
static final int PREELIMINATIONS_OFF
```
    Constant used in enumeration 'PREELIMINATIONS'
    
    See Also:
    
    Constant Field Values
  - PREELIMINATIONS_NONMIPENTITIES
```
static final int PREELIMINATIONS_NONMIPENTITIES
```
    Constant used in enumeration 'PREELIMINATIONS'
    
    See Also:
    
    Constant Field Values
  - PREELIMINATIONS_ALL
```
static final int PREELIMINATIONS_ALL
```
    Constant used in enumeration 'PREELIMINATIONS'
    
    See Also:
    
    Constant Field Values
  - GLOBALINITCUTSTRATEGY_AUTOMATIC
```
static final int GLOBALINITCUTSTRATEGY_AUTOMATIC
```
    Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALINITCUTSTRATEGY_OFF
```
static final int GLOBALINITCUTSTRATEGY_OFF
```
    Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALINITCUTSTRATEGY_CONSERVATIVE
```
static final int GLOBALINITCUTSTRATEGY_CONSERVATIVE
```
    Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALINITCUTSTRATEGY_MODERATE
```
static final int GLOBALINITCUTSTRATEGY_MODERATE
```
    Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
    
    See Also:
    
    Constant Field Values
  - GLOBALINITCUTSTRATEGY_AGGRESSIVE
```
static final int GLOBALINITCUTSTRATEGY_AGGRESSIVE
```
    Constant used in enumeration 'GLOBALINITCUTSTRATEGY'
    
    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
  - TOK_EOF
```
static final int TOK_EOF
```
    See Also:
    
    Constant Field Values
  - TOK_CON
```
static final int TOK_CON
```
    See Also:
    
    Constant Field Values
  - TOK_COL
```
static final int TOK_COL
```
    See Also:
    
    Constant Field Values
  - TOK_FUN
```
static final int TOK_FUN
```
    See Also:
    
    Constant Field Values
  - TOK_IFUN
```
static final int TOK_IFUN
```
    See Also:
    
    Constant Field Values
  - TOK_LB
```
static final int TOK_LB
```
    See Also:
    
    Constant Field Values
  - TOK_RB
```
static final int TOK_RB
```
    See Also:
    
    Constant Field Values
  - TOK_DEL
```
static final int TOK_DEL
```
    See Also:
    
    Constant Field Values
  - TOK_OP
```
static final int TOK_OP
```
    See Also:
    
    Constant Field Values
  - OP_UMINUS
```
static final int OP_UMINUS
```
    See Also:
    
    Constant Field Values
  - OP_EXPONENT
```
static final int OP_EXPONENT
```
    See Also:
    
    Constant Field Values
  - OP_MULTIPLY
```
static final int OP_MULTIPLY
```
    See Also:
    
    Constant Field Values
  - OP_DIVIDE
```
static final int OP_DIVIDE
```
    See Also:
    
    Constant Field Values
  - OP_PLUS
```
static final int OP_PLUS
```
    See Also:
    
    Constant Field Values
  - OP_MINUS
```
static final int OP_MINUS
```
    See Also:
    
    Constant Field Values
  - DEL_COMMA
```
static final int DEL_COMMA
```
    See Also:
    
    Constant Field Values
  - DEL_COLON
```
static final int DEL_COLON
```
    See Also:
    
    Constant Field Values
  - IFUN_LOG10
```
static final int IFUN_LOG10
```
    See Also:
    
    Constant Field Values
  - IFUN_LN
```
static final int IFUN_LN
```
    See Also:
    
    Constant Field Values
  - IFUN_EXP
```
static final int IFUN_EXP
```
    See Also:
    
    Constant Field Values
  - IFUN_ABS
```
static final int IFUN_ABS
```
    See Also:
    
    Constant Field Values
  - IFUN_SQRT
```
static final int IFUN_SQRT
```
    See Also:
    
    Constant Field Values
  - IFUN_SIN
```
static final int IFUN_SIN
```
    See Also:
    
    Constant Field Values
  - IFUN_COS
```
static final int IFUN_COS
```
    See Also:
    
    Constant Field Values
  - IFUN_TAN
```
static final int IFUN_TAN
```
    See Also:
    
    Constant Field Values
  - IFUN_ARCSIN
```
static final int IFUN_ARCSIN
```
    See Also:
    
    Constant Field Values
  - IFUN_ARCCOS
```
static final int IFUN_ARCCOS
```
    See Also:
    
    Constant Field Values
  - IFUN_ARCTAN
```
static final int IFUN_ARCTAN
```
    See Also:
    
    Constant Field Values
  - IFUN_MIN
```
static final int IFUN_MIN
```
    See Also:
    
    Constant Field Values
  - IFUN_MAX
```
static final int IFUN_MAX
```
    See Also:
    
    Constant Field Values
  - IFUN_PWL
```
static final int IFUN_PWL
```
    See Also:
    
    Constant Field Values
  - IFUN_SUM
```
static final int IFUN_SUM
```
    See Also:
    
    Constant Field Values
  - IFUN_PROD
```
static final int IFUN_PROD
```
    See Also:
    
    Constant Field Values
  - IFUN_SIGN
```
static final int IFUN_SIGN
```
    See Also:
    
    Constant Field Values
  - IFUN_ERF
```
static final int IFUN_ERF
```
    See Also:
    
    Constant Field Values
  - IFUN_ERFC
```
static final int IFUN_ERFC
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_TC
```
static final int SLPTOLSET_TC
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_TA
```
static final int SLPTOLSET_TA
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_RA
```
static final int SLPTOLSET_RA
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_TM
```
static final int SLPTOLSET_TM
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_RM
```
static final int SLPTOLSET_RM
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_TI
```
static final int SLPTOLSET_TI
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_RI
```
static final int SLPTOLSET_RI
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_TS
```
static final int SLPTOLSET_TS
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_RS
```
static final int SLPTOLSET_RS
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_TC
```
static final int SLPTOLSETBIT_TC
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_TA
```
static final int SLPTOLSETBIT_TA
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_RA
```
static final int SLPTOLSETBIT_RA
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_TM
```
static final int SLPTOLSETBIT_TM
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_RM
```
static final int SLPTOLSETBIT_RM
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_TI
```
static final int SLPTOLSETBIT_TI
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_RI
```
static final int SLPTOLSETBIT_RI
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_TS
```
static final int SLPTOLSETBIT_TS
```
    See Also:
    
    Constant Field Values
  - SLPTOLSETBIT_RS
```
static final int SLPTOLSETBIT_RS
```
    See Also:
    
    Constant Field Values
  - SLPTOLSET_DELETE
```
static final int SLPTOLSET_DELETE
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_CTOL
```
static final int SLPCONVERGEBIT_CTOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_ATOL
```
static final int SLPCONVERGEBIT_ATOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_MTOL
```
static final int SLPCONVERGEBIT_MTOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_ITOL
```
static final int SLPCONVERGEBIT_ITOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_STOL
```
static final int SLPCONVERGEBIT_STOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_USER
```
static final int SLPCONVERGEBIT_USER
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_VTOL
```
static final int SLPCONVERGEBIT_VTOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_XTOL
```
static final int SLPCONVERGEBIT_XTOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_OTOL
```
static final int SLPCONVERGEBIT_OTOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_WTOL
```
static final int SLPCONVERGEBIT_WTOL
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_EXTENDEDSCALING
```
static final int SLPCONVERGEBIT_EXTENDEDSCALING
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_VALIDATION
```
static final int SLPCONVERGEBIT_VALIDATION
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_VALIDATION_K
```
static final int SLPCONVERGEBIT_VALIDATION_K
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_NOQUADCHECK
```
static final int SLPCONVERGEBIT_NOQUADCHECK
```
    See Also:
    
    Constant Field Values
  - SLPCONVERGEBIT_REQUIRE_OTOL_R
```
static final int SLPCONVERGEBIT_REQUIRE_OTOL_R
```
    See Also:
    
    Constant Field Values
  - SLPHASNOCOEFS
```
static final int SLPHASNOCOEFS
```
    See Also:
    
    Constant Field Values
  - SLPHASDELTA
```
static final int SLPHASDELTA
```
    See Also:
    
    Constant Field Values
  - SLPHASIV
```
static final int SLPHASIV
```
    See Also:
    
    Constant Field Values
  - SLPHASCALCIV
```
static final int SLPHASCALCIV
```
    See Also:
    
    Constant Field Values
  - SLPISDELTA
```
static final int SLPISDELTA
```
    See Also:
    
    Constant Field Values
  - SLPISPLUSPENALTYDELTA
```
static final int SLPISPLUSPENALTYDELTA
```
    See Also:
    
    Constant Field Values
  - SLPISMINUSPENALTYDELTA
```
static final int SLPISMINUSPENALTYDELTA
```
    See Also:
    
    Constant Field Values
  - SLPISPENALTYDELTA
```
static final int SLPISPENALTYDELTA
```
    See Also:
    
    Constant Field Values
  - SLPISPLUSERRORVECTOR
```
static final int SLPISPLUSERRORVECTOR
```
    See Also:
    
    Constant Field Values
  - SLPISMINUSERRORVECTOR
```
static final int SLPISMINUSERRORVECTOR
```
    See Also:
    
    Constant Field Values
  - SLPISERRORVECTOR
```
static final int SLPISERRORVECTOR
```
    See Also:
    
    Constant Field Values
  - SLPISMISCVECTOR
```
static final int SLPISMISCVECTOR
```
    See Also:
    
    Constant Field Values
  - SLPISEQUALSCOLUMN
```
static final int SLPISEQUALSCOLUMN
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEPROTECT
```
static final int NLPPRESOLVEPROTECT
```
    See Also:
    
    Constant Field Values
  - SLPHASCONVERGED
```
static final int SLPHASCONVERGED
```
    See Also:
    
    Constant Field Values
  - SLPACTIVESTEPBOUND
```
static final int SLPACTIVESTEPBOUND
```
    See Also:
    
    Constant Field Values
  - SLPACTIVESBROW
```
static final int SLPACTIVESBROW
```
    See Also:
    
    Constant Field Values
  - SLPELIMINATEDCOL
```
static final int SLPELIMINATEDCOL
```
    See Also:
    
    Constant Field Values
  - SLPISSTRUCTURALCOLUMN
```
static final int SLPISSTRUCTURALCOLUMN
```
    See Also:
    
    Constant Field Values
  - SLPISINCOEFS
```
static final int SLPISINCOEFS
```
    See Also:
    
    Constant Field Values
  - SLPISINGLOBAL
```
static final int SLPISINGLOBAL
```
    See Also:
    
    Constant Field Values
  - SLPHASZEROBOUND
```
static final int SLPHASZEROBOUND
```
    See Also:
    
    Constant Field Values
  - SLPFIXEDVAR
```
static final int SLPFIXEDVAR
```
    See Also:
    
    Constant Field Values
  - SLPBOUNDSSET
```
static final int SLPBOUNDSSET
```
    See Also:
    
    Constant Field Values
  - SLPUSEFULDELTA
```
static final int SLPUSEFULDELTA
```
    See Also:
    
    Constant Field Values
  - SLPNOUSEFULDELTA
```
static final int SLPNOUSEFULDELTA
```
    See Also:
    
    Constant Field Values
  - SLPISINTEGER
```
static final int SLPISINTEGER
```
    See Also:
    
    Constant Field Values
  - SLPCASCADECONTRACTION
```
static final int SLPCASCADECONTRACTION
```
    See Also:
    
    Constant Field Values
  - SLPISUPDATEROW
```
static final int SLPISUPDATEROW
```
    See Also:
    
    Constant Field Values
  - SLPISPENALTYROW
```
static final int SLPISPENALTYROW
```
    See Also:
    
    Constant Field Values
  - SLPISMISCROW
```
static final int SLPISMISCROW
```
    See Also:
    
    Constant Field Values
  - SLPISSBROW
```
static final int SLPISSBROW
```
    See Also:
    
    Constant Field Values
  - SLPHASPLUSERROR
```
static final int SLPHASPLUSERROR
```
    See Also:
    
    Constant Field Values
  - SLPHASMINUSERROR
```
static final int SLPHASMINUSERROR
```
    See Also:
    
    Constant Field Values
  - SLPHASERROR
```
static final int SLPHASERROR
```
    See Also:
    
    Constant Field Values
  - SLPISDETERMININGROW
```
static final int SLPISDETERMININGROW
```
    See Also:
    
    Constant Field Values
  - SLPNOERRORVECTORS
```
static final int SLPNOERRORVECTORS
```
    See Also:
    
    Constant Field Values
  - SLPHASNONZEROCOEF
```
static final int SLPHASNONZEROCOEF
```
    See Also:
    
    Constant Field Values
  - SLPREDUNDANTROW
```
static final int SLPREDUNDANTROW
```
    See Also:
    
    Constant Field Values
  - SLPUNCONVERGEDROW
```
static final int SLPUNCONVERGEDROW
```
    See Also:
    
    Constant Field Values
  - SLPACTIVEPENALTY
```
static final int SLPACTIVEPENALTY
```
    See Also:
    
    Constant Field Values
  - SLPHASSLPELEMENT
```
static final int SLPHASSLPELEMENT
```
    See Also:
    
    Constant Field Values
  - SLPTRANSFERROW
```
static final int SLPTRANSFERROW
```
    See Also:
    
    Constant Field Values
  - SLPMINIMUMAUGMENTATION
```
static final int SLPMINIMUMAUGMENTATION
```
    See Also:
    
    Constant Field Values
  - SLPEVENHANDEDAUGMENTATION
```
static final int SLPEVENHANDEDAUGMENTATION
```
    See Also:
    
    Constant Field Values
  - SLPEQUALITYERRORVECTORS
```
static final int SLPEQUALITYERRORVECTORS
```
    See Also:
    
    Constant Field Values
  - SLPALLERRORVECTORS
```
static final int SLPALLERRORVECTORS
```
    See Also:
    
    Constant Field Values
  - SLPPENALTYDELTAVECTORS
```
static final int SLPPENALTYDELTAVECTORS
```
    See Also:
    
    Constant Field Values
  - SLPAMEANWEIGHT
```
static final int SLPAMEANWEIGHT
```
    See Also:
    
    Constant Field Values
  - SLPSBFROMVALUES
```
static final int SLPSBFROMVALUES
```
    See Also:
    
    Constant Field Values
  - SLPSBFROMABSVALUES
```
static final int SLPSBFROMABSVALUES
```
    See Also:
    
    Constant Field Values
  - SLPSTEPBOUNDROWS
```
static final int SLPSTEPBOUNDROWS
```
    See Also:
    
    Constant Field Values
  - SLPALLROWERRORVECTORS
```
static final int SLPALLROWERRORVECTORS
```
    See Also:
    
    Constant Field Values
  - SLPNOUPDATEIFONLYIV
```
static final int SLPNOUPDATEIFONLYIV
```
    See Also:
    
    Constant Field Values
  - SLPNOFORMULADOMAINIV
```
@Deprecated
static final int SLPNOFORMULADOMAINIV
```
    Deprecated.
    since 44.00
    
    See Also:
    
    Constant Field Values
  - SLPSKIPIVLPHEURISTICS
```
static final int SLPSKIPIVLPHEURISTICS
```
    See Also:
    
    Constant Field Values
  - SLPNOSTEPBOUNDS
```
@Deprecated
static final int SLPNOSTEPBOUNDS
```
    Deprecated.
    since 48.00
    
    See Also:
    
    Constant Field Values
  - SLPSTEPBOUNDSASREQUIRED
```
@Deprecated
static final int SLPSTEPBOUNDSASREQUIRED
```
    Deprecated.
    since 48.00
    
    See Also:
    
    Constant Field Values
  - SLPESTIMATESTEPBOUNDS
```
static final int SLPESTIMATESTEPBOUNDS
```
    See Also:
    
    Constant Field Values
  - SLPDYNAMICDAMPING
```
static final int SLPDYNAMICDAMPING
```
    See Also:
    
    Constant Field Values
  - SLPHOLDVALUES
```
static final int SLPHOLDVALUES
```
    See Also:
    
    Constant Field Values
  - SLPRETAINPREVIOUSVALUE
```
static final int SLPRETAINPREVIOUSVALUE
```
    See Also:
    
    Constant Field Values
  - SLPRESETDELTAZ
```
static final int SLPRESETDELTAZ
```
    See Also:
    
    Constant Field Values
  - SLPQUICKCONVERGENCECHECK
```
static final int SLPQUICKCONVERGENCECHECK
```
    See Also:
    
    Constant Field Values
  - SLPESCALATEPENALTIES
```
static final int SLPESCALATEPENALTIES
```
    See Also:
    
    Constant Field Values
  - SLPSWITCHTOPRIMAL
```
static final int SLPSWITCHTOPRIMAL
```
    See Also:
    
    Constant Field Values
  - SLPNONZEROBOUND
```
static final int SLPNONZEROBOUND
```
    See Also:
    
    Constant Field Values
  - SLPMAXCOSTOPTION
```
static final int SLPMAXCOSTOPTION
```
    See Also:
    
    Constant Field Values
  - SLPRESIDUALERRORS
```
static final int SLPRESIDUALERRORS
```
    See Also:
    
    Constant Field Values
  - SLPNOLPPOLISHING
```
static final int SLPNOLPPOLISHING
```
    See Also:
    
    Constant Field Values
  - SLPCASCADEDBOUNDS
```
static final int SLPCASCADEDBOUNDS
```
    See Also:
    
    Constant Field Values
  - SLPCLAMPEXTENDEDACTIVESB
```
static final int SLPCLAMPEXTENDEDACTIVESB
```
    See Also:
    
    Constant Field Values
  - SLPCLAMPEXTENDEDALL
```
static final int SLPCLAMPEXTENDEDALL
```
    See Also:
    
    Constant Field Values
  - SLPMIPINITIALSLP
```
static final int SLPMIPINITIALSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPINITIALRELAXSLP
```
static final int SLPMIPINITIALRELAXSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPINITIALFIXSLP
```
static final int SLPMIPINITIALFIXSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPNODERELAXSLP
```
static final int SLPMIPNODERELAXSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPNODEFIXSLP
```
static final int SLPMIPNODEFIXSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPNODELIMITSLP
```
static final int SLPMIPNODELIMITSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPFINALRELAXSLP
```
static final int SLPMIPFINALRELAXSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPFINALFIXSLP
```
static final int SLPMIPFINALFIXSLP
```
    See Also:
    
    Constant Field Values
  - SLPMIPWITHINSLP
```
@Deprecated
static final int SLPMIPWITHINSLP
```
    Deprecated.
    since 48.00
    
    See Also:
    
    Constant Field Values
  - SLPSLPTHENMIP
```
@Deprecated
static final int SLPSLPTHENMIP
```
    Deprecated.
    since 48.00
    
    See Also:
    
    Constant Field Values
  - SLPROOTMIPDRIVEN
```
static final int SLPROOTMIPDRIVEN
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_CONVERGEDOBJUCC
```
static final int SLPSTATUS_CONVERGEDOBJUCC
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_CONVERGEDOBJSBX
```
static final int SLPSTATUS_CONVERGEDOBJSBX
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_LPINFEASIBLE
```
static final int SLPSTATUS_LPINFEASIBLE
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_LPUNFINISHED
```
static final int SLPSTATUS_LPUNFINISHED
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_MAXSLPITERATIONS
```
static final int SLPSTATUS_MAXSLPITERATIONS
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_INTEGERINFEASIBLE
```
static final int SLPSTATUS_INTEGERINFEASIBLE
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_RESIDUALPENALTIES
```
static final int SLPSTATUS_RESIDUALPENALTIES
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_CONVERGEDOBJOBJ
```
static final int SLPSTATUS_CONVERGEDOBJOBJ
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_MAXTIME
```
static final int SLPSTATUS_MAXTIME
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_USER
```
static final int SLPSTATUS_USER
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_VARSLINKEDINACTIVE
```
static final int SLPSTATUS_VARSLINKEDINACTIVE
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_NOVARSINACTIVE
```
static final int SLPSTATUS_NOVARSINACTIVE
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_OTOL
```
static final int SLPSTATUS_OTOL
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_VTOL
```
static final int SLPSTATUS_VTOL
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_XTOL
```
static final int SLPSTATUS_XTOL
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_WTOL
```
static final int SLPSTATUS_WTOL
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_ERROTOL
```
static final int SLPSTATUS_ERROTOL
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_EVTOL
```
static final int SLPSTATUS_EVTOL
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_POLISHED
```
static final int SLPSTATUS_POLISHED
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_POLISH_FAILURE
```
static final int SLPSTATUS_POLISH_FAILURE
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_ENFORCED
```
static final int SLPSTATUS_ENFORCED
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_CONSECUTIVE_INFEAS
```
static final int SLPSTATUS_CONSECUTIVE_INFEAS
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_KEEPBEST
```
static final int SLPSTATUS_KEEPBEST
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_CLAMPING
```
static final int SLPSTATUS_CLAMPING
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_ADAPTIVEITERS
```
static final int SLPSTATUS_ADAPTIVEITERS
```
    See Also:
    
    Constant Field Values
  - SLPSTATUS_OBJQNONCONVEX
```
static final int SLPSTATUS_OBJQNONCONVEX
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_UNSTARTED
```
static final int NLPSTATUS_UNSTARTED
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_SOLUTION
```
static final int NLPSTATUS_SOLUTION
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_LOCALLY_OPTIMAL
```
static final int NLPSTATUS_LOCALLY_OPTIMAL
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_OPTIMAL
```
static final int NLPSTATUS_OPTIMAL
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_NOSOLUTION
```
static final int NLPSTATUS_NOSOLUTION
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_LOCALLY_INFEASIBLE
```
static final int NLPSTATUS_LOCALLY_INFEASIBLE
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_INFEASIBLE
```
static final int NLPSTATUS_INFEASIBLE
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_UNBOUNDED
```
static final int NLPSTATUS_UNBOUNDED
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_UNFINISHED
```
static final int NLPSTATUS_UNFINISHED
```
    See Also:
    
    Constant Field Values
  - NLPSTATUS_UNSOLVED
```
static final int NLPSTATUS_UNSOLVED
```
    See Also:
    
    Constant Field Values
  - NLPSOLSTATUS_NONE
```
static final int NLPSOLSTATUS_NONE
```
    See Also:
    
    Constant Field Values
  - NLPSOLSTATUS_SOLUTION_NODUALS
```
static final int NLPSOLSTATUS_SOLUTION_NODUALS
```
    See Also:
    
    Constant Field Values
  - NLPSOLSTATUS_LOCALLYOPTIMAL_WITHDUALS
```
static final int NLPSOLSTATUS_LOCALLYOPTIMAL_WITHDUALS
```
    See Also:
    
    Constant Field Values
  - NLPSOLSTATUS_GLOBALLYOPTIMAL_NODUALS
```
static final int NLPSOLSTATUS_GLOBALLYOPTIMAL_NODUALS
```
    See Also:
    
    Constant Field Values
  - NLPSOLSTATUS_GLOBALLYOPTIMAL_WITHDUALS
```
static final int NLPSOLSTATUS_GLOBALLYOPTIMAL_WITHDUALS
```
    See Also:
    
    Constant Field Values
  - SLPGRIDENUMERATE
```
static final int SLPGRIDENUMERATE
```
    See Also:
    
    Constant Field Values
  - SLPGRIDCYCLIC
```
static final int SLPGRIDCYCLIC
```
    See Also:
    
    Constant Field Values
  - SLPGRIDANNEALING
```
static final int SLPGRIDANNEALING
```
    See Also:
    
    Constant Field Values
  - NLPRECALC
```
static final int NLPRECALC
```
    See Also:
    
    Constant Field Values
  - NLPTOLCALC
```
static final int NLPTOLCALC
```
    See Also:
    
    Constant Field Values
  - NLPALLCALCS
```
static final int NLPALLCALCS
```
    See Also:
    
    Constant Field Values
  - NLP2DERIVATIVE
```
static final int NLP2DERIVATIVE
```
    See Also:
    
    Constant Field Values
  - NLP1DERIVATIVE
```
static final int NLP1DERIVATIVE
```
    See Also:
    
    Constant Field Values
  - NLPALLDERIVATIVES
```
static final int NLPALLDERIVATIVES
```
    See Also:
    
    Constant Field Values
  - NLPINSTANCEFUNCTION
```
static final int NLPINSTANCEFUNCTION
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEOPS_GENERAL
```
static final int NLPPRESOLVEOPS_GENERAL
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEFIXZERO
```
static final int NLPPRESOLVEFIXZERO
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEFIXALL
```
static final int NLPPRESOLVEFIXALL
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVESETBOUNDS
```
static final int NLPPRESOLVESETBOUNDS
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEINTBOUNDS
```
static final int NLPPRESOLVEINTBOUNDS
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEDOMAIN
```
static final int NLPPRESOLVEDOMAIN
```
    See Also:
    
    Constant Field Values
  - SLPNOPRESOLVECOEFFICIENTS
```
static final int SLPNOPRESOLVECOEFFICIENTS
```
    See Also:
    
    Constant Field Values
  - SLPNOPRESOLVEDELTAS
```
static final int SLPNOPRESOLVEDELTAS
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEOPS_NO_DUAL_SIDE
```
static final int NLPPRESOLVEOPS_NO_DUAL_SIDE
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEOPS_ELIMINATIONS
```
static final int NLPPRESOLVEOPS_ELIMINATIONS
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEOPS_NOLINEAR
```
static final int NLPPRESOLVEOPS_NOLINEAR
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVEOPS_NOSIMPLIFIER
```
static final int NLPPRESOLVEOPS_NOSIMPLIFIER
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVELEVEL_LOCALIZED
```
static final int NLPPRESOLVELEVEL_LOCALIZED
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVELEVEL_BASIC
```
static final int NLPPRESOLVELEVEL_BASIC
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVELEVEL_LINEAR
```
static final int NLPPRESOLVELEVEL_LINEAR
```
    See Also:
    
    Constant Field Values
  - NLPPRESOLVELEVEL_FULL
```
static final int NLPPRESOLVELEVEL_FULL
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_ALL
```
static final int SLPCASCADE_ALL
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_COEF_VAR
```
static final int SLPCASCADE_COEF_VAR
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_ALL_COEF_VAR
```
static final int SLPCASCADE_ALL_COEF_VAR
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_STRUCT_VAR
```
static final int SLPCASCADE_STRUCT_VAR
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_ALL_STRUCT_VAR
```
static final int SLPCASCADE_ALL_STRUCT_VAR
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_SECONDARY_GROUPS
```
static final int SLPCASCADE_SECONDARY_GROUPS
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_DRCOL_PREVOUSVALUE
```
static final int SLPCASCADE_DRCOL_PREVOUSVALUE
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_DRCOL_PVRANGE
```
static final int SLPCASCADE_DRCOL_PVRANGE
```
    See Also:
    
    Constant Field Values
  - SLPCASCADE_AUTOAPPLY
```
static final int SLPCASCADE_AUTOAPPLY
```
    See Also:
    
    Constant Field Values
  - LOCALSOLVER_AUTO
```
static final int LOCALSOLVER_AUTO
```
    See Also:
    
    Constant Field Values
  - LOCALSOLVER_XSLP
```
static final int LOCALSOLVER_XSLP
```
    See Also:
    
    Constant Field Values
  - LOCALSOLVER_KNITRO
```
static final int LOCALSOLVER_KNITRO
```
    See Also:
    
    Constant Field Values
  - LOCALSOLVER_OPTIMIZER
```
static final int LOCALSOLVER_OPTIMIZER
```
    See Also:
    
    Constant Field Values
  - MSSET_INITIALVALUES
```
static final int MSSET_INITIALVALUES
```
    See Also:
    
    Constant Field Values
  - MSSET_SOLVERS
```
static final int MSSET_SOLVERS
```
    See Also:
    
    Constant Field Values
  - MSSET_SLP_BASIC
```
static final int MSSET_SLP_BASIC
```
    See Also:
    
    Constant Field Values
  - MSSET_SLP_EXTENDED
```
static final int MSSET_SLP_EXTENDED
```
    See Also:
    
    Constant Field Values
  - MSSET_KNITRO_BASIC
```
static final int MSSET_KNITRO_BASIC
```
    See Also:
    
    Constant Field Values
  - MSSET_KNITRO_EXTENDED
```
static final int MSSET_KNITRO_EXTENDED
```
    See Also:
    
    Constant Field Values
  - MSSET_INITIALFILTERED
```
static final int MSSET_INITIALFILTERED
```
    See Also:
    
    Constant Field Values
  - KKT_CALCULATION_RECALCULATE_RDJ
```
static final int KKT_CALCULATION_RECALCULATE_RDJ
```
    See Also:
    
    Constant Field Values
  - KKT_CALCULATION_MINIMZE_KKT_ERROR
```
static final int KKT_CALCULATION_MINIMZE_KKT_ERROR
```
    See Also:
    
    Constant Field Values
  - KKT_CALCULATION_MEASURE_BOTH
```
static final int KKT_CALCULATION_MEASURE_BOTH
```
    See Also:
    
    Constant Field Values
  - KKT_CALCULATION_ACTIVITY_BASED
```
static final int KKT_CALCULATION_ACTIVITY_BASED
```
    See Also:
    
    Constant Field Values
  - KKT_CALCULATION_RESPECT_BASIS
```
static final int KKT_CALCULATION_RESPECT_BASIS
```
    See Also:
    
    Constant Field Values
  - KKT_CALCULATION_ACTIVITY_BOTH
```
static final int KKT_CALCULATION_ACTIVITY_BOTH
```
    See Also:
    
    Constant Field Values
  - KKT_JUST_CALCULATE
```
static final int KKT_JUST_CALCULATE
```
    See Also:
    
    Constant Field Values
  - KKT_UPDATE_MULTIPLIERS
```
static final int KKT_UPDATE_MULTIPLIERS
```
    See Also:
    
    Constant Field Values
  - SLPBARSTARTOPS_STALLING_OBJECTIVE
```
static final int SLPBARSTARTOPS_STALLING_OBJECTIVE
```
    See Also:
    
    Constant Field Values
  - SLPBARSTARTOPS_STALLING_NUMERICAL
```
static final int SLPBARSTARTOPS_STALLING_NUMERICAL
```
    See Also:
    
    Constant Field Values
  - SLPBARSTARTOPS_ALLOWINTERIORSOLUTION
```
static final int SLPBARSTARTOPS_ALLOWINTERIORSOLUTION
```
    See Also:
    
    Constant Field Values
  - SLPBARSTARTOPS_POSTSOLVEFEASIBLITY
```
static final int SLPBARSTARTOPS_POSTSOLVEFEASIBLITY
```
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERION_NBSLPVAR
```
static final int SLPZEROCRITERION_NBSLPVAR
```
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERION_NBDELTA
```
static final int SLPZEROCRITERION_NBDELTA
```
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERION_SLPVARNBUPDATEROW
```
static final int SLPZEROCRITERION_SLPVARNBUPDATEROW
```
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERION_DELTANBUPSATEROW
```
static final int SLPZEROCRITERION_DELTANBUPSATEROW
```
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERION_DELTANBDRROW
```
static final int SLPZEROCRITERION_DELTANBDRROW
```
    See Also:
    
    Constant Field Values
  - SLPZEROCRITERION_PRINT
```
static final int SLPZEROCRITERION_PRINT
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_GENERALFIT
```
static final int SLPTRACEMASK_GENERALFIT
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_ROWS
```
static final int SLPTRACEMASK_ROWS
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_COLS
```
static final int SLPTRACEMASK_COLS
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_CASCADE
```
static final int SLPTRACEMASK_CASCADE
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_TYPE
```
static final int SLPTRACEMASK_TYPE
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_SLACK
```
static final int SLPTRACEMASK_SLACK
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_DUAL
```
static final int SLPTRACEMASK_DUAL
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_WEIGHT
```
static final int SLPTRACEMASK_WEIGHT
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_SOLUTION
```
static final int SLPTRACEMASK_SOLUTION
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_REDUCEDCOST
```
static final int SLPTRACEMASK_REDUCEDCOST
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_SLPVALUE
```
static final int SLPTRACEMASK_SLPVALUE
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_STEPBOUND
```
static final int SLPTRACEMASK_STEPBOUND
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_CONVERGE
```
static final int SLPTRACEMASK_CONVERGE
```
    See Also:
    
    Constant Field Values
  - SLPTRACEMASK_LINESEARCH
```
static final int SLPTRACEMASK_LINESEARCH
```
    See Also:
    
    Constant Field Values
  - SLPFILTER_KEEPBEST
```
@Deprecated
static final int SLPFILTER_KEEPBEST
```
    Deprecated.
    since 48.00
    
    See Also:
    
    Constant Field Values
  - SLPFILTER_CASCADE
```
static final int SLPFILTER_CASCADE
```
    See Also:
    
    Constant Field Values
  - SLPFILTER_ZEROLINESEARCH
```
static final int SLPFILTER_ZEROLINESEARCH
```
    See Also:
    
    Constant Field Values
  - SLPFILTER_ZEROLINESEARCHTR
```
static final int SLPFILTER_ZEROLINESEARCHTR
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_RECORDLINEARIZATION
```
static final int SLPANALYZE_RECORDLINEARIZATION
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_RECORDCASCADE
```
static final int SLPANALYZE_RECORDCASCADE
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_RECORDLINESEARCH
```
static final int SLPANALYZE_RECORDLINESEARCH
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_EXTENDEDFINALSUMMARY
```
static final int SLPANALYZE_EXTENDEDFINALSUMMARY
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_INFEASIBLE_ITERATION
```
static final int SLPANALYZE_INFEASIBLE_ITERATION
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_AUTOSAVEPOOL
```
static final int SLPANALYZE_AUTOSAVEPOOL
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_SAVELINEARIZATIONS
```
static final int SLPANALYZE_SAVELINEARIZATIONS
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_SAVEITERBASIS
```
static final int SLPANALYZE_SAVEITERBASIS
```
    See Also:
    
    Constant Field Values
  - SLPANALYZE_SAVEFILE
```
static final int SLPANALYZE_SAVEFILE
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_SLP2QP
```
static final int NLPREFORMULATE_SLP2QP
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_QP2SLP
```
static final int NLPREFORMULATE_QP2SLP
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_SLP2QCQP
```
static final int NLPREFORMULATE_SLP2QCQP
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_QCQP2SLP
```
static final int NLPREFORMULATE_QCQP2SLP
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_SOCP2SLP
```
static final int NLPREFORMULATE_SOCP2SLP
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_QPSOLVE
```
static final int NLPREFORMULATE_QPSOLVE
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_PWL
```
static final int NLPREFORMULATE_PWL
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_ABS
```
static final int NLPREFORMULATE_ABS
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_MINMAX
```
static final int NLPREFORMULATE_MINMAX
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_ALLABS
```
static final int NLPREFORMULATE_ALLABS
```
    See Also:
    
    Constant Field Values
  - NLPREFORMULATE_ALLMINMAX
```
static final int NLPREFORMULATE_ALLMINMAX
```
    See Also:
    
    Constant Field Values
  - SLPDELTA_CONT
```
static final int SLPDELTA_CONT
```
    See Also:
    
    Constant Field Values
  - SLPDELTA_SEMICONT
```
static final int SLPDELTA_SEMICONT
```
    See Also:
    
    Constant Field Values
  - SLPDELTA_INTEGER
```
static final int SLPDELTA_INTEGER
```
    See Also:
    
    Constant Field Values
  - SLPDELTA_EXPLORE
```
static final int SLPDELTA_EXPLORE
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_SLACK
```
static final int SLPROWINFO_SLACK
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_DUAL
```
static final int SLPROWINFO_DUAL
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_NUMPENALTYERRORS
```
static final int SLPROWINFO_NUMPENALTYERRORS
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_MAXPENALTYERROR
```
static final int SLPROWINFO_MAXPENALTYERROR
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_TOTALPENALTYERROR
```
static final int SLPROWINFO_TOTALPENALTYERROR
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_CURRENTPENALTYERROR
```
static final int SLPROWINFO_CURRENTPENALTYERROR
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_CURRENTPENALTYFACTOR
```
static final int SLPROWINFO_CURRENTPENALTYFACTOR
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_PENALTYCOLUMNPLUS
```
static final int SLPROWINFO_PENALTYCOLUMNPLUS
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_PENALTYCOLUMNPLUSVALUE
```
static final int SLPROWINFO_PENALTYCOLUMNPLUSVALUE
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_PENALTYCOLUMNPLUSDJ
```
static final int SLPROWINFO_PENALTYCOLUMNPLUSDJ
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_PENALTYCOLUMNMINUS
```
static final int SLPROWINFO_PENALTYCOLUMNMINUS
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_PENALTYCOLUMNMINUSVALUE
```
static final int SLPROWINFO_PENALTYCOLUMNMINUSVALUE
```
    See Also:
    
    Constant Field Values
  - SLPROWINFO_PENALTYCOLUMNMINUSDJ
```
static final int SLPROWINFO_PENALTYCOLUMNMINUSDJ
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_VALUE
```
static final int SLPCOLINFO_VALUE
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_RDJ
```
static final int SLPCOLINFO_RDJ
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_DELTAINDEX
```
static final int SLPCOLINFO_DELTAINDEX
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_DELTA
```
static final int SLPCOLINFO_DELTA
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_DELTADJ
```
static final int SLPCOLINFO_DELTADJ
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_UPDATEROW
```
static final int SLPCOLINFO_UPDATEROW
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_SB
```
static final int SLPCOLINFO_SB
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_SBDUAL
```
static final int SLPCOLINFO_SBDUAL
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_LPVALUE
```
static final int SLPCOLINFO_LPVALUE
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_DETROW
```
static final int SLPCOLINFO_DETROW
```
    See Also:
    
    Constant Field Values
  - SLPCOLINFO_CONVERGENCESTATUS
```
static final int SLPCOLINFO_CONVERGENCESTATUS
```
    See Also:
    
    Constant Field Values
  - USERFUNCTION_MAP
```
static final int USERFUNCTION_MAP
```
    See Also:
    
    Constant Field Values
  - USERFUNCTION_VECMAP
```
static final int USERFUNCTION_VECMAP
```
    See Also:
    
    Constant Field Values
  - USERFUNCTION_MULTIMAP
```
static final int USERFUNCTION_MULTIMAP
```
    See Also:
    
    Constant Field Values
  - USERFUNCTION_MAPDELTA
```
static final int USERFUNCTION_MAPDELTA
```
    See Also:
    
    Constant Field Values
  - USERFUNCTION_VECMAPDELTA
```
static final int USERFUNCTION_VECMAPDELTA
```
    See Also:
    
    Constant Field Values
  - USERFUNCTION_MULTIMAPDELTA
```
static final int USERFUNCTION_MULTIMAPDELTA
```
    See Also:
    
    Constant Field Values
  - NLPUSERFUNCNAMES
```
static final int NLPUSERFUNCNAMES
```
    See Also:
    
    Constant Field Values
  - NLPINTERNALFUNCNAMES
```
static final int NLPINTERNALFUNCNAMES
```
    See Also:
    
    Constant Field Values
  - NLPUSERFUNCNAMESNOCASE
```
static final int NLPUSERFUNCNAMESNOCASE
```
    See Also:
    
    Constant Field Values
  - NLPINTERNALFUNCNAMESNOCASE
```
static final int NLPINTERNALFUNCNAMESNOCASE
```
    See Also:
    
    Constant Field Values
  - NLPFORMULACOEFFCOLUMNINDEX
```
static final int NLPFORMULACOEFFCOLUMNINDEX
```
    See Also:
    
    Constant Field Values
  - NLPOBJECTIVEROWINDEX
```
static final int NLPOBJECTIVEROWINDEX
```
    See Also:
    
    Constant Field Values
  - NLPSOLVER_AUTOMATIC
```
static final int NLPSOLVER_AUTOMATIC
```
    See Also:
    
    Constant Field Values
  - NLPSOLVER_LOCAL
```
static final int NLPSOLVER_LOCAL
```
    See Also:
    
    Constant Field Values
  - NLPSOLVER_GLOBAL
```
static final int NLPSOLVER_GLOBAL
```
    See Also:
    
    Constant Field Values
  - SLPSTEPBOUNDING_NEVER
```
static final int SLPSTEPBOUNDING_NEVER
```
    See Also:
    
    Constant Field Values
  - SLPSTEPBOUNDING_ALWAYS
```
static final int SLPSTEPBOUNDING_ALWAYS
```
    See Also:
    
    Constant Field Values
  - SLPSTEPBOUNDING_ASREQUIRED
```
static final int SLPSTEPBOUNDING_ASREQUIRED
```
    See Also:
    
    Constant Field Values
  - SLPMISLPALGORITHM_AUTOMATIC
```
static final int SLPMISLPALGORITHM_AUTOMATIC
```
    See Also:
    
    Constant Field Values
  - SLPMISLPALGORITHM_SLPINMIP
```
static final int SLPMISLPALGORITHM_SLPINMIP
```
    See Also:
    
    Constant Field Values
  - SLPMISLPALGORITHM_MIPINSLP
```
static final int SLPMISLPALGORITHM_MIPINSLP
```
    See Also:
    
    Constant Field Values
  - SLPMISLPALGORITHM_SLPMIPSLP
```
static final int SLPMISLPALGORITHM_SLPMIPSLP
```
    See Also:
    
    Constant Field Values
  - SLPRETURNSOLUTION_AUTOMATIC
```
static final int SLPRETURNSOLUTION_AUTOMATIC
```
    See Also:
    
    Constant Field Values
  - SLPRETURNSOLUTION_BEST
```
static final int SLPRETURNSOLUTION_BEST
```
    See Also:
    
    Constant Field Values
  - SLPRETURNSOLUTION_FINALITERATE
```
static final int SLPRETURNSOLUTION_FINALITERATE
```
    See Also:
    
    Constant Field Values
  - Version
```
static final int Version
```
    See Also:
    
    Constant Field Values
  - VersionMajor
```
static final int VersionMajor
```
    See Also:
    
    Constant Field Values
  - VersionMinor
```
static final int VersionMinor
```
    See Also:
    
    Constant Field Values
  - VersionBuild
```
static final int VersionBuild
```
    See Also:
    
    Constant Field Values
  - VersionFull
```
static final int VersionFull
```
    See Also:
    
    Constant Field Values
  - IFUN_LOG
```
@Deprecated
static final int IFUN_LOG
```
    Deprecated.
    since 43.00
    
    See Also:
    
    Constant Field Values

© 2001-2026 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

MAXBANNERLENGTH

XPVERSION

XPVERSION_MAJOR

XPVERSION_MINOR

XPVERSION_BUILD

XPVERSION_FULL

MAXMESSAGELENGTH

DEFAULT_BRANCHING_PRIORITY

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

BARSOLUTION

CROSSOVER

BARITERLIMIT

CHOLESKYALG

BAROUTPUT

EXTRAMIPENTS

REFACTOR

BARTHREADS

KEEPBASIS

CROSSOVEROPS

VERSION

CROSSOVERTHREADS

BIGMMETHOD

ELIMFILLIN

PRESOLVEOPS

MIPPRESOLVE

MIPTHREADS

BARORDER

BREADTHFIRST

AUTOPERTURB

DENSECOLLIMIT

CALLBACKFROMMAINTHREAD

MAXMCOEFFBUFFERELEMS

REFINEOPS

LPREFINEITERLIMIT

MIPREFINEITERLIMIT

DUALIZEOPS

CROSSOVERITERLIMIT

PREBASISRED

PRESORT

PREPERMUTE

PREPERMUTESEED

MAXMEMORYSOFT

CUTFREQ

SYMSELECT

SYMMETRY

MAXMEMORYHARD