XPRSconstants

Constant used in enumeration 'DEFAULTALG'

Constant used in enumeration 'DEFAULTALG'

Constant used in enumeration 'DEFAULTALG'

Constant used in enumeration 'CHOLESKYALG'

The algorithm to be used for the clean up step after the network simplex solver.

Constant used in enumeration 'enum_allow_compute'

Constant used in enumeration 'enum_allow_compute'

Constant used in enumeration 'ALWAYSNEVERAUTOMATIC'

A measure between 0 and 1 for how numerically unstable the problem is.

Simplex: This indicates whether automatic perturbation is performed.

The amount of heap memory detected by Xpress as free.

Constant used in enumeration 'BACKTRACKALG'

Constant used in enumeration 'BACKTRACKALG'

Constant used in enumeration 'BACKTRACKALG'

Constant used in enumeration 'BACKTRACKALG'

Constant used in enumeration 'BACKTRACKALG'

Branch and Bound: Specifies how to break ties when selecting the next node to work on when a full backtrack is performed.

Constant used in enumeration 'BARORDER'

Constant used in enumeration 'BARORDER'

This control determines which barrier algorithm is to be used to solve the problem.

Absolute condition measure calculated in the last iteration of the barrier algorithm.

If set to a positive integer it determines the number of physical CPU cores assumed to be present in the system by the barrier algorithm.

Indicates whether or not the basis crossover phase has been entered.

Sum of the dual infeasibilities for the Newton barrier algorithm.

Newton barrier: This is a convergence parameter, representing the tolerance for dual infeasibilities.

Defines how the barrier algorithm scales free variables.

Newton barrier: The target tolerance for the relative duality gap.

Number of Newton barrier iterations.

Newton barrier: Defines how centrality is weighted in the barrier algorithm.

Number of nonzeros in L resulting from the Cholesky factorization.

Defines how the barrier perturbs the objective.

Newton barrier: This controls the Cholesky factorization in the Newton-Barrier.

Newton barrier: This specifies the level of solution output provided.

Newton barrier: This controls the Newton-Barrier specific presolve operations.

Constant used in enumeration 'BARPRESOLVEOPS'

Primal objective value calculated by the Newton barrier algorithm.

Newton barrier: After terminating the barrier algorithm, further refinement steps can be performed.

Defines how the barrier scales the right hand side.

Regularized number of linearly dependent binding constraints at the optimal barrier solution.

Newton barrier: Controls the computation of the starting point for the barrier algorithm.

Newton barrier: A convergence parameter, representing the minimal step size.

Value of the best bound determined so far by the MIP search.

Simplex: This specifies whether to use the "Big M" method, or the standard phase I (achieving feasibility) and phase II (achieving optimality).

Constant used in enumeration 'ONOFF'

Constant used in enumeration 'BRANCHCHOICE'

Once a MIP entity has been selected for branching, this control determines which of the branches is solved first.

Branch and Bound: Determines whether the optimizer should search for special structure in the problem to branch on during the branch and bound search.

The branching variable at a node of the Branch and Bound tree.

Deprecated. 

This attribute counts the number of times the cut manager callback set by XPRSaddcbcutmgr has been called for the current node, including the current callback call.

Branch and Bound: specifies whether the MIP callbacks should only be called on the master thread.

This attribute is used to set the value of the MAXCHECKSONMAXCUTTIME control.

Newton barrier: type of Cholesky factorization used.

This control allows for the adjustment of returned solution values such that they are always within bounds.

Constant used in enumeration 'CLAMPING'

Constant used in enumeration 'CLAMPING'

Controls whether the next solve is performed directly or on an Insight Compute Interface.

The number of solves executed on a compute server.

Controls how the run log is fetched when a solve is performed on an Insight Compute Interface.

Constant used in enumeration 'enum_compute_log'

Constant used in enumeration 'enum_compute_log'

Control of type Integer.

Determines the number of threads used by the concurrent solver.

Number of second order and rotated second order cones in the problem.

Number of logical cores detected by the optimizer, which is the total number of threads the hardware can execute across all CPUs.

Number of logical cores per CPU unit detected by the optimizer, which is the number of threads each CPU can execute.

decay term for confined primal integral computation.

Newton Barrier: Selects the AMD, Intel x86 or ARM vectorization instruction set that Barrier should run optimized code for.

How time should be measured when timings are reported in the log and when checking against time limits

Newton barrier: This control determines whether the barrier method will cross over to the simplex method when at optimal solution has been found, to provide an end basis (see XPRSgetbasis, XPRSwritebasis) and advanced sensitivity analysis information (see XPRSobjsa, XPRSrhssa, XPRSbndsa).

Control of type Integer.

Newton barrier: The maximum number of iterations that will be performed in the crossover procedure before the optimization process terminates.

Control of type Double.

Determines the maximum number of threads that parallel crossover is allowed to use.

The unique identifier of the current node in the tree search.

Branch and Bound: Sets the maximum depth in the tree search at which cuts will be generated.

Branch and Bound: This specifies the frequency at which cuts are generated in the tree search.

A bit vector providing detailed control of the cuts created for the root node of a MIP solve.

Constant used in enumeration 'CUTSELECT'

Constant used in enumeration 'CUTSELECT'

Constant used in enumeration 'CUTSELECT'

Constant used in enumeration 'CUTSELECT'

Branch and Bound: This specifies the cut strategy.

Constant used in enumeration 'CUTSTRATEGY'

Constant used in enumeration 'CUTSTRATEGY'

This selects the algorithm that will be used to solve the LP if no algorithm flag is passed to the optimization routines.

Selects whether to use a deterministic or opportunistic mode when solving a problem using multiple threads.

Simplex: This specifies the dual simplex pricing method.

Constant used in enumeration 'DUALGRADIENT'

Number of dual infeasibilities.

Bit-vector control for adjusting the behavior when a problem is dualized.

The factor by which the problem will be perturbed prior to optimization by dual simplex.

Constant used in enumeration 'DUALSTRATEGY'

Determines the maximum number of threads that dual simplex is allowed to use.

A quadratic matrix is considered not to be positive semi-definite, if its smallest eigenvalue is smaller than the negative of this value.

Amount of fill-in allowed when performing an elimination in presolve .

The most recent Optimizer error number that occurred.

Tolerance on eta elements.

The initial number of extra matrix elements to allow for in the matrix, including coefficients for cuts.

The initial number of extra rows to allow for in the matrix, including cuts.

The initial number of extra sets to allow for in the matrix.

Branch and Bound: Decides if the Feasibility Pump heuristic should be run at the top node.

Constant used in enumeration 'FEASIBILITYPUMP'

Constant used in enumeration 'FEASIBILITYPUMP'

This tolerance determines how much a feasible primal basic solution is allowed to be perturbed when performing basis changes.

Certain names in the problem object may be incompatible with different file formats (such as names containing spaces for LP files).

Number of general constraints in the problem.

Constant used in enumeration 'GENCONSTYPE'

Constant used in enumeration 'GENCONSTYPE'

This control specifies the reformulation method for absolute value general constraints at the beginning of the search.

Number of constant values in general constraints in the problem.

Constant used in enumeration 'GLOBALBOUNDINGBOX'

Constant used in enumeration 'GLOBALBOUNDINGBOX'

Number of nonlinear infeasibilities at the current node of a global solve, measured as the number of violated atomic formulas.

Branch and Bound: The number of rounds of Gomory or lift-and-project cuts at the top node.

Branch and Bound: Sets the maximum depth in the tree search at which heuristics will be used to find MIP solutions.

The level of randomization to apply in the diving heuristic.

Branch and Bound: Changes the emphasis of the diving heuristic from solution quality to diving speed.

Branch and Bound: This control specifies an emphasis for the search w.r.t.

Branch and Bound: This specifies the frequency at which heuristics are used in the tree search.

Branch and Bound: This specifies the maximum number of nodes at which heuristics are used in the tree search.

Constant used in enumeration 'HEURSEARCHSELECT'

Adjusts the overall level of the local search heuristics.

How frequently to run the local search heuristic during root cutting.

Control of type Double.

Control of type Integer.

Constant used in enumeration 'HEURSTRATEGY'

Constant used in enumeration 'HEURSTRATEGY'

Branch and Bound: The number of threads to dedicate to running heuristics on the root node.

Determines if the convexity of the problem is checked before optimization.

Control of type Integer.

During presolve, indicator constraints will be linearized using a BigM coefficient whenever that BigM coefficient is small enough.

The tolerance on input values elements.

Simplex: The frequency with which the basis will be inverted.

The maximum number of seconds to wait for an I/O operation before it is cancelled.

Bit field flag 'IsUserSolution' for MipSolPool Solution

Simplex: This determines which basis to use for the next iteration.

Deprecated. 

Number of iterations to perform in improving each lift-and-project cut.

Controls when to perform a local backtrack between the two child nodes during a dive in the branch and bound tree.

Constant used in enumeration 'LPSTATUS'

Constant used in enumeration 'LPSTATUS'

Constant used in enumeration 'LPSTATUS'

Constant used in enumeration 'LPSTATUS'

A bit-vector control which defines the algorithm for solving an LP problem or the initial LP relaxation of a MIP problem.

Constant used in enumeration 'LPFLAGS'

Constant used in enumeration 'LPFLAGS'

The maximum number of iterations that will be performed by primal simplex or dual simplex before the optimization process terminates.

Time interval between two LP log lines.

Value of the objective function of the last LP solved.

LP solution status.

The Markowitz tolerance used for the factorization of the basis matrix.

The zero tolerance on matrix elements.

Maximum calculated absolute primal infeasibility in the unscaled original problem.

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 function controls the number of Irreducible Infeasible Sets to be found using the XPRSiisall ( IIS -a).

Deprecated. 

Branch-and-Bound: How far back up the current dive path the optimizer is allowed to look for a local backtrack candidate node.

This control sets the maximum amount of memory in megabytes the optimizer should allocate.

Maximum integer fractionality in the solution.

Branch-and-Bound: The maximum number of tasks to run in parallel during a MIP solve.

Number of lines between page breaks in printable output.

Maximum calculated relative dual infeasibility in the unscaled original problem.

This determines the maximum scaling factor that can be applied during scaling.

Deprecated. 

The detected amount of memory accessible to the solver process, in megabytes.

Constant used in enumeration 'MIPSTATUS'

Constant used in enumeration 'MIPSTATUS'

Constant used in enumeration 'MIPSTATUS'

Constant used in enumeration 'MIPSTATUS'

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.

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.

Branch and Bound: The absolute tolerance determining whether the tree search will continue or not.

Objective function value of the best integer solution found.

Sets the node limit for when a winning solve is selected when concurrent MIP solves are enabled.

Branch and Bound: Limits operations that can reduce the MIP solution space.

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.

Branch and Bound: Specifies how frequently the basis condition number (also known as kappa) should be calculated during the branch-and-bound search.

Objective function value of the last integer solution found.

Constant used in enumeration 'MIPPRESOLVE'

Constant used in enumeration 'MIPPRESOLVE'

Constant used in enumeration 'MIPPRESOLVE'

Constant used in enumeration 'MIPPRESOLVE'

Controls the strategy used by the parallel MIP solver during the ramp-up phase of a branch-and-bound tree search.

Branch and Bound: Percentage of the LP solution value to be added to the value of the objective function when an integer solution is found, to give the new value of CURRMIPCUTOFF.

Branch and Bound: This determines when the branch and bound tree search will terminate.

Constant used in enumeration 'MIPRESTART'

Constant used in enumeration 'MIPRESTART'

Branch and Bound: Fine tune initial conditions to trigger an in-tree restart.

Node at which the last integer feasible solution was found.

Time at which the last integer feasible solution was found.

Branch and Bound: How a MIP solve should be stopped on early termination when there are still active tasks in the system.

If set to a positive integer it determines the number of threads implemented to run the parallel MIP code.

Target MIPTOL value used by the automatic MIP solution refiner as defined by REFINEOPS.

Provides compatibility of MPS file output for older MPS readers.

Determines whether comments in MPS matrix files are to be printed out during matrix input.

Control of type Integer.

When reading an MPS file, this control determines which entries from the RANGES section will be read.

Control of type Integer.

Control of type Integer.

Attribute of type Integer.

Attribute of type Integer.

Control of type Integer.

Attribute of type Integer.

Control of type Double.

Control of type Integer.

Control of type Integer.

Attribute of type Integer.

Control of type Integer.

Control of type Double.

Attribute of type Integer.

Attribute of type Integer.

Attribute of type Integer.

Attribute of type Double.

Attribute of type Double.

Control of type Integer.

Log level for multi-objective optimization.

Constant used in enumeration 'MULTIOBJOPS'

Constant used in enumeration 'MULTIOBJOPS'

Constant used in enumeration 'NAMESPACES'

Constant used in enumeration 'NAMESPACES'

Constant used in enumeration 'NAMESPACES'

Constant used in enumeration 'NAMESPACES'

Constant used in enumeration 'NAMESPACES'

Determines the addition of multi-commodity network cuts to a problem.

Adjusts the overall level of node probing.

Branch and Bound: This determines which nodes will be considered for solution once the current node has been solved.

Constant used in enumeration 'NODESELECTION'

Constant used in enumeration 'NODESELECTION'

How much emphasis to place on numerical stability instead of solve speed.

Constant used in enumeration 'enum_obj_sense'

Constant used in enumeration 'OBJCONTROL'

Constant used in enumeration 'OBJCONTROL'

Constant used in enumeration 'OBJCONTROL'

Number of objectives in the problem.

Fixed part of the objective function.

Sense of the optimization being performed.

Value of the objective function of the last problem solved with XPRSoptimize.

Simplex: This is the zero tolerance for reduced costs.

Constant used in enumeration 'OPTIMIZETYPE'

Constant used in enumeration 'OPTIMIZETYPE'

The type of solver used in the last call to XPRSoptimize, XPRSmipoptimize, XPRSlpoptimize or XPRSnlpoptimize.

Number of input variables in general constraints in the original problem before presolving.

Number of constant values in general constraints in the original problem before presolving.

Number of MIP entities (i.e.

Number of piecewise linear constraints in the original problem before presolving.

Number of rows with quadratic coefficients in the original matrix before presolving.

Number of rows (i.e.

Number of special ordered sets in the original matrix before presolving.

This controls the level of output produced by the Optimizer during optimization.

Constant used in enumeration 'OUTPUTLOG'

Constant used in enumeration 'OUTPUTLOG'

Zero tolerance on print values.

An estimate of the peak amount of dynamically allocated heap memory by the problem.

Minimum absolute penalty variable coefficient.

The total number of physical cores across all CPUs detected by the optimizer.

Simplex: The zero tolerance for matrix elements.

The partial pricing candidate list sizing parameter.

Determines if a lattice basis reduction algorithm should be attempted as part of presolve

Determines if convex quadratic contraints should be used for inferring bound reductions on variables when solving a MIP.

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.

Constant used in enumeration 'PRECOEFELIM'

Presolve: determines whether small independent components should be detected and solved as individual subproblems during root node processing.

Presolve: decompose regular and rotated cones with more than two elements and apply Outer Approximation on the resulting components.

Presolve: reformulate problem with non-diagonal quadratic objective and/or constraints as diagonal quadratic or second-order conic constraints.

Presolve: Determines the level of dominated column removal reductions to perform when presolving a mixed integer problem.

Constant used in enumeration 'PREDOMCOL'

Constant used in enumeration 'PREDOMCOL'

Constant used in enumeration 'PREDOMROW'

Constant used in enumeration 'PREDOMROW'

Constant used in enumeration 'PREDOMROW'

Presolve: Allows for elimination of quadratic variables via doubleton rows.

Presolve: Determines whether to use implication structures to remove redundant rows.

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 control sets the seed for the pseudo-random number generator for permuting the problem when starting the presolve.

Constant used in enumeration 'PREPROBING'

Constant used in enumeration 'PREPROBING'

Constant used in enumeration 'PREPROBING'

This control determines whether presolving should be performed prior to starting the main algorithm.

Constant used in enumeration 'PRESOLVE'

Constant used in enumeration 'PRESOLVE'

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.

Constant used in enumeration 'PRESOLVEOPS'

Constant used in enumeration 'PRESOLVEOPS'

Constant used in enumeration 'PRESOLVEOPS'

Constant used in enumeration 'PRESOLVEOPS'

Constant used in enumeration 'PRESOLVEOPS'

Constant used in enumeration 'PRESOLVEOPS'

Constant used in enumeration 'PRESOLVEOPS'

Constant used in enumeration 'PRESOLVEOPS'

Problem status as a bit map.

Constant used in enumeration 'PRESOLVESTATE'

Constant used in enumeration 'PRESOLVESTATE'

Constant used in enumeration 'PRICING'

Constant used in enumeration 'PRICING'

Value of the primal-dual integral.

Primal simplex: allows fine tuning the variable selection in the primal simplex solver.

Determines whether primal is allowed to call dual to unshift.

Constant used in enumeration 'PRIMALUNSHIFT'

Number of piecewise linear constraints in the problem.

This control specifies the reformulation method for piecewise linear constraints at the beginning of the search.

Branch and Bound: Limit on the number of rounds of outer approximation cuts generated for the root node, when solving a mixed integer quadratic constrained or mixed integer second order conic problem with outer approximation.

Number of rows with quadratic coefficients in the matrix.

Constant used in enumeration 'QCONVEXITY'

Constant used in enumeration 'QCONVEXITY'

Constant used in enumeration 'QCONVEXITY'

Number of quadratic elements in the matrix.

Determines whether an extra solution purification step is called after a solution found by the quadratic simplex (either primal or dual).

Active range name.

Indicates whether the optimization should restart using the current representation of the factorization in memory.

Constant used in enumeration 'REFINEOPS'

Constant used in enumeration 'REFINEOPS'

Constant used in enumeration 'REFINEOPS'

Constant used in enumeration 'REFINEOPS'

Constant used in enumeration 'REFINEOPS'

Constant used in enumeration 'REFINEOPS'

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.

Controls if the optimizer should make indefinite quadratic matrices positive definite when it is possible.

Constant used in enumeration 'REPAIRINDEFINITEQ'

Deprecated. 

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.

Active right hand side name.

Constant used in enumeration 'ROWFLAG'

Constant used in enumeration 'ROWFLAG'

Constant used in enumeration 'ROWFLAG'

Number of infeasible MIP entities to initialize pseudo costs for on each node.

Branch and Bound: How to calculate pseudo costs from the local node when selecting an infeasible MIP entity to branch on.

The size of the candidate list of MIP entities for strong branching.

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Constant used in enumeration 'SCALING'

Number of variables within special ordered sets (set members) in the matrix.

Determines whether to enable sifting algorithm with the dual simplex method.

Determines the presolve operations for solving the subproblems during the sifting algorithm.

Number of simplex iterations performed.

Constant used in enumeration 'SOLINFO'

Constant used in enumeration 'SOLINFO'

Constant used in enumeration 'SOLINFO'

Status of the solution of the last problem solved with XPRSoptimize.

Constant used in enumeration 'SOLSTATUS'

Constant used in enumeration 'SOLSTATUS'

The maximum time in seconds that the Optimizer will run a MIP solve before it terminates, given that a solution has been found.

Status of the solve of the last problem solved with XPRSoptimize.

Constant used in enumeration 'SOLVESTATUS'

Constant used in enumeration 'SOLVESTATUS'

Number of spare columns in the matrix.

Number of spare MIP entities in the matrix.

Number of spare set elements in the matrix.

Constant used in enumeration 'enum_stop_type'

Constant used in enumeration 'enum_stop_type'

Constant used in enumeration 'enum_stop_type'

Constant used in enumeration 'enum_stop_type'

Constant used in enumeration 'enum_stop_type'