XpressProblem Class
Optimizer interface that allows modeling by objects.
Inheritance Hierarchy
Namespace: Optimizer.Objects
Assembly: xprsdn (in xprsdn.dll) Version: 44.01.01
Syntax
C#
public class XpressProblem : XPRSprob
The XpressProblem type exposes the following members.
Constructors
| Name | Description | |
|---|---|---|
 |
XpressProblem() |
Create a new problem without internal name. If not yet done then Xpress is initialized with the license found at the default license location. If Xpress is initialized this way then it will be automatically de-initialized once the newly created problem instance is closed.
|
|
XpressProblem(String) |
Create a new problem with internal name. If not yet done then Xpress is initialized with the license found at the default license location. If Xpress is initialized this way then it will be automatically de-initialized once the newly created problem instance is closed.
|
|
XpressProblem(IntPtr, XpressProblem) |
Create a problem that wraps a native callback problem.
|
|
XpressProblem(String, String) |
Create a new problem with internal name and non-default license. If not yet done then Xpress is initialized with the license found at
licensePath. If Xpress is initialized this way then it will be automatically de-initialized once the newly created problem instance is closed.
|
Properties
| Name | Description | |
|---|---|---|
 |
ActiveNodes |
Number of outstanding nodes.
(Inherited from XPRSprob.) |
|
AlgAfterCrossOver |
The algorithm to be used for the final clean up step after the crossover.
(Inherited from XPRSprob.) |
|
AlgAfterNetwork |
The algorithm to be used for the clean up step after the network simplex solver.
(Inherited from XPRSprob.) |
|
Algorithm |
The algorithm the optimizer currently is running / was running just before completition.
(Inherited from XPRSprob.) |
|
AlternativeRedCosts |
Controls aggressiveness of searching for alternative reduced cost
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
AutoScaling |
Whether the Optimizer should automatically select between different scaling algorithms. If the
SCALING control is set, no automatic scaling will be applied.
(Inherited from XPRSprob.) |
|
AvailableMemory |
The amount of heap memory detected by Xpress as free.
(Inherited from XPRSprob.) |
|
BackgroundMaxThreads |
Limit the number of threads to use in background jobs (for example in parallel to the root cut loop).
(Inherited from XPRSprob.) |
|
BackgroundSelect |
Select which tasks to run in background jobs (for example in parallel to the root cut loop).
(Inherited from XPRSprob.) |
|
BackTrack |
Branch and Bound: Specifies how to select the next node to work on when a full backtrack is performed.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarAASize |
Number of nonzeros in AA
T.
(Inherited from XPRSprob.) |
|
BarAlg |
This control determines which barrier algorithm is used to solve the problem.
(Inherited from XPRSprob.) |
|
BarCGap |
Convergence criterion for the Newton barrier algorithm.
(Inherited from XPRSprob.) |
|
BarCondA |
Absolute condition measure calculated in the last iteration of the barrier algorithm.
(Inherited from XPRSprob.) |
|
BarCondD |
Condition measure calculated in the last iteration of the barrier algorithm.
(Inherited from XPRSprob.) |
|
BarCores |
If set to a positive integer it determines the number of physical CPU cores assumed to be present in the system by the barrier and hybrid gradient algorithms. If the value is set to the default value (
-1), Xpress will automatically detect the number of cores.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarCrossover |
Indicates whether or not the basis crossover phase has been entered.
(Inherited from XPRSprob.) |
|
BarDenseCol |
Number of dense columns found in the matrix.
(Inherited from XPRSprob.) |
|
BarDualInf |
Sum of the dual infeasibilities for the Newton barrier algorithm.
(Inherited from XPRSprob.) |
|
BarDualObj |
Dual objective value calculated by the Newton barrier algorithm.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarFailIterLimit |
Newton barrier: The maximum number of consecutive iterations that fail to improve the solution in the barrier algorithm.
(Inherited from XPRSprob.) |
|
BarFreeScale |
Defines how the barrier algorithm scales free variables.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarhgOps |
Control 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 infinity 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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarIter |
Number of Newton barrier iterations.
(Inherited from XPRSprob.) |
|
BarIterLimit |
Newton barrier: The maximum number of iterations. While the simplex method usually performs a number of iterations which is proportional to the number of constraints (rows) in a problem, the barrier method standardly finds the optimal solution to a given accuracy after a number of iterations which is independent of the problem size. The penalty is rather that the time for each iteration increases with the size of the problem.
BARITERLIMIT specifies the maximum number of iterations which will be carried out by the barrier.
(Inherited from XPRSprob.) |
|
BarKernel |
Newton barrier: Defines how centrality is weighted in the barrier algorithm.
(Inherited from XPRSprob.) |
|
BarLargeBound |
Threshold for the barrier to handle large bounds.
(Inherited from XPRSprob.) |
|
BarLSize |
Number of nonzeros in L resulting from the Cholesky factorization.
(Inherited from XPRSprob.) |
|
BarNumStability |
Control BARNUMSTABILITY.
(Inherited from XPRSprob.) |
|
BarObjPerturb |
Defines how the barrier perturbs the objective.
(Inherited from XPRSprob.) |
|
BarObjScale |
Defines how the barrier scales the objective.
(Inherited from XPRSprob.) |
|
BarOrder |
Newton barrier: This controls the Cholesky factorization in the Newton-Barrier.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarPerturb |
Newton barrier: In numerically challenging cases it is often advantageous to apply perturbations on the KKT system to improve its numerical properties.
BARPERTURB controlls how much perturbation is allowed during the barrier iterations. By default no perturbation is allowed. Set this parameter with care as larger perturbations may lead to less efficient iterates and the best settings are problem-dependent.
(Inherited from XPRSprob.) |
|
BarPresolveOps |
Newton barrier: This controls the Newton-Barrier specific presolve operations.
(Inherited from XPRSprob.) |
|
BarPrimalInf |
Sum of the primal infeasibilities for the Newton barrier algorithm.
(Inherited from XPRSprob.) |
|
BarPrimalObj |
Primal objective value calculated by the Newton barrier algorithm.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarRegularize |
This control determines how the barrier algorithm applies regularization on the KKT system.
(Inherited from XPRSprob.) |
|
BarRhsScale |
Defines how the barrier scales the right hand side.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarStart |
Controls the computation of the starting point and warm-starting for the Newton barrier and the hybrid gradient algorithms.
(Inherited from XPRSprob.) |
|
BarStartWeight |
Newton barrier: This sets a weight for the warm-start point when warm-start is set for the barrier algorithm. Using larger weight gives more emphasis for the supplied starting point.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BarThreads |
If set to a positive integer it determines the number of threads implemented to run the Newton-barrier and hybrid gradient algorithms. If the value is set to the default value (
-1), the
THREADS control will determine the number of threads used.
(Inherited from XPRSprob.) |
|
BestBound |
Value of the best bound determined so far by the MIP search.
(Inherited from XPRSprob.) |
|
BigM |
The infeasibility penalty used if the "Big M" method is implemented.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BoundName |
Active bound name.
(Inherited from XPRSprob.) |
|
BranchChoice |
Once a MIP entity has been selected for branching, this control determines which of the branches is solved first.
(Inherited from XPRSprob.) |
|
BranchDisj |
Branch and Bound: Determines whether the optimizer should attempt to branch on general split disjunctions during the branch and bound search.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
BranchValue |
The value of the branching variable at a node of the Branch and Bound tree.
(Inherited from XPRSprob.) |
|
BranchVar |
The branching variable at a node of the Branch and Bound tree.
(Inherited from XPRSprob.) |
|
BreadthFirst |
The number of nodes to include in the best-first search before switching to the local first search (
NODESELECTION
=
4).
(Inherited from XPRSprob.) |
|
CacheSize | Obsolete.
Newton Barrier: L2 or L3 (see notes) cache size in kB (kilobytes) of the CPU. On Intel (or compatible) platforms a value of
-1 may be used to determine the cache size automatically. If the CPU model is new then the cache size may not be correctly detected by an older release of the software.
(Inherited from XPRSprob.) |
|
CallbackCheckTimeDelay |
Minimum delay in milliseconds between two consecutive executions of the CHECKTIME callback in the same solution process
(Inherited from XPRSprob.) |
|
CallbackCount_CutMgr |
This attribute counts the number of times the cut manager callback set by
addCbCutmgr has been called for the current node, including the current callback call. The value of this attribute should only be used from within the cut manager callback.
(Inherited from XPRSprob.) |
|
CallbackCount_OptNode |
This attribute counts the number of times the optimal node callback set by
addCbOptnode 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.
(Inherited from XPRSprob.) |
|
CallbackFromMasterThread |
Branch and Bound: specifies whether the MIP callbacks should only be called on the master thread.
(Inherited from XPRSprob.) |
|
CheckInputData |
Check input arrays for bad data.
(Inherited from XPRSprob.) |
|
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
mipOptimize. 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.
(Inherited from XPRSprob.) |
|
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
mipOptimize. 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.
(Inherited from XPRSprob.) |
|
CholeskyAlg |
Newton barrier: type of Cholesky factorization used.
(Inherited from XPRSprob.) |
|
CholeskyTol |
Newton barrier: The tolerance for pivot elements in the Cholesky decomposition of the normal equations coefficient matrix, computed at each iteration of the barrier algorithm. If the absolute value of the pivot element is less than or equal to
CHOLESKYTOL, it merits special treatment in the Cholesky decomposition process.
(Inherited from XPRSprob.) |
|
Clamping |
This control allows for the adjustment of returned solution values such that they are always within bounds.
(Inherited from XPRSprob.) |
|
Cols |
Number of columns (i.e. variables) in the matrix.
(Inherited from XPRSprob.) |
|
Compute |
Controls whether the next solve is performed directly or on an Insight Compute Interface.
(Inherited from XPRSprob.) |
|
ComputeExecService |
Selects the Insight execution service that will be used for solving remote optimizations.
(Inherited from XPRSprob.) |
|
ComputeExecutions |
The number of solves executed on a compute server.
(Inherited from XPRSprob.) |
|
ComputeJobPriority |
Selects the priority that will be used for remote optimization jobs.
(Inherited from XPRSprob.) |
|
ComputeLog |
Controls how the run log is fetched when a solve is performed on an Insight Compute Interface.
(Inherited from XPRSprob.) |
|
ConcurrentThreads |
Determines the number of threads used by the concurrent solver.
(Inherited from XPRSprob.) |
|
ConeElems |
Number of second order cone coefficients in the problem.
(Inherited from XPRSprob.) |
|
Cones |
Number of second order and rotated second order cones in the problem.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
CoresDetected |
Number of logical cores detected by the optimizer, which is the total number of threads the hardware can execute across all CPUs.
(Inherited from XPRSprob.) |
|
CoresPerCPU |
Used to override the detected value of the number of cores on a CPU. The cache size (either detected or specified via the
CACHESIZE control) used in Barrier methods will be divided by this amount, and this scaled-down value will be the amount of cache allocated to each Barrier thread
(Inherited from XPRSprob.) |
|
CoresPerCPUDetected |
Number of logical cores per CPU unit detected by the optimizer, which is the number of threads each CPU can execute.
(Inherited from XPRSprob.) |
|
CoverCuts |
Branch and Bound: The number of rounds of lifted cover inequalities at the top node. A lifted cover inequality is an additional constraint that can be particularly effective at reducing the size of the feasible region without removing potential integral solutions. The process of generating these can be carried out a number of times, further reducing the feasible region, albeit incurring a time penalty. There is usually a good payoff from generating these at the top node, since these inequalities then apply to every subsequent node in the tree search.
(Inherited from XPRSprob.) |
|
CpiAlpha |
decay term for confined primal integral computation.
(Inherited from XPRSprob.) |
|
CpiScaleFactor |
scale factor from primal integral computation.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
CPUsDetected |
Number of CPU units detected by the optimizer.
(Inherited from XPRSprob.) |
|
CPUTime |
How time should be measured when timings are reported in the log and when checking against time limits
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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
getBasis,
writeBasis) and advanced sensitivity analysis information (see
objsa,
rHSsa,
bndsa).
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
CrossOverDRP |
Control CROSSOVERDRP.
(Inherited from XPRSprob.) |
|
CrossOverFeasWeight |
Control CROSSOVERFEASWEIGHT.
(Inherited from XPRSprob.) |
|
CrossoverIter |
Number of simplex iterations performed in crossover.
(Inherited from XPRSprob.) |
|
CrossoverIterLimit |
Newton barrier and hybrid gradient: The maximum number of iterations that will be performed in the crossover procedure before the optimization process terminates.
(Inherited from XPRSprob.) |
|
CrossoverOps |
Newton barrier and hybrid gradient: a bit vector for adjusting the behavior of the crossover procedure.
(Inherited from XPRSprob.) |
|
CrossOverRelPivotTol |
Control CROSSOVERRELPIVOTTOL.
(Inherited from XPRSprob.) |
|
CrossOverRelPivotTolSafe |
Control CROSSOVERRELPIVOTTOLSAFE.
(Inherited from XPRSprob.) |
|
CrossoverThreads |
Determines the maximum number of threads that parallel crossover is allowed to use. If
CROSSOVERTHREADS is set to the default value (
-1), the
BARTHREADS control will determine the number of threads used.
(Inherited from XPRSprob.) |
|
CurrentMemory |
The amount of dynamically allocated heap memory by the problem being solved.
(Inherited from XPRSprob.) |
|
CurrentNode |
The unique identifier of the current node in the tree search.
(Inherited from XPRSprob.) |
|
CurrMipCutOff |
The current MIP cut off.
(Inherited from XPRSprob.) |
|
CutDepth |
Branch and Bound: Sets the maximum depth in the tree search at which cuts will be generated. Generating cuts can take a lot of time, and is often less important at deeper levels of the tree since tighter bounds on the variables have already reduced the feasible region. A value of
0 signifies that no cuts will be generated.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
CutFreq |
Branch and Bound: This specifies the frequency at which cuts are generated in the tree search. If the depth of the node modulo
CUTFREQ is zero, then cuts will be generated.
(Inherited from XPRSprob.) |
|
Cuts |
Number of cuts being added to the matrix.
(Inherited from XPRSprob.) |
|
CutSelect |
A bit vector providing detailed control of the cuts created for the root node of a MIP solve. Use
TREECUTSELECT to control cuts during the tree search.
(Inherited from XPRSprob.) |
|
CutStrategy |
Branch and Bound: This specifies the cut strategy. A more aggressive cut strategy, generating a greater number of cuts, will result in fewer nodes to be explored, but with an associated time cost in generating the cuts. The fewer cuts generated, the less time taken, but the greater subsequent number of nodes to be explored.
(Inherited from XPRSprob.) |
|
DefaultAlg |
This selects the algorithm that will be used to solve LPs, standalone or during MIP optimization.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
Deterministic |
Selects whether to use a deterministic or opportunistic mode when solving a problem using multiple threads.
(Inherited from XPRSprob.) |
|
DetLogFreq |
Control DETLOGFREQ.
(Inherited from XPRSprob.) |
|
DualGradient |
Simplex: This specifies the dual simplex pricing method.
(Inherited from XPRSprob.) |
|
DualInfeas |
Number of dual infeasibilities.
(Inherited from XPRSprob.) |
|
Dualize |
For a linear problem or the initial linear relaxation of a MIP, determines whether to form and solve the dual problem.
(Inherited from XPRSprob.) |
|
DualizeOps |
Bit-vector control for adjusting the behavior when a problem is dualized.
(Inherited from XPRSprob.) |
|
DualPerturb |
The factor by which the problem will be perturbed prior to optimization by dual simplex. A value of
0.0 results in no perturbation prior to optimization. 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.
(Inherited from XPRSprob.) |
|
DualStrategy |
This bit-vector control specifies the dual simplex strategy.
(Inherited from XPRSprob.) |
|
DualThreads |
Determines the maximum number of threads that dual simplex is allowed to use. If
DUALTHREADS is set to the default value (
-1), the
THREADS control will determine the number of threads used.
(Inherited from XPRSprob.) |
|
DummyControl |
Control DUMMYCONTROL.
(Inherited from XPRSprob.) |
|
EigenValueTol |
A quadratic matrix is considered not to be positive semi-definite, if its smallest eigenvalue is smaller than the negative of this value.
(Inherited from XPRSprob.) |
|
Elems |
Number of matrix nonzeros (elements).
(Inherited from XPRSprob.) |
|
ElimFillIn |
Amount of fill-in allowed when performing an elimination in presolve .
(Inherited from XPRSprob.) |
|
ElimTol |
The Markowitz tolerance for the elimination phase of the presolve.
(Inherited from XPRSprob.) |
|
ErrorCode |
The most recent Optimizer error number that occurred. This is useful to determine the precise error or warning that has occurred, after an Optimizer function has signalled an error by returning a non-zero value. The return value itself is
not the error number. Refer to the section for a list of possible error numbers, the errors and warnings that they indicate, and advice on what they mean and how to resolve them. A short error message may be obtained using
getLastError, and all messages may be intercepted using the user output callback function; see
addCbMessage.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
EtaTol |
Tolerance on eta elements. During each iteration, the basis inverse is premultiplied by an elementary matrix, which is the identity except for one column - the eta vector. Elements of eta vectors whose absolute value is smaller than
ETATOL are taken to be zero in this step.
(Inherited from XPRSprob.) |
|
ExtraCols |
The initial number of extra columns to allow for in the matrix. If columns are to be added to the matrix, then, for maximum efficiency, space should be reserved for the columns before the matrix is input by setting the
EXTRACOLS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
(Inherited from XPRSprob.) |
|
ExtraElems |
The initial number of extra matrix elements to allow for in the matrix, including coefficients for cuts. If rows or columns are to be added to the matrix, then, for maximum efficiency, space should be reserved for the extra matrix elements before the matrix is input by setting the
EXTRAELEMS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
(Inherited from XPRSprob.) |
|
ExtraMIPEnts |
The initial number of extra MIP entities to allow for.
(Inherited from XPRSprob.) |
|
ExtraRows |
The initial number of extra rows to allow for in the matrix, including cuts. If rows are to be added to the matrix, then, for maximum efficiency, space should be reserved for the rows before the matrix is input by setting the
EXTRAROWS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
(Inherited from XPRSprob.) |
|
ExtraSetElems |
The initial number of extra elements in sets to allow for in the matrix. If sets are to be added to the matrix, then, for maximum efficiency, space should be reserved for the set elements before the matrix is input by setting the
EXTRASETELEMS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
(Inherited from XPRSprob.) |
|
ExtraSets |
The initial number of extra sets to allow for in the matrix. If sets are to be added to the matrix, then, for maximum efficiency, space should be reserved for the sets before the matrix is input by setting the
EXTRASETS control. If this is not done, resizing will occur automatically, but more space may be allocated than the user actually requires.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
FeasibilityPump |
Branch and Bound: Decides if the Feasibility Pump heuristic should be run at the top node.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
FeasTolTarget |
This specifies the target feasibility tolerance for the solution refiner.
(Inherited from XPRSprob.) |
|
ForceOutput |
Certain names in the problem object may be incompatible with different file formats (such as names containing spaces for LP files). If the optimizer might be unable to read back a problem because of non-standard names, it will first attempt to write it out using an extended naming convention. If the names would not be possible to extend so that they would be reproducible and recognizable, it will give an error message and won't create the file. If the optimizer might be unable to read back a problem because of non-standard names, it will give an error message and won't create the file. This option may be used to force output anyway.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
GenConCols |
Number of input variables in general constraints (i.e. MIN/MAX/AND/OR/ABS constraints) in the problem.
(Inherited from XPRSprob.) |
|
GenCons |
The number of general constraints (i.e. MIN/MAX/AND/OR/ABS constraints) in the problem.
(Inherited from XPRSprob.) |
|
GenconsAbsTransformation |
This control specifies the reformulation method for absolute value general constraints at the beginning of the search.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
GenConVals |
Number of constant values in general constraints (MIN/MAX constraints) in the problem.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
GlobalNlpCuts |
Limit on the number of rounds of outer approximation and convexification cuts generated for the root node, when solving an (MI)NLP to global optimality.
(Inherited from XPRSprob.) |
|
GlobalNLPInfeas |
Number of nonlinear infeasibilities at the current node of a global solve, measured as the number of violated atomic formulas.
(Inherited from XPRSprob.) |
|
GlobalNumInitNlpCuts |
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.
(Inherited from XPRSprob.) |
|
GlobalSpatialBranchCuttingEffort |
Limits the effort that is spent on creating cuts during spatial branching.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
GlobalSpatialBranchPropagationEffort |
Limits the effort that is spent on propagation during spatial branching.
(Inherited from XPRSprob.) |
|
GlobalTreeNlpCuts |
Limit on 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.
(Inherited from XPRSprob.) |
|
GomCuts |
Branch and Bound: The number of rounds of Gomory or lift-and-project cuts at the top node.
(Inherited from XPRSprob.) |
|
HeurBeforeLP |
Branch and Bound: Determines whether primal heuristics should be run before the initial LP relaxation has been solved.
(Inherited from XPRSprob.) |
|
HeurDepth |
Branch and Bound: Sets the maximum depth in the tree search at which heuristics will be used to find MIP solutions. It may be worth stopping the heuristic search for solutions after a certain depth in the tree search. A value of 0 signifies that heuristics will not be used. This control no longer has any effect and will be removed from future releases.
(Inherited from XPRSprob.) |
|
HeurDiveIterLimit |
Branch and Bound: Simplex iteration limit for reoptimizing during the diving heuristic.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
HeurDiveSpeedUp |
Branch and Bound: Changes the emphasis of the diving heuristic from solution quality to diving speed.
(Inherited from XPRSprob.) |
|
HeurDiveStrategy |
Branch and Bound: Chooses the strategy for the diving heuristic.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
HeurForceSpecialObj |
Branch and Bound: This specifies whether local search heuristics without objective or with an auxiliary objective should always be used, despite the automatic selection of the Optimiezr. Deactivated by default.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
HeurMaxSol |
Branch and Bound: This specifies the maximum number of heuristic solutions that will be found in the tree search. This control no longer has any effect and will be removed from future releases.
(Inherited from XPRSprob.) |
|
HeurNodes |
Branch and Bound: This specifies the maximum number of nodes at which heuristics are used in the tree search. This control no longer has any effect and will be removed from future releases.
(Inherited from XPRSprob.) |
|
HeursearchBackgroundSelect |
Select which large neighborhood searches to run in the background (for example in parallel to the root cut loop).
(Inherited from XPRSprob.) |
|
HeurSearchCopyControls |
Select how user-set controls should affect local search heuristics.
(Inherited from XPRSprob.) |
|
HeurSearchEffort |
Adjusts the overall level of the local search heuristics.
(Inherited from XPRSprob.) |
|
HeurSearchFreq |
Branch and Bound: This specifies how often the local search heuristic should be run in the tree.
(Inherited from XPRSprob.) |
|
HeurSearchRootCutFreq |
How frequently to run the local search heuristic during root cutting. This is given as how many cut rounds to perform between runs of the heuristic. Set to zero to avoid applying the heuristic during root cutting. Branch and Bound: This specifies how often the local search heuristic should be run in the tree.
(Inherited from XPRSprob.) |
|
HeurSearchRootSelect |
A bit vector control for selecting which local search heuristics to apply on the root node of a MIP solve. Use
HEURSEARCHTREESELECT to control local search heuristics during the tree search.
(Inherited from XPRSprob.) |
|
HeurSearchTargetSize |
Control HEURSEARCHTARGETSIZE.
(Inherited from XPRSprob.) |
|
HeurSearchTreeSelect |
A bit vector control for selecting which local search heuristics to apply during the tree search of a MIP solve. Use
HEURSEARCHROOTSELECT to control local search heuristics on the root node.
(Inherited from XPRSprob.) |
|
HeurSelect |
Control HEURSELECT.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
HeurThreads |
Branch and Bound: The number of threads to dedicate to running heuristics during the root solve.
(Inherited from XPRSprob.) |
|
HistoryCosts |
Branch and Bound: How to update the pseudo cost for a MIP entity when a strong branch or a regular branch is applied.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
IgnoreContainerCpuLimit |
Control IGNORECONTAINERCPULIMIT.
(Inherited from XPRSprob.) |
|
IgnoreContainerMemoryLimit |
Control IGNORECONTAINERMEMORYLIMIT.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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 control has an effect only on the deletion filter of the IIS procedure.
(Inherited from XPRSprob.) |
|
IISSolStatus |
IIS solution status.
(Inherited from XPRSprob.) |
|
Indicators |
Number of indicator constrains in the problem.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
InputCols |
Number of columns (i.e. variables) in the original matrix before nonlinear reformulations.
(Inherited from XPRSprob.) |
|
InputRows |
Number of rows (i.e. constraints) in the original matrix before nonlinear reformulations.
(Inherited from XPRSprob.) |
|
Inputtol |
The tolerance on input values elements. 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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
InvertMin |
Simplex: The minimum number of iterations between full inversions of the basis matrix. See the description of
INVERTFREQ for details.
(Inherited from XPRSprob.) |
|
IOTimeout |
The maximum number of seconds to wait for an I/O operation before it is cancelled.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
KeepNRows |
How nonbinding rows should be handled by the MPS reader.
(Inherited from XPRSprob.) |
|
KnitroParamAlgorithm |
Indicates which algorithm to use to solve the problem
(Inherited from XPRSprob.) |
|
KnitroParamBarDirectInterval |
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.
(Inherited from XPRSprob.) |
|
KnitroParamBarFeasible |
Specifies whether special emphasis is placed on getting and staying feasible in the interior-point algorithms.
(Inherited from XPRSprob.) |
|
KnitroParamBarFeasModeTol |
Specifies the tolerance in equation that determines whether Knitro will force subsequent iterates to remain feasible.
(Inherited from XPRSprob.) |
|
KnitroParamBarInitMu |
Specifies the initial value for the barrier parameter :
mu used with the barrier algorithms. This option has no effect on the Active Set algorithm.
(Inherited from XPRSprob.) |
|
KnitroParamBarInitPt |
Indicates whether an initial point strategy is used with barrier algorithms.
(Inherited from XPRSprob.) |
|
KnitroParamBarMaxBacktrack |
Indicates the maximum allowable number of backtracks during the linesearch of the Interior/Direct algorithm before reverting to a CG step.
(Inherited from XPRSprob.) |
|
KnitroParamBarMaxRefactor |
Indicates the maximum number of refactorizations of the KKT system per iteration of the Interior/Direct algorithm before reverting to a CG step.
(Inherited from XPRSprob.) |
|
KnitroParamBarMuRule |
Indicates which strategy to use for modifying the barrier parameter mu in the barrier algorithms.
(Inherited from XPRSprob.) |
|
KnitroParamBarPenCons |
Indicates whether a penalty approach is applied to the constraints.
(Inherited from XPRSprob.) |
|
KnitroParamBarPenRule |
Indicates which penalty parameter strategy to use for determining whether or not to accept a trial iterate.
(Inherited from XPRSprob.) |
|
KnitroParamBarRelaxCons | (Inherited from XPRSprob.) |
|
KnitroParamBarSwitchRule |
Indicates whether or not the barrier algorithms will allow switching from an optimality phase to a pure feasibility phase.
(Inherited from XPRSprob.) |
|
KnitroParamBLASOption | (Inherited from XPRSprob.) |
|
KnitroParamDebug | (Inherited from XPRSprob.) |
|
KnitroParamDelta |
Specifies the initial trust region radius scaling factor used to determine the initial trust region size.
(Inherited from XPRSprob.) |
|
KnitroParamFeastol |
Specifies the final relative stopping tolerance for the feasibility error.
(Inherited from XPRSprob.) |
|
KnitroParamFeasTolAbs |
Specifies the final absolute stopping tolerance for the feasibility error.
(Inherited from XPRSprob.) |
|
KnitroParamGradOpt |
Specifies how to compute the gradients of the objective and constraint functions.
(Inherited from XPRSprob.) |
|
KnitroParamHessOpt |
Specifies how to compute the (approximate) Hessian of the Lagrangian.
(Inherited from XPRSprob.) |
|
KnitroParamHonorBbnds |
Indicates whether or not to enforce satisfaction of simple variable bounds throughout the optimization.
(Inherited from XPRSprob.) |
|
KnitroParamInfeasTol |
Specifies the (relative) tolerance used for declaring infeasibility of a model.
(Inherited from XPRSprob.) |
|
KnitroParamLinSolver | (Inherited from XPRSprob.) |
|
KnitroParamLMSize |
Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
(Inherited from XPRSprob.) |
|
KnitroParamMATerminate | (Inherited from XPRSprob.) |
|
KnitroParamMaxCGIt |
Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
(Inherited from XPRSprob.) |
|
KnitroParamMaxCrossIt |
Specifies the maximum number of crossover iterations before termination.
(Inherited from XPRSprob.) |
|
KnitroParamMaxIt |
Specifies the maximum number of iterations before termination.
(Inherited from XPRSprob.) |
|
KnitroParamMIPBranchRule |
Specifies which branching rule to use for MIP branch and bound procedure.
(Inherited from XPRSprob.) |
|
KnitroParamMIPDebug | (Inherited from XPRSprob.) |
|
KnitroParamMIPGUBBranch |
Specifies whether or not to branch on generalized upper bounds (GUBs).
(Inherited from XPRSprob.) |
|
KnitroParamMIPHeuristic |
Specifies which MIP heuristic search approach to apply to try to find an initial integer feasible point.
(Inherited from XPRSprob.) |
|
KnitroParamMIPHeurMaxIt | (Inherited from XPRSprob.) |
|
KnitroParamMIPImplicatns |
Specifies whether or not to add constraints to the MIP derived from logical implications.
(Inherited from XPRSprob.) |
|
KnitroParamMIPIntGapAbs |
The absolute integrality gap stop tolerance for MIP.
(Inherited from XPRSprob.) |
|
KnitroParamMIPIntGapRel |
The relative integrality gap stop tolerance for MIP.
(Inherited from XPRSprob.) |
|
KnitroParamMIPKnapsack |
Specifies rules for adding MIP knapsack cuts.
(Inherited from XPRSprob.) |
|
KnitroParamMIPLPAlg |
Specifies which algorithm to use for any linear programming (LP) subproblem solves that may occur in the MIP branch and bound procedure.
(Inherited from XPRSprob.) |
|
KnitroParamMIPMaxNodes |
Specifies the maximum number of nodes explored.
(Inherited from XPRSprob.) |
|
KnitroParamMIPMethod |
Specifies which MIP method to use.
(Inherited from XPRSprob.) |
|
KnitroParamMIPOutInterval |
Specifies node printing interval for
XKTR_PARAM_MIP_OUTLEVEL when
XKTR_PARAM_MIP_OUTLEVEL > 0.
(Inherited from XPRSprob.) |
|
KnitroParamMIPOutLevel |
Specifies how much MIP information to print.
(Inherited from XPRSprob.) |
|
KnitroParamMIPPseudoint |
Specifies the method used to initialize pseudo-costs corresponding to variables that have not yet been branched on in the MIP method.
(Inherited from XPRSprob.) |
|
KnitroParamMIPRootAlg |
Specifies which algorithm to use for the root node solve in MIP (same options as
XKTR_PARAM_ALGORITHM user option).
(Inherited from XPRSprob.) |
|
KnitroParamMIPRounding |
Specifies the MIP rounding rule to apply.
(Inherited from XPRSprob.) |
|
KnitroParamMIPSelectRule |
Specifies the MIP select rule for choosing the next node in the branch and bound tree.
(Inherited from XPRSprob.) |
|
KnitroParamMIPStringMaxIt |
Specifies the maximum number of iterations to allow for MIP strong branching solves.
(Inherited from XPRSprob.) |
|
KnitroParamMIPStrongCandLim |
Specifies the maximum number of candidates to explore for MIP strong branching.
(Inherited from XPRSprob.) |
|
KnitroParamMIPStrongLevel |
Specifies the maximum number of tree levels on which to perform MIP strong branching.
(Inherited from XPRSprob.) |
|
KnitroParamMsMaxBndRange | (Inherited from XPRSprob.) |
|
KnitroParamMSMaxSolves | (Inherited from XPRSprob.) |
|
KnitroParamMSNumToSave | (Inherited from XPRSprob.) |
|
KnitroParamMSSaveTol | (Inherited from XPRSprob.) |
|
KnitroParamMSSeed | (Inherited from XPRSprob.) |
|
KnitroParamMSStartPtRange | (Inherited from XPRSprob.) |
|
KnitroParamMSTerminate | (Inherited from XPRSprob.) |
|
KnitroParamMultiStart | (Inherited from XPRSprob.) |
|
KnitroParamNewPoint | (Inherited from XPRSprob.) |
|
KnitroParamObjRange |
Specifies the extreme limits of the objective function for purposes of determining unboundedness.
(Inherited from XPRSprob.) |
|
KnitroParamOptTol |
Specifies the final relative stopping tolerance for the KKT (optimality) error.
(Inherited from XPRSprob.) |
|
KnitroParamOptTolAbs |
Specifies the final absolute stopping tolerance for the KKT (optimality) error.
(Inherited from XPRSprob.) |
|
KnitroParamOutLev |
Controls the level of output produced by Knitro.
(Inherited from XPRSprob.) |
|
KnitroParamParNumThreads | (Inherited from XPRSprob.) |
|
KnitroParamPivot | (Inherited from XPRSprob.) |
|
KnitroParamPresolve |
Determine whether or not to use the Knitro presolver to try to simplify the model by removing variables or constraints. Specifies conditions for terminating the MIP algorithm.
(Inherited from XPRSprob.) |
|
KnitroParamPresolveTol |
Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
(Inherited from XPRSprob.) |
|
KnitroParamScale |
Performs a scaling of the objective and constraint functions based on their values at the initial point.
(Inherited from XPRSprob.) |
|
KnitroParamSOC |
Specifies whether or not to try second order corrections (SOC).
(Inherited from XPRSprob.) |
|
KnitroParamXTol |
The optimization process will terminate if the relative change in all components of the solution point estimate is less than xtol.
(Inherited from XPRSprob.) |
|
L1Cache | Obsolete.
Newton barrier: L1 cache size in kB (kilo bytes) of the CPU. On Intel (or compatible) platforms a value of -1 may be used to determine the cache size automatically.
(Inherited from XPRSprob.) |
|
LNPBest |
Number of infeasible MIP entities to create lift-and-project cuts for during each round of Gomory cuts at the top node (see
GOMCUTS).
(Inherited from XPRSprob.) |
|
LNPIterLimit |
Number of iterations to perform in improving each lift-and-project cut.
(Inherited from XPRSprob.) |
|
LocalBacktrack |
Control LOCALBACKTRACK.
(Inherited from XPRSprob.) |
|
LocalChoice |
Controls when to perform a local backtrack between the two child nodes during a dive in the branch and bound tree.
(Inherited from XPRSprob.) |
|
LocalSolver | (Inherited from XPRSprob.) |
|
LocalSolverSelected | (Inherited from XPRSprob.) |
|
LPFlags |
A bit-vector control which defines the algorithm for solving an LP problem or the initial LP relaxation of a MIP problem.
(Inherited from XPRSprob.) |
|
LpFolding |
Simplex and barrier: whether to fold an LP problem before solving it.
(Inherited from XPRSprob.) |
|
LPIterLimit |
The maximum number of iterations that will be performed by primal simplex or dual simplex before the optimization process terminates. For MIP problems, this is the maximum total number of iterations over all nodes explored by the Branch and Bound method.
(Inherited from XPRSprob.) |
|
LPLog |
Simplex: The frequency at which the simplex log is printed.
(Inherited from XPRSprob.) |
|
LPLogDelay |
Time interval between two LP log lines.
(Inherited from XPRSprob.) |
|
LPLogStyle |
Simplex: The style of the simplex log.
(Inherited from XPRSprob.) |
|
LPObjVal |
Value of the objective function of the last LP solved.
(Inherited from XPRSprob.) |
|
LpRefineIterLimit |
This specifies the simplex iteration limit the solution refiner can spend in attempting to increase the accuracy of an LP solution.
(Inherited from XPRSprob.) |
|
LPStatus |
LP solution status.
(Inherited from XPRSprob.) |
|
LUPivotTol |
Control LUPIVOTTOL.
(Inherited from XPRSprob.) |
|
MarkowitzTol |
The Markowitz tolerance used for the factorization of the basis matrix.
(Inherited from XPRSprob.) |
|
MatrixName |
The matrix name.
(Inherited from XPRSprob.) |
|
MatrixTol |
The zero tolerance on matrix elements. If the value of a matrix element is less than or equal to
MATRIXTOL in absolute value, it is treated as zero. The control applies when solving a problem, for an input tolerance see
INPUTTOL.
(Inherited from XPRSprob.) |
|
MaxAbsDualInfeas |
Maximum calculated absolute dual infeasibility in the unscaled original problem.
(Inherited from XPRSprob.) |
|
MaxAbsPrimalInfeas |
Maximum calculated absolute primal infeasibility in the unscaled original problem.
(Inherited from XPRSprob.) |
|
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
mipOptimize. 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.
(Inherited from XPRSprob.) |
|
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
mipOptimize. 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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MaxIIS |
This function controls the number of Irreducible Infeasible Sets to be found using the
iISAll (
IIS
-a).
(Inherited from XPRSprob.) |
|
MaxImpliedBound |
Presolve: When tighter bounds are calculated during MIP preprocessing, only bounds whose absolute value are smaller than
MAXIMPLIEDBOUND will be applied to the problem.
(Inherited from XPRSprob.) |
|
MaxKappa |
Largest basis condition number (also known as kappa) calculated through all nodes sampled by
MIPKAPPAFREQ.
(Inherited from XPRSprob.) |
|
MaxLocalBacktrack |
Branch-and-Bound: How far back up the current dive path the optimizer is allowed to look for a local backtrack candidate node.
(Inherited from XPRSprob.) |
|
MaxMCoeffBufferElems |
The maximum number of matrix coefficients to buffer before flushing into the internal representation of the problem. Buffering coefficients can offer a significant performance gain when you are building a matrix using
chgCoef or
chgMCoef, but can lead to a significant memory overhead for large matrices, which this control allows you to influence.
(Inherited from XPRSprob.) |
|
MaxMemoryHard |
This control sets the maximum amount of memory in megabytes the optimizer should allocate. If this limit is exceeded, the solve will terminate. This control is designed to make the optimizer stop in a controlled manner, so that the problem object is valid once termination occurs. The solve state will be set to incomplete. This is different to an out of memory condition in which case the optimizer returns an error. The optimizer may still allocate memory once the limit is exceeded to be able to finsish the operations and stop in a controlled manner. When
RESOURCESTRATEGY is enabled, the control also has the same effect as
MAXMEMORYSOFT and will cause the optimizer to try preserving memory when possible.
(Inherited from XPRSprob.) |
|
MaxMemorySoft |
When
RESOURCESTRATEGY is enabled, this control sets the maximum amount of memory in megabytes the optimizer targets to allocate. This may change the solving path, but will not cause the solve to terminate early. To set a hard version of the same, please set
MAXMEMORYHARD.
(Inherited from XPRSprob.) |
|
MaxMipInfeas |
Maximum integer fractionality in the solution.
(Inherited from XPRSprob.) |
|
MaxMIPSol |
Branch and Bound: This specifies a limit on the number of integer solutions to be found by the Optimizer. It is possible that during optimization the Optimizer will find the same objective solution from different nodes. However,
MAXMIPSOL refers to the total number of integer solutions found, and not necessarily the number of distinct solutions.
(Inherited from XPRSprob.) |
|
MaxMipTasks |
Branch-and-Bound: The maximum number of tasks to run in parallel during a MIP solve.
(Inherited from XPRSprob.) |
|
MaxNode |
Branch and Bound: The maximum number of nodes that will be explored.
(Inherited from XPRSprob.) |
|
MaxPageLines |
Number of lines between page breaks in printable output.
(Inherited from XPRSprob.) |
|
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).
(Inherited from XPRSprob.) |
|
MaxRelDualInfeas |
Maximum calculated relative dual infeasibility in the unscaled original problem.
(Inherited from XPRSprob.) |
|
MaxRelPrimalInfeas |
Maximum calculated relative primal infeasibility in the unscaled original problem.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MaxStallTime |
The maximum time in seconds that the Optimizer will continue to search for improving solution after finding a new incumbent.
(Inherited from XPRSprob.) |
|
MaxTime | Obsolete.
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.
(Inherited from XPRSprob.) |
|
MaxTreeFileSize |
The maximum size, in megabytes, to which the tree file may grow, or 0 for no limit. 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.
(Inherited from XPRSprob.) |
|
MCFCutStrategy |
Level of Multi-Commodity Flow (MCF) cutting planes separation: This specifies how much aggresively 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.
(Inherited from XPRSprob.) |
|
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).
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MIPAbsGapNotify |
Branch and bound: if the
gapnotify callback has been set using
addCbGapNotify, 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.
(Inherited from XPRSprob.) |
|
MIPAbsGapNotifyBound |
Branch and bound: if the
gapnotify callback has been set using
addCbGapNotify, 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.
(Inherited from XPRSprob.) |
|
MIPAbsGapNotifyObj |
Branch and bound: if the
gapnotify callback has been set using
addCbGapNotify, 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.
(Inherited from XPRSprob.) |
|
MIPAbsStop |
Branch and Bound: The absolute tolerance determining whether the tree search will continue or not. It will terminate if
(Inherited from XPRSprob.) | 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. |
|
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.
(Inherited from XPRSprob.) |
|
MIPBestObjVal |
Objective function value of the best integer solution found.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MIPDualReductions |
Branch and Bound: Limits operations that can reduce the MIP solution space.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MIPInfeas |
Number of integer infeasibilities, including violations of special ordered sets, at the current node.
(Inherited from XPRSprob.) |
|
MIPKappaFreq |
Branch and Bound: Specifies how frequently the basis condition number (also known as kappa) should be calculated during the branch-and-bound search.
(Inherited from XPRSprob.) |
|
MIPLog |
MIP log print control.
(Inherited from XPRSprob.) |
|
MIPObjVal |
Objective function value of the last integer solution found.
(Inherited from XPRSprob.) |
|
MIPPresolve |
Branch and Bound: Type of integer processing to be performed. If set to
0, no processing will be performed.
(Inherited from XPRSprob.) |
|
MipRampup |
Controls the strategy used by the parallel MIP solver during the ramp-up phase of a branch-and-bound tree search.
(Inherited from XPRSprob.) |
|
MipRefineIterLimit |
This defines an effort limit expressed as simplex iterations for the MIP solution refiner. The limit is per reoptimizations in the MIP refiner.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MIPRelGapNotify |
Branch and bound: if the
gapnotify callback has been set using
addCbGapNotify, 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.
(Inherited from XPRSprob.) |
|
MIPRelStop |
Branch and Bound: This determines when the branch and bound tree search will terminate. Branch and bound tree search will stop if:
(Inherited from XPRSprob.) | MIPOBJVAL - BESTBOUND| <= MIPRELSTOP x max(| BESTBOUND|,| MIPOBJVAL|) where MIPOBJVAL is the value of the best solution's objective function and BESTBOUND is the current best solution bound. For example, to stop the 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. |
|
MipRestart |
Branch and Bound: controls strategy for in-tree restarts.
(Inherited from XPRSprob.) |
|
MIPRestartFactor |
Branch and Bound: Fine tune initial conditions to trigger an in-tree restart. Use a value > 1 to increase the aggressiveness with which the Optimizer restarts. Use a value < 1 to relax the aggressiveness with which the Optimizer restarts. Note that this control does not affect the initial condition on the gap, which must be set separately.
(Inherited from XPRSprob.) |
|
MIPRestartGapThreshold |
Control MIPRESTARTGAPTHRESHOLD.
(Inherited from XPRSprob.) |
|
MIPSolNode |
Node at which the last integer feasible solution was found.
(Inherited from XPRSprob.) |
|
MIPSols |
Number of integer solutions that have been found.
(Inherited from XPRSprob.) |
|
MIPSolTime |
Time at which the last integer feasible solution was found.
(Inherited from XPRSprob.) |
|
MIPStatus |
(MIP) solution status.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MIPThreadID |
The ID for the MIP thread.
(Inherited from XPRSprob.) |
|
MIPThreads |
If set to a positive integer it determines the number of threads implemented to run the parallel MIP code. If
MIPTHREADS is set to the default value (
-1), the
THREADS control will determine the number of threads used.
(Inherited from XPRSprob.) |
|
MIPTol |
Branch and Bound: This is the tolerance within which a decision variable's value is considered to be integral.
(Inherited from XPRSprob.) |
|
MipTolTarget |
Target MIPTOL value used by the automatic MIP solution refiner as defined by
REFINEOPS. Negative and zero values are ignored.
(Inherited from XPRSprob.) |
|
MIQCPAlg |
This control determines which algorithm is to be used to solve mixed integer quadratic constrained and mixed integer second order cone problems.
(Inherited from XPRSprob.) |
|
MPS18Compatible |
Provides compatibility of MPS file output for older MPS readers.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MPSEcho |
Determines whether comments in MPS matrix files are to be printed out during matrix input.
(Inherited from XPRSprob.) |
|
MPSFormat |
Specifies the format of MPS files.
(Inherited from XPRSprob.) |
|
MPSNameLength |
Control MPSNAMELENGTH.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
MsMaxBoundRange |
Defines the maximum range inside which initial points are generated by multistart presets
(Inherited from XPRSprob.) |
|
MultiObjLog |
Log level for multi-objective optimization.
(Inherited from XPRSprob.) |
|
MultiObjOps |
Modifies the behaviour of the optimizer when solving multi-objective problems.
(Inherited from XPRSprob.) |
|
MultiStart |
The multistart master control. Defines if the multistart search is to be initiated, or if only the baseline model is to be solved.
(Inherited from XPRSprob.) |
|
MultiStart_Log |
The level of logging during the multistart run.
(Inherited from XPRSprob.) |
|
MultiStart_MaxSolves |
The maximum number of jobs to create during the multistart search.
(Inherited from XPRSprob.) |
|
MultiStart_MaxTime |
The maximum total time to be spent in the mutlistart search.
(Inherited from XPRSprob.) |
|
MultiStart_PoolSize |
The maximum number of problem objects allowed to pool up before synchronization in the deterministic multistart.
(Inherited from XPRSprob.) |
|
MultiStart_Seed |
Random seed used for the automatic generation of initial point when loading multistart presets
(Inherited from XPRSprob.) |
|
MultiStart_Threads |
The maximum number of threads to be used in multistart
(Inherited from XPRSprob.) |
|
MutexCallBacks |
Branch and Bound: This determines whether the callback routines are mutexed from within the optimizer.
(Inherited from XPRSprob.) |
|
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).
(Inherited from XPRSprob.) |
|
NetCuts | Obsolete.
Control NETCUTS.
(Inherited from XPRSprob.) |
|
NetStallLimit |
Limit the number of degenerate pivots of the network simplex algorithm, before switching to either primal or dual simplex, depending on
ALGAFTERNETWORK.
(Inherited from XPRSprob.) |
|
NlpCalcThreads |
Number of threads used for formula and derivatives evaluations
(Inherited from XPRSprob.) |
|
NlpDefaultIV |
Default initial value for an SLP variable if none is explicitly given
(Inherited from XPRSprob.) |
|
NlpDerivatives |
Bitmap describing the method of calculating derivatives
(Inherited from XPRSprob.) |
|
NlpDeterministic |
Determines if the parallel features of SLP should be guaranteed to be deterministic
(Inherited from XPRSprob.) |
|
NlpEqualsColumn |
Index of the reserved "=" column
(Inherited from XPRSprob.) |
|
NlpEvaluate |
Evaluation strategy for user functions
(Inherited from XPRSprob.) |
|
NlpFindIV |
Option for running a heuristic to find a feasible initial point
(Inherited from XPRSprob.) |
|
NlpFuncEval |
Bit map for determining the method of evaluating user functions and their derivatives
(Inherited from XPRSprob.) |
|
NlpHessian |
Second order differentiation mode when using analytical derivatives
(Inherited from XPRSprob.) |
|
NlpIfs |
Number of internal functions
(Inherited from XPRSprob.) |
|
NlpImplicitVariables |
Number of SLP variables appearing only in coefficients
(Inherited from XPRSprob.) |
|
NlpInfinity |
Value returned by a divide-by-zero in a formula
(Inherited from XPRSprob.) |
|
NlpJacobian |
First order differentiation mode when using analytical derivatives
(Inherited from XPRSprob.) |
|
NlpJobID |
Unique identifier for the current job
(Inherited from XPRSprob.) |
|
NlpKeepBestIter |
The iteration in which the returned solution has been found.
(Inherited from XPRSprob.) |
|
NlpLinQuadBR |
Use linear and quadratic constraints and objective function to further reduce bounds on all variables
(Inherited from XPRSprob.) |
|
NlpLog |
Level of printing during SLP iterations
(Inherited from XPRSprob.) |
|
NlpMaxTime |
The maximum time in seconds that the SLP optimization will run before it terminates
(Inherited from XPRSprob.) |
|
NlpMeritLambda |
Factor by which the net objective is taken into account in the merit function
(Inherited from XPRSprob.) |
|
NlpModelCols |
Number of model columns in the problem
(Inherited from XPRSprob.) |
|
NlpModelRows |
Number of model rows in the problem
(Inherited from XPRSprob.) |
|
NlpObjVal |
Objective function value excluding any penalty costs
(Inherited from XPRSprob.) |
|
NlpOptTime |
Time spent in optimization
(Inherited from XPRSprob.) |
|
NlpOriginalCols |
Number of model columns in the extended original problem
(Inherited from XPRSprob.) |
|
NlpOriginalRows |
Number of model rows in the extended original problem
(Inherited from XPRSprob.) |
|
NlpPostsolve |
This control determines whether postsolving should be performed automatically
(Inherited from XPRSprob.) |
|
NlpPresolve |
This control determines whether presolving should be performed prior to starting the main algorithm
(Inherited from XPRSprob.) |
|
NlpPresolve_ElimTol |
Tolerance for nonlinear eliminations during SLP presolve
(Inherited from XPRSprob.) |
|
NlpPresolveEliminations |
Number of SLP variables eliminated by
XSLPpresolve
(Inherited from XPRSprob.) |
|
NlpPresolveLevel |
This control determines the level of changes presolve may carry out on the problem and whether column/row indices may change
(Inherited from XPRSprob.) |
|
NlpPresolveOps |
Bitmap indicating the SLP presolve actions to be taken
(Inherited from XPRSprob.) |
|
NlpPresolveZero |
Minimum absolute value for a variable which is identified as nonzero during SLP presolve
(Inherited from XPRSprob.) |
|
NlpPrimalIntegralAlpha |
Decay term for primal integral computation
(Inherited from XPRSprob.) |
|
NlpPrimalIntegralRef |
Reference solution value to take into account when calculating the primal integral
(Inherited from XPRSprob.) |
|
NlpProbing |
This control determines whether probing on a subset of variables should be performed prior to starting the main algorithm. Probing runs multiple times bound reduction in order to further tighten the bounding box.
(Inherited from XPRSprob.) |
|
NlpReformulate |
Controls the problem reformulations carried out before augmentation. This allows SLP to take advantage of dedicated algorithms for special problem classes.
(Inherited from XPRSprob.) |
|
NLPSolver |
Selects the library to use for local solves
(Inherited from XPRSprob.) |
|
NlpStatus |
Bitmap holding the problem convergence status
(Inherited from XPRSprob.) |
|
NlpStopOutOfRange |
Stop optimization and return error code if internal function argument is out of range
(Inherited from XPRSprob.) |
|
NlpStopStatus |
Status of the optimization process.
(Inherited from XPRSprob.) |
|
NlpThreads |
Default number of threads to be used
(Inherited from XPRSprob.) |
|
NlpThreadSafeUserFunc |
Defines if user functions are allowed to be called in parallel
(Inherited from XPRSprob.) |
|
NlpUFs |
Number of user functions
(Inherited from XPRSprob.) |
|
NlpUseDerivatives |
Indicates whether numeric or analytic derivatives were used to create the linear approximations and solve the problem
(Inherited from XPRSprob.) |
|
NlpUserFuncCalls |
Number of calls made to user functions
(Inherited from XPRSprob.) |
|
NlpValidationFactor |
Minimum improvement in validation targets to continue iterating
(Inherited from XPRSprob.) |
|
NlpValidationIndex_A |
Absolute validation index
(Inherited from XPRSprob.) |
|
NlpValidationIndex_K |
Relative first order optimality validation index
(Inherited from XPRSprob.) |
|
NlpValidationIndex_R |
Relative validation index
(Inherited from XPRSprob.) |
|
NlpValidationTarget_K |
Optimality target tolerance
(Inherited from XPRSprob.) |
|
NlpValidationTarget_R |
Feasiblity target tolerance
(Inherited from XPRSprob.) |
|
NlpValidationTol_A |
Absolute tolerance for the XSLPvalidate procedure
(Inherited from XPRSprob.) |
|
NlpValidationTol_K |
Relative tolerance for the XSLPvalidatekkt procedure
(Inherited from XPRSprob.) |
|
NlpValidationTol_R |
Relative tolerance for the XSLPvalidate procedure
(Inherited from XPRSprob.) |
|
NlpVariables |
Number of SLP variables
(Inherited from XPRSprob.) |
|
NlpZero |
Absolute tolerance
(Inherited from XPRSprob.) |
|
NodeDepth |
Depth of the current node.
(Inherited from XPRSprob.) |
|
NodeProbingEffort |
Adjusts the overall level of node probing.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
NodeSelection |
Branch and Bound: This determines which nodes will be considered for solution once the current node has been solved.
(Inherited from XPRSprob.) |
|
NonLinearConstraints |
Number of nonlinear constraints in the problem
(Inherited from XPRSprob.) |
|
NumericalEmphasis |
How much emphasis to place on numerical stability instead of solve speed.
(Inherited from XPRSprob.) |
|
NumIIS |
Number of IISs found. You should first query the
IISSOLSTATUS attribute to make sure that the IIS procedure terminated successfully.
(Inherited from XPRSprob.) |
|
Objectives |
Number of objectives in the problem.
(Inherited from XPRSprob.) |
|
ObjectPointer |
Returns the C language 'pointer' to the native object that this managed class is wrapping. For internal FICO use only.
(Inherited from XPRSobject.) |
|
ObjName | Obsolete. (Inherited from XPRSprob.) |
|
ObjRHS |
Fixed part of the objective function.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
ObjSense |
Get objective sense.
(Inherited from XPRSprob.) |
|
OBJSense |
Sense of the optimization being performed.
(Inherited from XPRSprob.) |
|
ObjsToSolve |
Number of objectives that will be solved during the current multi-objective solve.
(Inherited from XPRSprob.) |
|
ObjVal |
Value of the objective function of the last problem solved with optimize.
(Inherited from XPRSprob.) |
|
ObservedPrimalIntegral |
Value of the (observed) primal integral.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
OptimalityTolTarget |
This specifies the target optimality tolerance for the solution refiner.
(Inherited from XPRSprob.) |
|
OptimizeTypeUsed |
The type of solver used in the last call to
optimize,
mipOptimize,
lpOptimize or
nlpOptimize.
(Inherited from XPRSprob.) |
|
OriginalCols |
Number of columns (i.e. variables) in the original matrix before presolving.
(Inherited from XPRSprob.) |
|
OriginalGenconCols |
Number of input variables in general constraints in the original problem before presolving.
(Inherited from XPRSprob.) |
|
OriginalGencons |
Number of general constraints in the original problem before presolving.
(Inherited from XPRSprob.) |
|
OriginalGenconVals |
Number of constant values in general constraints in the original problem before presolving.
(Inherited from XPRSprob.) |
|
OriginalIndicators |
Number of indicator constraints in the original matrix before presolving.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
OriginalPwlpoints |
Number of breakpoints of piecewise linear constraints in the original problem before presolving.
(Inherited from XPRSprob.) |
|
OriginalPwls |
Number of piecewise linear constraints in the original problem before presolving.
(Inherited from XPRSprob.) |
|
OriginalQCElems |
Number of quadratic row coefficients in the original matrix before presolving.
(Inherited from XPRSprob.) |
|
OriginalQConstraints |
Number of rows with quadratic coefficients in the original matrix before presolving.
(Inherited from XPRSprob.) |
|
OriginalQElems |
Number of quadratic non-zeros in the original objective before presolving.
(Inherited from XPRSprob.) |
|
OriginalRows |
Number of rows (i.e. constraints) in the original matrix before presolving.
(Inherited from XPRSprob.) |
|
OriginalSetMembers |
Number of variables within special ordered sets (set members) in the original matrix before presolving.
(Inherited from XPRSprob.) |
|
OriginalSets |
Number of special ordered sets in the original matrix before presolving.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
OutputTol |
Zero tolerance on print values.
(Inherited from XPRSprob.) |
|
ParentNode |
The parent node of the current node in the tree search.
(Inherited from XPRSprob.) |
|
PeakMemory |
An estimate of the peak amount of dynamically allocated heap memory by the problem.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
Penalty |
Minimum absolute penalty variable coefficient.
BIGM and
PENALTY are set by the input routine (
readProb (
READPROB)) but may be reset by the user prior to
lpOptimize (
LPOPTIMIZE).
(Inherited from XPRSprob.) |
|
PenaltyValue |
The weighted sum of violations in the solution to the relaxed problem identified by the infeasibility repair function.
(Inherited from XPRSprob.) |
|
PhysicalCoresDetected |
The total number of physical cores across all CPUs detected by the optimizer.
(Inherited from XPRSprob.) |
|
PhysicalCoresPerCPUDetected |
The number of physical cores per CPU detected by the optimizer.
(Inherited from XPRSprob.) |
|
PivotTol |
Simplex: The zero tolerance for matrix elements. On each iteration, the simplex method seeks a nonzero matrix element to pivot on. Any element with absolute value less than
PIVOTTOL is treated as zero for this purpose.
(Inherited from XPRSprob.) |
|
PPFactor |
The partial pricing candidate list sizing parameter.
(Inherited from XPRSprob.) |
|
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)
(Inherited from XPRSprob.) |
|
PreBasisRed |
Determines if a lattice basis reduction algorithm should be attempted as part of presolve
(Inherited from XPRSprob.) |
|
PreBndRedCone |
Determines if second order cone constraints should be used for inferring bound reductions on variables when solving a MIP.
(Inherited from XPRSprob.) |
|
PreBndRedQuad |
Determines if convex quadratic constraints should be used for inferring bound reductions on variables when solving a MIP.
(Inherited from XPRSprob.) |
|
PreCliqueStrategy |
Determines how much effort to spend on clique covers in presolve.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PreComponents |
Presolve: determines whether small independent components should be detected and solved as individual subproblems during root node processing.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PreConeDecomp |
Presolve: decompose regular and rotated cones with more than two elements and apply Outer Approximation on the resulting components.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PreConvertObjToCons |
Presolve: convert a linear or quadratic objective function into an objective transfer constraint
(Inherited from XPRSprob.) |
|
PreConvertSeparable |
Presolve: reformulate problems with a non-diagonal quadratic objective and/or constraints as diagonal quadratic or second-order conic constraints.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PreDomCol |
Presolve: Determines the level of dominated column removal reductions to perform when presolving a mixed integer problem. Only binary columns will be checked.
(Inherited from XPRSprob.) |
|
PreDomRow |
Presolve: Determines the level of dominated row removal reductions to perform when presolving a problem.
(Inherited from XPRSprob.) |
|
PreDupRow |
Presolve: Determines the type of duplicate rows to look for and eliminate when presolving a problem.
(Inherited from XPRSprob.) |
|
PreElimQuad |
Presolve: Allows for elimination of quadratic variables via doubleton rows.
(Inherited from XPRSprob.) |
|
PreFolding |
Presolve: Determines if a folding procedure should be used to aggregate continuous columns in an equitable partition.
(Inherited from XPRSprob.) |
|
PreImplications |
Presolve: Determines whether to use implication structures to remove redundant rows. If implication sequences are detected, they might also be used in probing.
(Inherited from XPRSprob.) |
|
PreLinDep |
Presolve: Determines whether to check for and remove linearly dependent equality constraints when presolving a problem.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PrePermute |
This bit vector control specifies whether to randomly permute rows, columns and MIP entities when starting the presolve. With the default value
0, no permutation will take place.
(Inherited from XPRSprob.) |
|
PrePermuteSeed |
This control sets the seed for the pseudo-random number generator for permuting the problem when starting the presolve. This control only has effects when
PREPERMUTE is enabled.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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
crossoverLpSol.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PresolveIndex |
Presolve: The row or column index on which presolve detected a problem to be infeasible or unbounded.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PresolveOps |
This bit vector control specifies the operations which are performed during the presolve.
(Inherited from XPRSprob.) |
|
PresolvePasses |
Number of reduction rounds to be performed in presolve
(Inherited from XPRSprob.) |
|
PresolveState |
Problem status as a bit map.
(Inherited from XPRSprob.) |
|
PreSort |
This bit vector control 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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PrimalDualIntegral |
Value of the primal-dual integral.
(Inherited from XPRSprob.) |
|
PrimalInfeas |
Number of primal infeasibilities.
(Inherited from XPRSprob.) |
|
PrimalOps |
Primal simplex: allows fine tuning the variable selection in the primal simplex solver.
(Inherited from XPRSprob.) |
|
PrimalPerturb |
The factor by which the problem will be perturbed prior to optimization by primal simplex. A value of
0.0 results in no perturbation prior to optimization. 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.
(Inherited from XPRSprob.) |
|
PrimalUnshift |
Determines whether primal is allowed to call dual to unshift.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PwlCons |
Number of piecewise linear constraints in the problem.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
PwlPoints |
Number of breakpoints of piecewise linear constraints in the problem.
(Inherited from XPRSprob.) |
|
QCCuts |
Branch and Bound: Limit on the number of rounds of outer approximation cuts generated for the root node, when solving a mixed integer quadratic constrained or mixed integer second order conic problem with outer approximation.
(Inherited from XPRSprob.) |
|
QCElems |
Number of quadratic row coefficients in the matrix.
(Inherited from XPRSprob.) |
|
QConstraints |
Number of rows with quadratic coefficients in the matrix.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
QElems |
Number of quadratic non-zeros in the objective.
(Inherited from XPRSprob.) |
|
QSimplexOps |
Controls the behavior of the quadratic simplex solvers.
(Inherited from XPRSprob.) |
|
QuadraticUnshift |
Determines whether an extra solution purification step is called after a solution found by the quadratic simplex (either primal or dual).
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
RangeName |
Active range name.
(Inherited from XPRSprob.) |
|
Refactor |
Indicates whether the optimization should restart using the current representation of the factorization in memory.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
RepairIndefiniteQ |
Controls if the optimizer should make indefinite quadratic matrices positive definite when it is possible.
(Inherited from XPRSprob.) |
|
RepairIndefiniteQMax |
Control REPAIRINDEFINITEQMAX.
(Inherited from XPRSprob.) |
|
RepairInfeasMaxTime | Obsolete.
Overall time limit for the repairinfeas tool
(Inherited from XPRSprob.) |
|
RepairInfeasTimeLimit |
Overall time limit for the repairinfeas tool
(Inherited from XPRSprob.) |
|
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
(Inherited from XPRSprob.) |
|
Restarts |
Total number of restarts performed.
(Inherited from XPRSprob.) |
|
RHSName |
Active right hand side name.
(Inherited from XPRSprob.) |
|
RLTCuts |
Determines whether RLT cuts should be separated in the Xpress Global Solver.
(Inherited from XPRSprob.) |
|
RootPresolve |
Determines if presolving should be performed on the problem after the tree search has finished with root cutting and heuristics.
(Inherited from XPRSprob.) |
|
Rows |
Number of rows (i.e. constraints) in the matrix.
(Inherited from XPRSprob.) |
|
SBBest |
Number of infeasible MIP entities to initialize pseudo costs for on each node.
(Inherited from XPRSprob.) |
|
SbEffort |
Adjusts the overall amount of effort when using strong branching to select an infeasible MIP entity to branch on.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
SBIterLimit |
Number of dual iterations to perform the strong branching for each entity.
(Inherited from XPRSprob.) |
|
SBSelect |
The size of the candidate list of MIP entities for strong branching.
(Inherited from XPRSprob.) |
|
Scaling |
This bit vector control determines how the Optimizer will rescale a model internally before optimization. If set to
0, no scaling will take place.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
SetMembers |
Number of variables within special ordered sets (set members) in the matrix.
(Inherited from XPRSprob.) |
|
Sets |
Number of special ordered sets in the matrix.
(Inherited from XPRSprob.) |
|
Sifting |
Determines whether to enable sifting algorithm with the dual simplex method.
(Inherited from XPRSprob.) |
|
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. .
(Inherited from XPRSprob.) |
|
SiftPresolveOps |
Determines the presolve operations for solving the subproblems during the sifting algorithm.
(Inherited from XPRSprob.) |
|
SiftSwitch |
Determines which algorithm to use for solving the subproblems during sifting.
(Inherited from XPRSprob.) |
|
SimplexIter |
Number of simplex iterations performed.
(Inherited from XPRSprob.) |
|
SleepOnThreadWait | Obsolete.
In previous versions this was used to determine if the threads should be put into a wait state when waiting for work.
(Inherited from XPRSprob.) |
|
SlpAlgorithm |
Bit map describing the SLP algorithm(s) to be used
(Inherited from XPRSprob.) |
|
SlpAnalyze |
Bit map activating additional options supporting model / solution path analyzis
(Inherited from XPRSprob.) |
|
SlpATol_A |
Absolute delta convergence tolerance
(Inherited from XPRSprob.) |
|
SlpATol_R |
Relative delta convergence tolerance
(Inherited from XPRSprob.) |
|
SlpAugmentation |
Bit map describing the SLP augmentation method(s) to be used
(Inherited from XPRSprob.) |
|
SlpAutoSave |
Frequency with which to save the model
(Inherited from XPRSprob.) |
|
SlpBarCrossoverStart |
Default crossover activation behaviour for barrier start
(Inherited from XPRSprob.) |
|
SlpBarLimit |
Number of initial SLP iterations using the barrier method
(Inherited from XPRSprob.) |
|
SlpBarStallingLimit |
Number of iterations to allow numerical failures in barrier before switching to dual
(Inherited from XPRSprob.) |
|
SlpBarStallingObjLimit |
Number of iterations over which to measure the objective change for barrier iterations with no crossover
(Inherited from XPRSprob.) |
|
SlpBarStallingTol |
Required change in the objective when progress is measured in barrier iterations without crossover
(Inherited from XPRSprob.) |
|
SlpBarStartOps |
Controls behaviour when the barrier is used to solve the linearizations
(Inherited from XPRSprob.) |
|
SlpBoundThreshold |
The maximum size of a bound that can be introduced by nonlinear presolve.
(Inherited from XPRSprob.) |
|
SlpCascade |
Bit map describing the cascading to be used
(Inherited from XPRSprob.) |
|
SlpCascadeNLimit |
Maximum number of iterations for cascading with non-linear determining rows
(Inherited from XPRSprob.) |
|
SlpCascadeTol_PA |
Absolute cascading print tolerance
(Inherited from XPRSprob.) |
|
SlpCascadeTol_PR |
Relative cascading print tolerance
(Inherited from XPRSprob.) |
|
SlpCDTol_A |
Absolute tolerance for deducing constant derivatives
(Inherited from XPRSprob.) |
|
SlpCDTol_R |
Relative tolerance for deducing constant derivatives
(Inherited from XPRSprob.) |
|
SlpClampShrink |
Shrink ratio used to impose strict convergence on variables converged in extended criteria only
(Inherited from XPRSprob.) |
|
SlpClampValidationTol_A |
Absolute validation tolerance for applying
XSLP_CLAMPSHRINK
(Inherited from XPRSprob.) |
|
SlpClampValidationTol_R |
Relative validation tolerance for applying
XSLP_CLAMPSHRINK
(Inherited from XPRSprob.) |
|
SlpCoefficients |
Number of nonlinear coefficients
(Inherited from XPRSprob.) |
|
SlpConvergenceOps |
Bit map describing which convergence tests should be carried out
(Inherited from XPRSprob.) |
|
SlpCTol |
Closure convergence tolerance
(Inherited from XPRSprob.) |
|
SlpCurrentDeltaCost |
Current value of penalty cost multiplier for penalty delta vectors
(Inherited from XPRSprob.) |
|
SlpCurrentErrorCost |
Current value of penalty cost multiplier for penalty error vectors
(Inherited from XPRSprob.) |
|
SlpCutStrategy |
Determines whihc cuts to apply in the MISLP search when the default SLP-in-MIP strategy is used.
(Inherited from XPRSprob.) |
|
SlpDamp |
Damping factor for updating values of variables
(Inherited from XPRSprob.) |
|
SlpDampExpand |
Multiplier to increase damping factor during dynamic damping
(Inherited from XPRSprob.) |
|
SlpDampMax |
Maximum value for the damping factor of a variable during dynamic damping
(Inherited from XPRSprob.) |
|
SlpDampMin |
Minimum value for the damping factor of a variable during dynamic damping
(Inherited from XPRSprob.) |
|
SlpDampShrink |
Multiplier to decrease damping factor during dynamic damping
(Inherited from XPRSprob.) |
|
SlpDampStart |
SLP iteration at which damping is activated
(Inherited from XPRSprob.) |
|
SlpDefaultStepBound |
Minimum initial value for the step bound of an SLP variable if none is explicitly given
(Inherited from XPRSprob.) |
|
SlpDelayUpdateRows |
Number of SLP iterations before update rows are fully activated
(Inherited from XPRSprob.) |
|
SlpDelta_A |
Absolute perturbation of values for calculating numerical derivatives
(Inherited from XPRSprob.) |
|
SlpDelta_Infinity |
Maximum value for partial derivatives
(Inherited from XPRSprob.) |
|
SlpDelta_R |
Relative perturbation of values for calculating numerical derivatives
(Inherited from XPRSprob.) |
|
SlpDelta_X |
Minimum absolute value of delta coefficients to be retained
(Inherited from XPRSprob.) |
|
SlpDelta_Z |
Tolerance used when calculating derivatives
(Inherited from XPRSprob.) |
|
SlpDelta_Zero |
Absolute zero acceptance tolerance used when calculating derivatives
(Inherited from XPRSprob.) |
|
SlpDeltaCost |
Initial penalty cost multiplier for penalty delta vectors
(Inherited from XPRSprob.) |
|
SlpDeltaCostFactor |
Factor for increasing cost multiplier on total penalty delta vectors
(Inherited from XPRSprob.) |
|
SlpDeltaMaxCost |
Maximum penalty cost multiplier for penalty delta vectors
(Inherited from XPRSprob.) |
|
SlpDeltaOffset |
Position of first character of SLP variable name used to create name of delta vector
(Inherited from XPRSprob.) |
|
SlpDeltas |
Number of delta vectors created during augmentation
(Inherited from XPRSprob.) |
|
SlpDeltaZLimit |
Number of SLP iterations during which to apply XSLP_DELTA_Z
(Inherited from XPRSprob.) |
|
SlpDJTol |
Tolerance on DJ value for determining if a variable is at its step bound
(Inherited from XPRSprob.) |
|
SlpDRColDjTol |
Reduced cost tolerance on the delta variable when fixing due to the determining column being below
XSLP_DRCOLTOL.
(Inherited from XPRSprob.) |
|
SlpDRColTol |
The minimum absolute magnitude of a determining column, for which the determined variable is still regarded as well defined
(Inherited from XPRSprob.) |
|
SlpDRFixRange |
The range around the previous value where variables are fixed in cascading if the determining column is below
XSLP_DRCOLTOL.
(Inherited from XPRSprob.) |
|
SlpECFCheck |
Check feasibility at the point of linearization for extended convergence criteria
(Inherited from XPRSprob.) |
|
SlpECFCount |
Number of infeasible constraints found at the point of linearization
(Inherited from XPRSprob.) |
|
SlpEcfTol_A |
Absolute tolerance on testing feasibility at the point of linearization
(Inherited from XPRSprob.) |
|
SlpEcfTol_R |
Relative tolerance on testing feasibility at the point of linearization
(Inherited from XPRSprob.) |
|
SlpEnforceCostShrink |
Factor by which to decrease the current penalty multiplier when enforcing rows.
(Inherited from XPRSprob.) |
|
SlpEnforceMaxCost |
Maximum penalty cost in the objective before enforcing most violating rows
(Inherited from XPRSprob.) |
|
SlpErrorCost |
Initial penalty cost multiplier for penalty error vectors
(Inherited from XPRSprob.) |
|
SlpErrorCostFactor |
Factor for increasing cost multiplier on total penalty error vectors
(Inherited from XPRSprob.) |
|
SlpErrorCosts |
Total penalty costs in the solution
(Inherited from XPRSprob.) |
|
SlpErrorMaxCost |
Maximum penalty cost multiplier for penalty error vectors
(Inherited from XPRSprob.) |
|
SlpErrorOffset |
Position of first character of constraint name used to create name of penalty error vectors
(Inherited from XPRSprob.) |
|
SlpErrorTol_A |
Absolute tolerance for error vectors
(Inherited from XPRSprob.) |
|
SlpErrorTol_P |
Absolute tolerance for printing error vectors
(Inherited from XPRSprob.) |
|
SlpEscalation |
Factor for increasing cost multiplier on individual penalty error vectors
(Inherited from XPRSprob.) |
|
SlpETol_A |
Absolute tolerance on penalty vectors
(Inherited from XPRSprob.) |
|
SlpETol_R |
Relative tolerance on penalty vectors
(Inherited from XPRSprob.) |
|
SlpEVTol_A |
Absolute tolerance on total penalty costs
(Inherited from XPRSprob.) |
|
SlpEVTol_R |
Relative tolerance on total penalty costs
(Inherited from XPRSprob.) |
|
SlpExpand |
Multiplier to increase a step bound
(Inherited from XPRSprob.) |
|
SlpFeastolTarget |
When set, this defines a target feasibility tolerance to which the linearizations are solved to
(Inherited from XPRSprob.) |
|
SlpFilter |
Bit map for controlling solution updates
(Inherited from XPRSprob.) |
|
SlpGranularity |
Base for calculating penalty costs
(Inherited from XPRSprob.) |
|
SlpGridHeurSelect |
Bit map selectin which heuristics to run if the problem has variable with an integer delta
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
SlpInfeasLimit |
The maximum number of consecutive infeasible SLP iterations which can occur before Xpress-SLP terminates
(Inherited from XPRSprob.) |
|
SlpIter |
SLP iteration count
(Inherited from XPRSprob.) |
|
SlpIterLimit |
The maximum number of SLP iterations
(Inherited from XPRSprob.) |
|
SlpItol_A |
Absolute impact convergence tolerance
(Inherited from XPRSprob.) |
|
SlpITol_R |
Relative impact convergence tolerance
(Inherited from XPRSprob.) |
|
SlpLSIterLimit |
Number of iterations in the line search
(Inherited from XPRSprob.) |
|
SlpLSPatternLimit |
Number of iterations in the pattern search preceding the line search
(Inherited from XPRSprob.) |
|
SlpLSStart |
Iteration in which to active the line search
(Inherited from XPRSprob.) |
|
SlpLSZeroLimit |
Maximum number of zero length line search steps before line search is deactivated
(Inherited from XPRSprob.) |
|
SlpMatrixTol |
Nonzero tolerance for dropping coefficients from the linearization.
(Inherited from XPRSprob.) |
|
SlpMaxWeight |
Maximum penalty weight for delta or error vectors
(Inherited from XPRSprob.) |
|
SlpMinSBFactor |
Factor by which step bounds can be decreased beneath
XSLP_ATOL_A
(Inherited from XPRSprob.) |
|
SlpMinusPenaltyErrors |
Number of negative penalty error vectors
(Inherited from XPRSprob.) |
|
SlpMinWeight |
Minimum penalty weight for delta or error vectors
(Inherited from XPRSprob.) |
|
SlpMipAlgorithm |
Bitmap describing the MISLP algorithms to be used
(Inherited from XPRSprob.) |
|
SlpMipCutoff_A |
Absolute objective function cutoff for MIP termination
(Inherited from XPRSprob.) |
|
SlpMipCutoff_R |
Absolute objective function cutoff for MIP termination
(Inherited from XPRSprob.) |
|
SlpMipCutOffCount |
Number of SLP iterations to check when considering a node for cutting off
(Inherited from XPRSprob.) |
|
SlpMipCutoffLimit |
Number of SLP iterations to check when considering a node for cutting off
(Inherited from XPRSprob.) |
|
SlpMipDefaultAlgorithm |
Default algorithm to be used during the tree search in MISLP
(Inherited from XPRSprob.) |
|
SlpMipErrorTol_A |
Absolute penalty error cost tolerance for MIP cut-off
(Inherited from XPRSprob.) |
|
SlpMipErrorTol_R |
Relative penalty error cost tolerance for MIP cut-off
(Inherited from XPRSprob.) |
|
SlpMipFixStepBounds |
Bitmap describing the step-bound fixing strategy during MISLP
(Inherited from XPRSprob.) |
|
SlpMipIter |
Total number of SLP iterations in MISLP
(Inherited from XPRSprob.) |
|
SlpMipIterLimit |
Maximum number of SLP iterations at each node
(Inherited from XPRSprob.) |
|
SlpMipLog |
Frequency with which MIP status is printed
(Inherited from XPRSprob.) |
|
SlpMipNodes |
Number of nodes explored in MISLP. This includes any nodes for which a non-linear solve has been carried out.
(Inherited from XPRSprob.) |
|
SlpMipOCount |
Number of SLP iterations at each node over which to measure objective function variation
(Inherited from XPRSprob.) |
|
SlpMipOtol_A |
Absolute objective function tolerance for MIP termination
(Inherited from XPRSprob.) |
|
SlpMipOtol_R |
Relative objective function tolerance for MIP termination
(Inherited from XPRSprob.) |
|
SlpMipRelaxStepBounds |
Bitmap describing the step-bound relaxation strategy during MISLP
(Inherited from XPRSprob.) |
|
SlpMipSols |
Number of integer solutions found in MISLP. This includes solutions found during the tree search or any heuristics.
(Inherited from XPRSprob.) |
|
SlpMTol_A |
Absolute effective matrix element convergence tolerance
(Inherited from XPRSprob.) |
|
SlpMTol_R |
Relative effective matrix element convergence tolerance
(Inherited from XPRSprob.) |
|
SlpMVTol |
Marginal value tolerance for determining if a constraint is slack
(Inherited from XPRSprob.) |
|
SlpNonConstantCoeffs |
Number of coefficients in the augmented problem that might change between SLP iterations
(Inherited from XPRSprob.) |
|
SlpObjThreshold |
Assumed maximum value of the objective function in absolute value.
(Inherited from XPRSprob.) |
|
SlpObjToPenaltyCost |
Factor to estimate initial penalty costs from objective function
(Inherited from XPRSprob.) |
|
SlpOCount |
Number of SLP iterations over which to measure objective function variation for static objective (2) convergence criterion
(Inherited from XPRSprob.) |
|
SlpOptimalityTolTarget |
When set, this defines a target optimality tolerance to which the linearizations are solved to
(Inherited from XPRSprob.) |
|
SlpOTol_A |
Absolute static objective (2) convergence tolerance
(Inherited from XPRSprob.) |
|
SlpOTol_R |
Relative static objective (2) convergence tolerance
(Inherited from XPRSprob.) |
|
SlpPenaltyDeltaColumn |
Index of column costing the penalty delta row
(Inherited from XPRSprob.) |
|
SlpPenaltyDeltaRow |
Index of equality row holding the penalties for delta vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyDeltas |
Number of penalty delta vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyDeltaTotal |
Total activity of penalty delta vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyDeltaValue |
Total penalty cost attributed to penalty delta vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyErrorColumn |
Index of column costing the penalty error row
(Inherited from XPRSprob.) |
|
SlpPenaltyErrorRow |
Index of equality row holding the penalties for penalty error vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyErrors |
Number of penalty error vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyErrorTotal |
Total activity of penalty error vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyErrorValue |
Total penalty cost attributed to penalty error vectors
(Inherited from XPRSprob.) |
|
SlpPenaltyInfoStart |
Iteration from which to record row penalty information
(Inherited from XPRSprob.) |
|
SlpPlusPenaltyErrors |
Number of positive penalty error vectors
(Inherited from XPRSprob.) |
|
SlpSameCount |
Number of steps reaching the step bound in the same direction before step bounds are increased
(Inherited from XPRSprob.) |
|
SlpSameDamp |
Number of steps in same direction before damping factor is increased
(Inherited from XPRSprob.) |
|
SlpSBRowOffset |
Position of first character of SLP variable name used to create name of SLP lower and upper step bound rows
(Inherited from XPRSprob.) |
|
SlpSBStart |
SLP iteration after which step bounds are first applied
(Inherited from XPRSprob.) |
|
SlpSbxConverged |
Number of step-bounded variables converged only on extended criteria
(Inherited from XPRSprob.) |
|
SlpShrink |
Multiplier to reduce a step bound
(Inherited from XPRSprob.) |
|
SlpShrinkBias |
Defines an overwrite / adjustment of step bounds for improving iterations
(Inherited from XPRSprob.) |
|
SlpStatus |
Bitmap holding the problem convergence status
(Inherited from XPRSprob.) |
|
SlpSTol_A |
Absolute slack convergence tolerance
(Inherited from XPRSprob.) |
|
SlpSTol_R |
Relative slack convergence tolerance
(Inherited from XPRSprob.) |
|
SlpTolSets |
Number of tolerance sets.
(Inherited from XPRSprob.) |
|
SlpTraceMaskOps |
Controls the information printed for
XSLP_TRACEMASK. The order in which the information is printed is determined by the order of bits in
XSLP_TRACEMASKOPS.
(Inherited from XPRSprob.) |
|
SlpUCConstrainedCount |
Number of unconverged variables with coefficients in constraining rows
(Inherited from XPRSprob.) |
|
SlpUnConverged |
Number of unconverged values
(Inherited from XPRSprob.) |
|
SlpUnFinishedLimit |
The number of consecutive SLP iterations that may have an unfinished status before the solve is terminated.
(Inherited from XPRSprob.) |
|
SlpUpdateOffset |
Position of first character of SLP variable name used to create name of SLP update row
(Inherited from XPRSprob.) |
|
SlpVCount |
Number of SLP iterations over which to measure static objective (3) convergence
(Inherited from XPRSprob.) |
|
SlpVLimit |
Number of SLP iterations after which static objective (3) convergence testing starts
(Inherited from XPRSprob.) |
|
SlpVTol_A |
Absolute static objective (3) convergence tolerance
(Inherited from XPRSprob.) |
|
SlpVTol_R |
Relative static objective (3) convergence tolerance
(Inherited from XPRSprob.) |
|
SlpWCount |
Number of SLP iterations over which to measure the objective for the extended convergence continuation criterion
(Inherited from XPRSprob.) |
|
SlpWTol_A |
Absolute extended convergence continuation tolerance
(Inherited from XPRSprob.) |
|
SlpWTol_R |
Relative extended convergence continuation tolerance
(Inherited from XPRSprob.) |
|
SlpXCount |
Number of SLP iterations over which to measure static objective (1) convergence
(Inherited from XPRSprob.) |
|
SlpXLimit |
Number of SLP iterations up to which static objective (1) convergence testing starts
(Inherited from XPRSprob.) |
|
SlpXTol_A |
Absolute static objective function (1) tolerance
(Inherited from XPRSprob.) |
|
SlpXTol_R |
Relative static objective function (1) tolerance
(Inherited from XPRSprob.) |
|
SlpZeroCriterion |
Bitmap determining the behavior of the placeholder deletion procedure
(Inherited from XPRSprob.) |
|
SlpZeroCriterionCount |
Number of consecutive times a placeholder entry is zero before being considered for deletion
(Inherited from XPRSprob.) |
|
SlpZeroCriterionStart |
SLP iteration at which criteria for deletion of placeholder entries are first activated.
(Inherited from XPRSprob.) |
|
SlpZeroesReset |
Number of placeholder entries set to zero
(Inherited from XPRSprob.) |
|
SlpZeroesRetained |
Number of potentially zero placeholders left untouched
(Inherited from XPRSprob.) |
|
SlpZeroesTotal |
Number of potential zero placeholder entries
(Inherited from XPRSprob.) |
|
SolStatus |
Status of the solution of the last problem solved with optimize.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
SolvedObjs |
Number of objectives that have been solved so far during a multi-objective solve.
(Inherited from XPRSprob.) |
|
SolveStatus |
Status of the solve of the last problem solved with optimize.
(Inherited from XPRSprob.) |
|
SOSRefTol |
The minimum relative gap between the ordering values of elements in a special ordered set. The gap divided by the absolute value of the larger of the two adjacent values must be at least
SOSREFTOL.
(Inherited from XPRSprob.) |
|
SpareCols |
Number of spare columns in the matrix.
(Inherited from XPRSprob.) |
|
SpareElems |
Number of spare matrix elements in the matrix.
(Inherited from XPRSprob.) |
|
SpareMIPEnts |
Number of spare MIP entities in the matrix.
(Inherited from XPRSprob.) |
|
SpareRows |
Number of spare rows in the matrix.
(Inherited from XPRSprob.) |
|
SpareSetElems |
Number of spare set elements in the matrix.
(Inherited from XPRSprob.) |
|
SpareSets |
Number of spare sets in the matrix.
(Inherited from XPRSprob.) |
|
StopStatus |
Status of the optimization process.
(Inherited from XPRSprob.) |
|
SumPrimalInf |
Scaled sum of primal infeasibilities.
(Inherited from XPRSprob.) |
|
Symmetry |
Adjusts the overall amount of effort for symmetry detection.
(Inherited from XPRSprob.) |
|
SymSelect |
Adjusts the overall amount of effort for symmetry detection.
(Inherited from XPRSprob.) |
|
SystemMemory |
The amount of non problem specific memory used by the solver.
(Inherited from XPRSprob.) |
|
Threads |
The default number of threads used during optimization.
(Inherited from XPRSprob.) |
|
Time |
Time spent solving the problem as measured by the optimizer.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
TotalMemory |
The amount of dynamically allocated heap memory by the optimizer, including all problems currently exsisting.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
TreeCompression |
When writing nodes to the gloal 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 affect of decreasing performance, while lower values compress quicker but not as effectively. Where
TREECOMPRESSION is set to 0, no data compression will be used on the tree file.
(Inherited from XPRSprob.) |
|
TreeCoverCuts |
Branch and Bound: The number of rounds of lifted cover inequalities generated at nodes other than the top node in the tree. Compare with the description for
COVERCUTS. A value of -1 indicates the number of rounds is determined automatically.
(Inherited from XPRSprob.) |
|
TreeCutSelect |
A bit vector providing detailed control of the cuts created during the tree search of a MIP solve. Use
CUTSELECT to control cuts on the root node.
(Inherited from XPRSprob.) |
|
TreeDiagnostics |
A bit vector providing control over how various tree-management-related messages get printed in the tree log file during the branch-and-bound search.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
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).
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
TreeGomCuts |
Branch and Bound: The number of rounds of Gomory cuts generated at nodes other than the first node in the tree. Compare with the description for
GOMCUTS. A value of -1 indicates the number of rounds is determined automatically.
(Inherited from XPRSprob.) |
|
TreeMemoryLimit |
A soft limit, in megabytes, for the amount of memory to use in storing the branch and bound search tree. This doesn't include memory used for presolve, heuristics, solving the LP relaxation, etc. When set to 0 (the default), the optimizer will calculate a limit automatically based on the amount of free physical memory detected in the machine. When the memory used by the branch and bound tree exceeds this limit, the optimizer will try to reduce the memory usage by writing lower-rated sections of the tree to a file called the "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.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
TreeMemoryUsage |
The amount of physical memory, in megabytes, currently being used to store the branch-and-bound search tree.
(Inherited from XPRSprob.) |
|
TreeQCCuts |
Branch and Bound: Limit on the number of rounds of outer approximation cuts generated for nodes other than the root node, when solving a mixed integer quadratic constrained or mixed integer second order conic problem with outer approximation.
(Inherited from XPRSprob.) |
|
TreeRestarts |
Number of in-tree restarts performed.
(Inherited from XPRSprob.) |
|
TunerHistory |
Tuner: Whether to reuse and append to previous tuner results of the same problem.
(Inherited from XPRSprob.) |
|
TunerMaxTime |
Tuner: The maximum time in seconds that the tuner will run before it terminates.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
TunerMethodFile |
Tuner: Defines a file from which the tuner can read user-defined tuner method.
(Inherited from XPRSprob.) |
|
TunerMode |
Tuner: Whether to always enable the tuner or disable it.
(Inherited from XPRSprob.) |
|
TunerOutput |
Tuner: Whether to output tuner results and logs to the file system.
(Inherited from XPRSprob.) |
|
TunerOutputPath |
Tuner: Defines a root path to which the tuner writes the result file and logs.
(Inherited from XPRSprob.) |
|
TunerPermute |
Tuner: Defines the number of permutations to solve for each control setting.
(Inherited from XPRSprob.) |
|
TunerSessionName |
Tuner: Defines a session name for the tuner.
(Inherited from XPRSprob.) |
|
TunerTarget |
Tuner: Defines the tuner target -- what should be evaluated when comparing two runs with different control settings.
(Inherited from XPRSprob.) |
|
TunerThreads |
Tuner: the number of threads used by the tuner.
(Inherited from XPRSprob.) |
|
TunerVerbose |
Tuner: whether the tuner should prints detailed information for each run.
(Inherited from XPRSprob.) |
|
UserSolHeuristic |
Determines how much effort to put into running a local search heuristic to find a feasible integer solution from a partial or infeasible user solution.
(Inherited from XPRSprob.) |
|
UUID |
Universally Unique Identifier for the problem instance.
(Inherited from XPRSprob.) |
|
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.
(Inherited from XPRSprob.) |
|
Version |
The Optimizer version number, e.g.
1301 meaning release 13.01.
(Inherited from XPRSprob.) |
|
XpressVersion |
The Xpress version number.
(Inherited from XPRSprob.) |
Methods
| Name | Description | |
|---|---|---|
|
AddAfterObjectiveCallback(AfterObjectiveCallback) |
Add AfterObjective callback.
(Inherited from XPRSprob.) |
|
AddAfterObjectiveCallback(AfterObjectiveCallback, Int32) |
Add AfterObjective callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddAfterObjectiveCallback(AfterObjectiveCallback, Object) |
Add AfterObjective callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddAfterObjectiveCallback(AfterObjectiveCallback, Object, Int32) |
Add AfterObjective callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBarIterationCallback(BarIterationCallback) |
Add BarIteration callback.
(Inherited from XPRSprob.) |
|
AddBarIterationCallback(BarIterationCallback, Int32) |
Add BarIteration callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddBarIterationCallback(BarIterationCallback, Object) |
Add BarIteration callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBarIterationCallback(BarIterationCallback, Object, Int32) |
Add BarIteration callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBarlogCallback(BarlogCallback) |
Add Barlog callback.
(Inherited from XPRSprob.) |
|
AddBarlogCallback(BarlogCallback, Int32) |
Add Barlog callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddBarlogCallback(BarlogCallback, Object) |
Add Barlog callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBarlogCallback(BarlogCallback, Object, Int32) |
Add Barlog callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBeforeObjectiveCallback(BeforeObjectiveCallback) |
Add BeforeObjective callback.
(Inherited from XPRSprob.) |
|
AddBeforeObjectiveCallback(BeforeObjectiveCallback, Int32) |
Add BeforeObjective callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddBeforeObjectiveCallback(BeforeObjectiveCallback, Object) |
Add BeforeObjective callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBeforeObjectiveCallback(BeforeObjectiveCallback, Object, Int32) |
Add BeforeObjective callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBeforeSolveCallback(BeforeSolveCallback) |
Add BeforeSolve callback.
(Inherited from XPRSprob.) |
|
AddBeforeSolveCallback(BeforeSolveCallback, Int32) |
Add BeforeSolve callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddBeforeSolveCallback(BeforeSolveCallback, Object) |
Add BeforeSolve callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddBeforeSolveCallback(BeforeSolveCallback, Object, Int32) |
Add BeforeSolve callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddChangeBranchObjectCallback(ChangeBranchObjectCallback) |
Add ChangeBranchObject callback.
(Inherited from XPRSprob.) |
|
AddChangeBranchObjectCallback(ChangeBranchObjectCallback, Int32) |
Add ChangeBranchObject callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddChangeBranchObjectCallback(ChangeBranchObjectCallback, Object) |
Add ChangeBranchObject callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddChangeBranchObjectCallback(ChangeBranchObjectCallback, Object, Int32) |
Add ChangeBranchObject callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddCheckTimeCallback(CheckTimeCallback) |
Add CheckTime callback.
(Inherited from XPRSprob.) |
|
AddCheckTimeCallback(CheckTimeCallback, Int32) |
Add CheckTime callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddCheckTimeCallback(CheckTimeCallback, Object) |
Add CheckTime callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddCheckTimeCallback(CheckTimeCallback, Object, Int32) |
Add CheckTime callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddChgbranchCallback(ChgbranchCallback) | Obsolete.
Add Chgbranch callback.
(Inherited from XPRSprob.) |
|
AddChgbranchCallback(ChgbranchCallback, Int32) | Obsolete.
Add Chgbranch callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddChgbranchCallback(ChgbranchCallback, Object) | Obsolete.
Add Chgbranch callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddChgbranchCallback(ChgbranchCallback, Object, Int32) | Obsolete.
Add Chgbranch callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddChgnodeCallback(ChgnodeCallback) | Obsolete.
Add Chgnode callback.
(Inherited from XPRSprob.) |
|
AddChgnodeCallback(ChgnodeCallback, Int32) | Obsolete.
Add Chgnode callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddChgnodeCallback(ChgnodeCallback, Object) | Obsolete.
Add Chgnode callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddChgnodeCallback(ChgnodeCallback, Object, Int32) | Obsolete.
Add Chgnode callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddCol(Double, Double, Double) |
Add a single column to this problem. This is a shortcut for
AddCol(obj, lb, ub, 'C', null, null, null);.
(Inherited from XPRSprob.) |
|
AddCol(Double, Double, Double, Char) |
Add a single column to this problem. This is a shortcut for
AddCol(obj, lb, ub, type, null, null, null);.
(Inherited from XPRSprob.) |
|
AddCol(Double, Double, Double, String) |
Add a single column to this problem. This is a shortcut for
AddCol(obj, lb, ub, 'C', null, null, name);.
(Inherited from XPRSprob.) |
|
AddCol(Double, Double, Double, Char, String) |
Add a single column to this problem. This is a shortcut for
AddCol(obj, lb, ub, type, null, null, name);.
(Inherited from XPRSprob.) |
|
AddCol(Double, Double, Double, Char, Int32, Double) |
Add a single column to this problem. This is a shortcut for
AddCol(obj, lb, ub, type, rowind, rowval, null);.
(Inherited from XPRSprob.) |
|
AddCol(Double, Double, Double, Char, Int32, Double, String) |
Add a single column to the model.
(Inherited from XPRSprob.) |
|
AddCols(Int32, Int32, Double, Int32, Int32, Double, Double, Double) |
Adds columns to the optimizer matrix.
(Inherited from XPRSprob.) |
|
AddCols(Int32, Int64, Double, Int64, Int32, Double, Double, Double) |
Adds columns to the optimizer matrix.
(Inherited from XPRSprob.) |
|
AddColumn |
Add a single column to this problem.
(Inherited from XPRSprob.) |
|
AddColumns(Int32) |
Create an 1-dimensional array of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToArray() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns int[ ] x = prob.AddColumns(dim) .WithType(Optimizer.Objects.ColumnType.Binary) .ToArray(); |
|
AddColumns(Int32, Int32) |
Create an 2-dimensional array of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToArray() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns int[ ,] x = prob.AddColumns(dim1 ,dim2) .WithType(Optimizer.Objects.ColumnType.Binary) .ToArray(); |
|
AddColumns(Int32, Int32, Int32) |
Create an 3-dimensional array of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToArray() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns int[ , ,] x = prob.AddColumns(dim1 ,dim2 ,dim3) .WithType(Optimizer.Objects.ColumnType.Binary) .ToArray(); |
|
AddColumns(Int32, Int32, Int32, Int32) |
Create an 4-dimensional array of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToArray() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns int[ , , ,] x = prob.AddColumns(dim1 ,dim2 ,dim3 ,dim4) .WithType(Optimizer.Objects.ColumnType.Binary) .ToArray(); |
|
AddColumns(Int32, Int32, Int32, Int32, Int32) |
Create an 5-dimensional array of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToArray() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns int[ , , , ,] x = prob.AddColumns(dim1 ,dim2 ,dim3 ,dim4 ,dim5) .WithType(Optimizer.Objects.ColumnType.Binary) .ToArray(); |
|
AddColumns<K1>(ICollection<K1>) |
Create an 1-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns System.Collections.Generic.Dictionary<K1 ,int> x = prob.AddColumns(coll1 ) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1>(IEnumerable<K1>) |
Create an 1-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns System.Collections.Generic.Dictionary<K1 ,int> x = prob.AddColumns(coll1 ) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1>(K1) |
Create an 1-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns System.Collections.Generic.Dictionary<K1 ,int> x = prob.AddColumns(coll1 ) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2>(ICollection<K1>, ICollection<K2>) |
Create an 2-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap2<K1 ,K2,int> x = prob.AddColumns(coll1 ,coll2) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2>(K1, K2) |
Create an 2-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap2<K1 ,K2,int> x = prob.AddColumns(coll1 ,coll2) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2, K3>(ICollection<K1>, ICollection<K2>, ICollection<K3>) |
Create an 3-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap3<K1 ,K2 ,K3,int> x = prob.AddColumns(coll1 ,coll2 ,coll3) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2, K3>(K1, K2, K3) |
Create an 3-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap3<K1 ,K2 ,K3,int> x = prob.AddColumns(coll1 ,coll2 ,coll3) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2, K3, K4>(ICollection<K1>, ICollection<K2>, ICollection<K3>, ICollection<K4>) |
Create an 4-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap4<K1 ,K2 ,K3 ,K4,int> x = prob.AddColumns(coll1 ,coll2 ,coll3 ,coll4) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2, K3, K4>(K1, K2, K3, K4) |
Create an 4-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap4<K1 ,K2 ,K3 ,K4,int> x = prob.AddColumns(coll1 ,coll2 ,coll3 ,coll4) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2, K3, K4, K5>(ICollection<K1>, ICollection<K2>, ICollection<K3>, ICollection<K4>, ICollection<K5>) |
Create an 5-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap5<K1 ,K2 ,K3 ,K4 ,K5,int> x = prob.AddColumns(coll1 ,coll2 ,coll3 ,coll4 ,coll5) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddColumns<K1, K2, K3, K4, K5>(K1, K2, K3, K4, K5) |
Create an 5-dimensional map of columns. This function returns a builder that generates columns according to a specification. The specification can be modified. In order to actually create the columns and get their indices, you have to call the returned builder's
ToMap() function.
(Inherited from XPRSprob.)// Create a multi-dimensional array of binary columns Optimizer.Maps.HashMap5<K1 ,K2 ,K3 ,K4 ,K5,int> x = prob.AddColumns(coll1 ,coll2 ,coll3 ,coll4 ,coll5) .WithType(Optimizer.Objects.ColumnType.Binary) .ToMap(); |
|
AddComputeRestartCallback(ComputeRestartCallback) |
Add ComputeRestart callback.
(Inherited from XPRSprob.) |
|
AddComputeRestartCallback(ComputeRestartCallback, Int32) |
Add ComputeRestart callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddComputeRestartCallback(ComputeRestartCallback, Object) |
Add ComputeRestart callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddComputeRestartCallback(ComputeRestartCallback, Object, Int32) |
Add ComputeRestart callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddConstraint<C> |
Add a single constraint to this problem.
|
|
AddConstraints<C>(IEnumerable<ConstraintDefinition<C>>) |
Add multiple constraints of the same type to the problem.
|
|
AddConstraints<C>(Int32, Func<Int32, ConstraintDefinition<C>>) |
Add multiple constraints of the same type to the problem. Calls the specified function for each element in
[0, ..., count[ and adds a constraint as specified by the return value of the function.
|
|
AddConstraints<C>(Int32, Int32, Func<Int32, Int32, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of
[0,count1[, ..., [0,countN[ and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<C>(Int32, Int32, Int32, Func<Int32, Int32, Int32, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of
[0,count1[, ..., [0,countN[ and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<C>(Int32, Int32, Int32, Int32, Func<Int32, Int32, Int32, Int32, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of
[0,count1[, ..., [0,countN[ and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<C>(Int32, Int32, Int32, Int32, Int32, Function5<Int32, Int32, Int32, Int32, Int32, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of
[0,count1[, ..., [0,countN[ and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<T, C>(IEnumerable<T>, Func<T, ConstraintDefinition<C>>) |
Add multiple constraints of the same type to the problem. Calls the specified function for each element in
data and adds a constraint as specified by the return value of the function.
|
|
AddConstraints<T, C>(IEnumerator<T>, Func<T, ConstraintDefinition<C>>) |
Add multiple constraints of the same type to the problem. Calls the specified functions for each element in
data and adds a constraint as specified by the return values of the functions.
|
|
AddConstraints<K1, K2, C>(IEnumerable<K1>, IEnumerable<K2>, Func<K1, K2, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the iterables and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<K1, K2, C>(K1, K2, Func<K1, K2, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the arrays and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<K1, K2, K3, C>(IEnumerable<K1>, IEnumerable<K2>, IEnumerable<K3>, Func<K1, K2, K3, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the iterables and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<K1, K2, K3, C>(K1, K2, K3, Func<K1, K2, K3, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the arrays and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<K1, K2, K3, K4, C>(IEnumerable<K1>, IEnumerable<K2>, IEnumerable<K3>, IEnumerable<K4>, Func<K1, K2, K3, K4, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the iterables and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<K1, K2, K3, K4, C>(K1, K2, K3, K4, Func<K1, K2, K3, K4, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the arrays and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<K1, K2, K3, K4, K5, C>(IEnumerable<K1>, IEnumerable<K2>, IEnumerable<K3>, IEnumerable<K4>, IEnumerable<K5>, Function5<K1, K2, K3, K4, K5, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the iterables and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddConstraints<K1, K2, K3, K4, K5, C>(K1, K2, K3, K4, K5, Function5<K1, K2, K3, K4, K5, ConstraintDefinition<C>>) |
Add multiple constraints to this problem. Calls
makeConstraint for each element in the cartesian product of the arrays and adds the constraint that is produced by this function call. A deep copy is made of each constraint, thus modifying the constraint later will not alter the model.
|
|
AddCut(Int32, XPRSprob.RowInfo) |
Add a single cut to the problem.
(Inherited from XPRSprob.) |
|
AddCut(Int32, Inequality.Definition) |
Add a cut at the current node. It is assumed that the left-hand Side (
lhs) is formulated in terms of the
original model. So you can use
Variable instances to formulate it. When using plain variable indices, be sure these indices are for the original model. The function will automatically Transform (presolve) the cut to the presolved space. If presolving the cut fails then the cut is not added and the reason for failure is returned. Failing to Presolve (and thus adding) a cut is not a problem in every context. That is why this does not raise an exception but instead leaves it to the caller to decide whether this is an error or not.
|
|
AddCut(Int32, Int32, Double, Char, Double) |
Add a single cut to the problem.
(Inherited from XPRSprob.) |
|
AddCutlogCallback(CutlogCallback) |
Add Cutlog callback.
(Inherited from XPRSprob.) |
|
AddCutlogCallback(CutlogCallback, Int32) |
Add Cutlog callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddCutlogCallback(CutlogCallback, Object) |
Add Cutlog callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddCutlogCallback(CutlogCallback, Object, Int32) |
Add Cutlog callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddCutmgrCallback(CutmgrCallback) | Obsolete.
Add Cutmgr callback.
(Inherited from XPRSprob.) |
|
AddCutmgrCallback(CutmgrCallback, Int32) | Obsolete.
Add Cutmgr callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddCutmgrCallback(CutmgrCallback, Object) | Obsolete.
Add Cutmgr callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddCutmgrCallback(CutmgrCallback, Object, Int32) | Obsolete.
Add Cutmgr callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddCuts(Int32, Int32, Char, Double, Int32, Int32, Double) |
Adds cuts directly to the matrix at the current node. The cuts will automatically be added to the cut pool. Cuts added to a node will automatically be inherited on any descendant node, unless explicitly deleted with a call to
delCuts.
(Inherited from XPRSprob.) |
|
AddCuts(Int32, Int32, Char, Double, Int64, Int32, Double) |
Adds cuts directly to the matrix at the current node. The cuts will automatically be added to the cut pool. Cuts added to a node will automatically be inherited on any descendant node, unless explicitly deleted with a call to
delCuts.
(Inherited from XPRSprob.) |
|
AddGapNotifyCallback(GapNotifyCallback) |
Add GapNotify callback.
(Inherited from XPRSprob.) |
|
AddGapNotifyCallback(GapNotifyCallback, Int32) |
Add GapNotify callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddGapNotifyCallback(GapNotifyCallback, Object) |
Add GapNotify callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddGapNotifyCallback(GapNotifyCallback, Object, Int32) |
Add GapNotify callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddGenCons(Int32, Int32, Int32, GenConsType, Int32, Int32, Int32, Int32, Double) |
Adds one or more general constraints to the problem. Each general constraint
y = f(x1, ..., xn, c1, ..., cn) consists of one or more (input) columns xi, zero or more constant values ci and a resultant (output column) y, different from all xi. General constraints include
maximum and
minimum (arbitrary number of input columns of any type and arbitrary number of input values, at least one total),
and and
or (at least one binary input column, no constant values, binary resultant) and
absolute value (exactly one input column of arbitrary type, no constant values).
(Inherited from XPRSprob.) |
|
AddGenCons(Int32, Int64, Int64, GenConsType, Int32, Int64, Int32, Int64, Double) |
Adds one or more general constraints to the problem. Each general constraint
y = f(x1, ..., xn, c1, ..., cn) consists of one or more (input) columns xi, zero or more constant values ci and a resultant (output column) y, different from all xi. General constraints include
maximum and
minimum (arbitrary number of input columns of any type and arbitrary number of input values, at least one total),
and and
or (at least one binary input column, no constant values, binary resultant) and
absolute value (exactly one input column of arbitrary type, no constant values).
(Inherited from XPRSprob.) |
|
AddInfnodeCallback(InfnodeCallback) |
Add Infnode callback.
(Inherited from XPRSprob.) |
|
AddInfnodeCallback(InfnodeCallback, Int32) |
Add Infnode callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddInfnodeCallback(InfnodeCallback, Object) |
Add Infnode callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddInfnodeCallback(InfnodeCallback, Object, Int32) |
Add Infnode callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddIntsolCallback(IntsolCallback) |
Add Intsol callback.
(Inherited from XPRSprob.) |
|
AddIntsolCallback(IntsolCallback, Int32) |
Add Intsol callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddIntsolCallback(IntsolCallback, Object) |
Add Intsol callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddIntsolCallback(IntsolCallback, Object, Int32) |
Add Intsol callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddLplogCallback(LplogCallback) |
Add Lplog callback.
(Inherited from XPRSprob.) |
|
AddLplogCallback(LplogCallback, Int32) |
Add Lplog callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddLplogCallback(LplogCallback, Object) |
Add Lplog callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddLplogCallback(LplogCallback, Object, Int32) |
Add Lplog callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMessageCallback(MessageCallback) |
Add Message callback.
(Inherited from XPRSprob.) |
|
AddMessageCallback(MessageCallback, Int32) |
Add Message callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMessageCallback(MessageCallback, Object) |
Add Message callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMessageCallback(MessageCallback, Object, Int32) |
Add Message callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMiplogCallback(MiplogCallback) |
Add Miplog callback.
(Inherited from XPRSprob.) |
|
AddMiplogCallback(MiplogCallback, Int32) |
Add Miplog callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMiplogCallback(MiplogCallback, Object) |
Add Miplog callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMiplogCallback(MiplogCallback, Object, Int32) |
Add Miplog callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMipSol(Double, Int32) |
Add a new MIP solution. This is a convenience wrapper for .AddMipSol(int, double[], int[], string ).
(Inherited from XPRSprob.) |
|
AddMipSol(Double, Int32, String) |
Add a new MIP solution. This is a convenience wrapper for .AddMipSol(int, double[], int[], string ).
(Inherited from XPRSprob.) |
|
AddMipSol(Double, Variable, String) |
Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer.
|
|
AddMipSol(Int32, Double, Int32, String) |
Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer.
(Inherited from XPRSprob.) |
|
AddMipThreadCallback(MipThreadCallback) |
Add MipThread callback.
(Inherited from XPRSprob.) |
|
AddMipThreadCallback(MipThreadCallback, Int32) |
Add MipThread callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMipThreadCallback(MipThreadCallback, Object) |
Add MipThread callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMipThreadCallback(MipThreadCallback, Object, Int32) |
Add MipThread callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMipThreadDestroyCallback(MipThreadDestroyCallback) |
Add MipThreadDestroy callback.
(Inherited from XPRSprob.) |
|
AddMipThreadDestroyCallback(MipThreadDestroyCallback, Int32) |
Add MipThreadDestroy callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMipThreadDestroyCallback(MipThreadDestroyCallback, Object) |
Add MipThreadDestroy callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMipThreadDestroyCallback(MipThreadDestroyCallback, Object, Int32) |
Add MipThreadDestroy callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsgHandlerCallback(TextWriter) | (Inherited from XPRSobject.) |
|
AddMsgHandlerCallback(MsgHandlerCallback) |
Add MsgHandler callback.
(Inherited from XPRSprob.) |
|
AddMsgHandlerCallback(MsgHandlerCallback, Int32) |
Add MsgHandler callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMsgHandlerCallback(MsgHandlerCallback, Object) |
Add MsgHandler callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsgHandlerCallback(MsgHandlerCallback, Object, Int32) |
Add MsgHandler callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsJobEndCallback(MsJobEndCallback) |
Add MsJobEnd callback.
(Inherited from XPRSprob.) |
|
AddMsJobEndCallback(MsJobEndCallback, Int32) |
Add MsJobEnd callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMsJobEndCallback(MsJobEndCallback, Object) |
Add MsJobEnd callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsJobEndCallback(MsJobEndCallback, Object, Int32) |
Add MsJobEnd callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsJobStartCallback(MsJobStartCallback) |
Add MsJobStart callback.
(Inherited from XPRSprob.) |
|
AddMsJobStartCallback(MsJobStartCallback, Int32) |
Add MsJobStart callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMsJobStartCallback(MsJobStartCallback, Object) |
Add MsJobStart callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsJobStartCallback(MsJobStartCallback, Object, Int32) |
Add MsJobStart callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsWinnerCallback(MsWinnerCallback) |
Add MsWinner callback.
(Inherited from XPRSprob.) |
|
AddMsWinnerCallback(MsWinnerCallback, Int32) |
Add MsWinner callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddMsWinnerCallback(MsWinnerCallback, Object) |
Add MsWinner callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddMsWinnerCallback(MsWinnerCallback, Object, Int32) |
Add MsWinner callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNames(Int32, String, Int32, Int32) |
Add names of the given type to the problem.
(Inherited from XPRSprob.) |
|
AddNames(Namespaces, String, Int32, Int32) |
Add names to model. Note that if this method fails, then it is unspecified how many of the names were changed.
(Inherited from XPRSprob.) |
|
AddNewnodeCallback(NewnodeCallback) |
Add Newnode callback.
(Inherited from XPRSprob.) |
|
AddNewnodeCallback(NewnodeCallback, Int32) |
Add Newnode callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddNewnodeCallback(NewnodeCallback, Object) |
Add Newnode callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNewnodeCallback(NewnodeCallback, Object, Int32) |
Add Newnode callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNlpCoefEvalErrorCallback(NlpCoefEvalErrorCallback) |
Add NlpCoefEvalError callback.
(Inherited from XPRSprob.) |
|
AddNlpCoefEvalErrorCallback(NlpCoefEvalErrorCallback, Int32) |
Add NlpCoefEvalError callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddNlpCoefEvalErrorCallback(NlpCoefEvalErrorCallback, Object) |
Add NlpCoefEvalError callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNlpCoefEvalErrorCallback(NlpCoefEvalErrorCallback, Object, Int32) |
Add NlpCoefEvalError callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNodecutoffCallback(NodecutoffCallback) |
Add Nodecutoff callback.
(Inherited from XPRSprob.) |
|
AddNodecutoffCallback(NodecutoffCallback, Int32) |
Add Nodecutoff callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddNodecutoffCallback(NodecutoffCallback, Object) |
Add Nodecutoff callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNodecutoffCallback(NodecutoffCallback, Object, Int32) |
Add Nodecutoff callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNodeLPSolvedCallback(NodeLPSolvedCallback) |
Add NodeLPSolved callback.
(Inherited from XPRSprob.) |
|
AddNodeLPSolvedCallback(NodeLPSolvedCallback, Int32) |
Add NodeLPSolved callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddNodeLPSolvedCallback(NodeLPSolvedCallback, Object) |
Add NodeLPSolved callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddNodeLPSolvedCallback(NodeLPSolvedCallback, Object, Int32) |
Add NodeLPSolved callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddObj |
Appends an objective function with the given coefficients to a multi-objective problem. The weight and priority of the objective are set to the given values.
(Inherited from XPRSprob.) |
|
AddObjective |
Add a new objective function. This turns the problem into a multi-objective problem.
|
|
AddOptnodeCallback(OptnodeCallback) |
Add Optnode callback.
(Inherited from XPRSprob.) |
|
AddOptnodeCallback(OptnodeCallback, Int32) |
Add Optnode callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddOptnodeCallback(OptnodeCallback, Object) |
Add Optnode callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddOptnodeCallback(OptnodeCallback, Object, Int32) |
Add Optnode callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddPreIntsolCallback(PreIntsolCallback) |
Add PreIntsol callback.
(Inherited from XPRSprob.) |
|
AddPreIntsolCallback(PreIntsolCallback, Int32) |
Add PreIntsol callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddPreIntsolCallback(PreIntsolCallback, Object) |
Add PreIntsol callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddPreIntsolCallback(PreIntsolCallback, Object, Int32) |
Add PreIntsol callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddPrenodeCallback(PrenodeCallback) |
Add Prenode callback.
(Inherited from XPRSprob.) |
|
AddPrenodeCallback(PrenodeCallback, Int32) |
Add Prenode callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddPrenodeCallback(PrenodeCallback, Object) |
Add Prenode callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddPrenodeCallback(PrenodeCallback, Object, Int32) |
Add Prenode callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddPresolveCallback(PresolveCallback) |
Add Presolve callback.
(Inherited from XPRSprob.) |
|
AddPresolveCallback(PresolveCallback, Int32) |
Add Presolve callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddPresolveCallback(PresolveCallback, Object) |
Add Presolve callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddPresolveCallback(PresolveCallback, Object, Int32) |
Add Presolve callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddPwlCons(Int32, Int32, Int32, Int32, Int32, Double, Double) |
Adds one or more piecewise linear constraints to the problem. Each piecewise linear constraint
y = f(x) consists of an (input) column x, a (different) resultant (output column) y and a piecewise linear function f. The piecewise linear function f is described by at least two breakpoints, which are given as combinations of x- and y-values. Discontinuous piecewise linear functions are supported, in this case both the left and right limit at a given point need to be entered as breakpoints. To differentiate between left and right limit, the breakpoints need to be given as a list with non-decreasing x-values.
(Inherited from XPRSprob.) |
|
AddPwlCons(Int32, Int64, Int32, Int32, Int64, Double, Double) |
Adds one or more piecewise linear constraints to the problem. Each piecewise linear constraint
y = f(x) consists of an (input) column x, a (different) resultant (output column) y and a piecewise linear function f. The piecewise linear function f is described by at least two breakpoints, which are given as combinations of x- and y-values. Discontinuous piecewise linear functions are supported, in this case both the left and right limit at a given point need to be entered as breakpoints. To differentiate between left and right limit, the breakpoints need to be given as a list with non-decreasing x-values.
(Inherited from XPRSprob.) |
|
AddQMatrix(Int32, Int32, Int32, Int32, Double) |
Adds a new quadratic matrix into a row defined by triplets.
(Inherited from XPRSprob.) |
|
AddQMatrix(Int32, Int64, Int32, Int32, Double) |
Adds a new quadratic matrix into a row defined by triplets.
(Inherited from XPRSprob.) |
|
AddRow(XPRSprob.RowInfo) |
Add a single row to the problem.
(Inherited from XPRSprob.) |
|
AddRow(XPRSprob.RowInfo, String) |
Add a single row to the problem.
(Inherited from XPRSprob.) |
|
AddRow(Int32, Double, Char, Double) |
Add a single row to the problem. This is a short cut for
AddRow(colind, colval, rowtype, rhs, null, null).
(Inherited from XPRSprob.) |
|
AddRow(Int32, Double, Char, Double, String) |
Add a single row to the problem.
(Inherited from XPRSprob.) |
|
AddRow(Int32, Double, Char, Double, Double, String) |
Add a single row to the problem.
(Inherited from XPRSprob.) |
|
AddRows(Int32, Int32, Char, Double, Int32, Int32, Double) |
Adds rows to the optimizer matrix.
(Inherited from XPRSprob.) |
|
AddRows(Int32, Int64, Char, Double, Int64, Int32, Double) |
Adds rows to the optimizer matrix.
(Inherited from XPRSprob.) |
|
AddRows(Int32, Int32, Char, Double, Double, Int32, Int32, Double) |
Adds rows to the optimizer matrix.
(Inherited from XPRSprob.) |
|
AddRows(Int32, Int64, Char, Double, Double, Int64, Int32, Double) |
Adds rows to the optimizer matrix.
(Inherited from XPRSprob.) |
|
AddSet |
Add a single set constraint to this problem.
(Inherited from XPRSprob.) |
|
AddSetNames |
Add the given set names to the problem.
(Inherited from XPRSprob.) |
|
AddSets(SetType, Int32, Double, String) |
Add multiple set constraints to the problem.
(Inherited from XPRSprob.) |
|
AddSets(Int32, Int32, Char, Int32, Int32, Double) |
Allows sets to be added to the problem after passing it to the Optimizer using the input routines.
(Inherited from XPRSprob.) |
|
AddSets(Int32, Int32, SetType, Int32, Double, String) |
Create multiple set constraints.
(Inherited from XPRSprob.) |
|
AddSets(Int32, Int64, Char, Int64, Int32, Double) |
Allows sets to be added to the problem after passing it to the Optimizer using the input routines.
(Inherited from XPRSprob.) |
|
AddSlpCascadeEndCallback(SlpCascadeEndCallback) |
Add SlpCascadeEnd callback.
(Inherited from XPRSprob.) |
|
AddSlpCascadeEndCallback(SlpCascadeEndCallback, Int32) |
Add SlpCascadeEnd callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpCascadeEndCallback(SlpCascadeEndCallback, Object) |
Add SlpCascadeEnd callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpCascadeEndCallback(SlpCascadeEndCallback, Object, Int32) |
Add SlpCascadeEnd callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpCascadeStartCallback(SlpCascadeStartCallback) |
Add SlpCascadeStart callback.
(Inherited from XPRSprob.) |
|
AddSlpCascadeStartCallback(SlpCascadeStartCallback, Int32) |
Add SlpCascadeStart callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpCascadeStartCallback(SlpCascadeStartCallback, Object) |
Add SlpCascadeStart callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpCascadeStartCallback(SlpCascadeStartCallback, Object, Int32) |
Add SlpCascadeStart callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarCallback(SlpCascadeVarCallback) |
Add SlpCascadeVar callback.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarCallback(SlpCascadeVarCallback, Int32) |
Add SlpCascadeVar callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarCallback(SlpCascadeVarCallback, Object) |
Add SlpCascadeVar callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarCallback(SlpCascadeVarCallback, Object, Int32) |
Add SlpCascadeVar callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarFailCallback(SlpCascadeVarFailCallback) |
Add SlpCascadeVarFail callback.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarFailCallback(SlpCascadeVarFailCallback, Int32) |
Add SlpCascadeVarFail callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarFailCallback(SlpCascadeVarFailCallback, Object) |
Add SlpCascadeVarFail callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpCascadeVarFailCallback(SlpCascadeVarFailCallback, Object, Int32) |
Add SlpCascadeVarFail callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpConstructCallback(SlpConstructCallback) |
Add SlpConstruct callback.
(Inherited from XPRSprob.) |
|
AddSlpConstructCallback(SlpConstructCallback, Int32) |
Add SlpConstruct callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpConstructCallback(SlpConstructCallback, Object) |
Add SlpConstruct callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpConstructCallback(SlpConstructCallback, Object, Int32) |
Add SlpConstruct callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpDrColCallback(SlpDrColCallback) |
Add SlpDrCol callback.
(Inherited from XPRSprob.) |
|
AddSlpDrColCallback(SlpDrColCallback, Int32) |
Add SlpDrCol callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpDrColCallback(SlpDrColCallback, Object) |
Add SlpDrCol callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpDrColCallback(SlpDrColCallback, Object, Int32) |
Add SlpDrCol callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIntSolCallback(SlpIntSolCallback) |
Add SlpIntSol callback.
(Inherited from XPRSprob.) |
|
AddSlpIntSolCallback(SlpIntSolCallback, Int32) |
Add SlpIntSol callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpIntSolCallback(SlpIntSolCallback, Object) |
Add SlpIntSol callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIntSolCallback(SlpIntSolCallback, Object, Int32) |
Add SlpIntSol callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIterEndCallback(SlpIterEndCallback) |
Add SlpIterEnd callback.
(Inherited from XPRSprob.) |
|
AddSlpIterEndCallback(SlpIterEndCallback, Int32) |
Add SlpIterEnd callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpIterEndCallback(SlpIterEndCallback, Object) |
Add SlpIterEnd callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIterEndCallback(SlpIterEndCallback, Object, Int32) |
Add SlpIterEnd callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIterStartCallback(SlpIterStartCallback) |
Add SlpIterStart callback.
(Inherited from XPRSprob.) |
|
AddSlpIterStartCallback(SlpIterStartCallback, Int32) |
Add SlpIterStart callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpIterStartCallback(SlpIterStartCallback, Object) |
Add SlpIterStart callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIterStartCallback(SlpIterStartCallback, Object, Int32) |
Add SlpIterStart callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIterVarCallback(SlpIterVarCallback) |
Add SlpIterVar callback.
(Inherited from XPRSprob.) |
|
AddSlpIterVarCallback(SlpIterVarCallback, Int32) |
Add SlpIterVar callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpIterVarCallback(SlpIterVarCallback, Object) |
Add SlpIterVar callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpIterVarCallback(SlpIterVarCallback, Object, Int32) |
Add SlpIterVar callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpPreUpdateLinearizationCallback(SlpPreUpdateLinearizationCallback) |
Add SlpPreUpdateLinearization callback.
(Inherited from XPRSprob.) |
|
AddSlpPreUpdateLinearizationCallback(SlpPreUpdateLinearizationCallback, Int32) |
Add SlpPreUpdateLinearization callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddSlpPreUpdateLinearizationCallback(SlpPreUpdateLinearizationCallback, Object) |
Add SlpPreUpdateLinearization callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddSlpPreUpdateLinearizationCallback(SlpPreUpdateLinearizationCallback, Object, Int32) |
Add SlpPreUpdateLinearization callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddUserSolNotifyCallback(UserSolNotifyCallback) |
Add UserSolNotify callback.
(Inherited from XPRSprob.) |
|
AddUserSolNotifyCallback(UserSolNotifyCallback, Int32) |
Add UserSolNotify callback with the specified priority.
(Inherited from XPRSprob.) |
|
AddUserSolNotifyCallback(UserSolNotifyCallback, Object) |
Add UserSolNotify callback with a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddUserSolNotifyCallback(UserSolNotifyCallback, Object, Int32) |
Add UserSolNotify callback with specified priority and a user object that is passed to the callback on invocation.
(Inherited from XPRSprob.) |
|
AddVariable() |
Add a single variable to this problem. This variable will be continuous, have default Bounds (0 and infinity) and will not have a name.
|
|
AddVariable(String) |
Add a single variable to this problem. The variable will have default Type (continuous) and Bounds (0 and infinity).
|
|
AddVariable(ColumnType) |
Add a single variable to this problem. The variable will have default bounds and no name.
|
|
AddVariable(ColumnType, String) |
Add a single variable to this problem. The variable will have default bounds.
|
|
AddVariable(Double, Double, ColumnType) |
Add a single variable to this problem.
|
|
AddVariable(Double, Double, ColumnType, String) |
Add a single variable to this problem.
|
|
AddVariable(Double, Double, ColumnType, Double, String) |
Add a single variable to this problem.
|
|
AddVariables(Int32) |
Create an 1-dimensional array of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToArray() function.
// Create a multi-dimensional array of binary variables
Optimizer.Objects.Variable[ ] = prob.AddVariables(dim)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToArray();
|
|
AddVariables(Int32, Int32) |
Create an 2-dimensional array of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToArray() function.
// Create a multi-dimensional array of binary variables
Optimizer.Objects.Variable[ ,] = prob.AddVariables(dim1 ,dim2)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToArray();
|
|
AddVariables(Int32, Int32, Int32) |
Create an 3-dimensional array of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToArray() function.
// Create a multi-dimensional array of binary variables
Optimizer.Objects.Variable[ , ,] = prob.AddVariables(dim1 ,dim2 ,dim3)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToArray();
|
|
AddVariables(Int32, Int32, Int32, Int32) |
Create an 4-dimensional array of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToArray() function.
// Create a multi-dimensional array of binary variables
Optimizer.Objects.Variable[ , , ,] = prob.AddVariables(dim1 ,dim2 ,dim3 ,dim4)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToArray();
|
|
AddVariables(Int32, Int32, Int32, Int32, Int32) |
Create an 5-dimensional array of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToArray() function.
// Create a multi-dimensional array of binary variables
Optimizer.Objects.Variable[ , , , ,] = prob.AddVariables(dim1 ,dim2 ,dim3 ,dim4 ,dim5)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToArray();
|
|
AddVariables<K1>(ICollection<K1>) |
Create an 1-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional map of binary variables
System.Collections.Generic.Dictionary<K1 ,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 )
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1>(IEnumerable<K1>) |
Create an 1-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional array of binary columns
System.Collections.Generic.Dictionary<K1 ,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 )
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1>(K1) |
Create an 1-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional array of binary columns
System.Collections.Generic.Dictionary<K1 ,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 )
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2>(ICollection<K1>, ICollection<K2>) |
Create an 2-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional map of binary variables
Optimizer.Maps.HashMap2<K1 ,K2,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2>(K1, K2) |
Create an 2-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional array of binary columns
Optimizer.Maps.HashMap2<K1 ,K2,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2, K3>(ICollection<K1>, ICollection<K2>, ICollection<K3>) |
Create an 3-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional map of binary variables
Optimizer.Maps.HashMap3<K1 ,K2 ,K3,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2 ,coll3)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2, K3>(K1, K2, K3) |
Create an 3-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional array of binary columns
Optimizer.Maps.HashMap3<K1 ,K2 ,K3,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2 ,coll3)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2, K3, K4>(ICollection<K1>, ICollection<K2>, ICollection<K3>, ICollection<K4>) |
Create an 4-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional map of binary variables
Optimizer.Maps.HashMap4<K1 ,K2 ,K3 ,K4,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2 ,coll3 ,coll4)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2, K3, K4>(K1, K2, K3, K4) |
Create an 4-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional array of binary columns
Optimizer.Maps.HashMap4<K1 ,K2 ,K3 ,K4,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2 ,coll3 ,coll4)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2, K3, K4, K5>(ICollection<K1>, ICollection<K2>, ICollection<K3>, ICollection<K4>, ICollection<K5>) |
Create an 5-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional map of binary variables
Optimizer.Maps.HashMap5<K1 ,K2 ,K3 ,K4 ,K5,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2 ,coll3 ,coll4 ,coll5)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
AddVariables<K1, K2, K3, K4, K5>(K1, K2, K3, K4, K5) |
Create an 5-dimensional map of variables. This function returns a builder that generates variables according to a specification. The specification can be modified. In order to actually create the variables, you have to call the returned builder's
ToMap() function.
// Create a multi-dimensional array of binary columns
Optimizer.Maps.HashMap5<K1 ,K2 ,K3 ,K4 ,K5,Optimizer.Objects.Variable> x = prob.AddVariables(coll1 ,coll2 ,coll3 ,coll4 ,coll5)
.WithType(Optimizer.Objects.ColumnType.Binary)
.ToMap();
|
|
Alter |
Alters or changes matrix elements, right hand sides and constraint senses in the current problem.
(Inherited from XPRSprob.) |
|
BasisCondition | Obsolete.
Calculates the condition number of the current basis after solving the LP relaxation.
(Inherited from XPRSprob.) |
|
BasisStability(Int32, Int32, Int32) |
Convenience wrapper for
BasisStability(int,int,int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
BasisStability(Int32, Int32, Int32, Double) |
Calculates various measures for the stability of the current basis, including the basis condition number.
(Inherited from XPRSprob.) |
|
BinVar() |
Create a new binary variable.
(Inherited from XPRSprob.) |
|
BinVar(String) |
Create a new binary variable with the specified name.
(Inherited from XPRSprob.) |
|
BinVarArray(Int32, Func<Int32, String>) |
Create an array of binary variables.
(Inherited from XPRSprob.) |
|
BinVarArray<T>(ICollection<T>, Func<T, String>) |
Create an array of binary variables. The function will create one variable for each of the objects listed in
objs.
(Inherited from XPRSprob.) |
|
BinVarMap<T>(ICollection<T>, Func<T, String>) |
Create a map of binary variables. The function creates a new variable for each object in
objs. It returns a hash map in which each object in
objs maps to the index of the variable that was created for it.
(Inherited from XPRSprob.) |
|
BinVarMap<T>(ICollection<T>, Func<T, String>, IDictionary<T, Int32>) |
Create a map of binary variables. The function creates a new variable for each object in
objs. For each object o it puts the Pair (o, idx) into
map where idx is the index of the variable that was created for o.
(Inherited from XPRSprob.) |
|
Bndsa |
Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds. If the bounds are varied within these ranges the current basis remains optimal and feasible.
(Inherited from XPRSprob.) |
|
BndSA(Variable, Double, Double, Double, Double) |
Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds. If the bounds are varied within these ranges the current basis remains optimal and feasible.
|
|
BndSA(Int32, Variable, Double, Double, Double, Double) |
Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds. If the bounds are varied within these ranges the current basis remains optimal and feasible.
|
|
BTran |
Post-multiplies a (row) vector provided by the user by the inverse of the current basis.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array2Builder) |
Add variables as specified by the builder.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array3Builder) |
Add variables as specified by the builder.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array4Builder) |
Add variables as specified by the builder.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array5Builder) |
Add variables as specified by the builder.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.ArrayBuilder) |
Add variables as specified by the builder.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array2Builder, Action<Int32>) |
TODO: Hide this from the user.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array3Builder, Action<Int32>) |
TODO: Hide this from the user.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array4Builder, Action<Int32>) |
TODO: Hide this from the user.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.Array5Builder, Action<Int32>) |
TODO: Hide this from the user.
(Inherited from XPRSprob.) |
|
BuildColumns(VariableBuilder.ArrayBuilder, Action<Int32>) |
TODO: Hide this from the user.
(Inherited from XPRSprob.) |
|
BuildColumns<K1>(VariableBuilder.MapBuilder<K1>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<I>(VariableBuilder.Array2Builder, Func<I>, Action<I, Int32, Int32, Int32>) |
Add columns as specified by the builder. This is a parametrized version of .BuildColumns(VariableBuilder.Array2Builder).
(Inherited from XPRSprob.) |
|
BuildColumns<I>(VariableBuilder.Array3Builder, Func<I>, Action5<I, Int32, Int32, Int32, Int32>) |
Add columns as specified by the builder. This is a parametrized version of .BuildColumns(VariableBuilder.Array3Builder).
(Inherited from XPRSprob.) |
|
BuildColumns<I>(VariableBuilder.Array4Builder, Func<I>, Action6<I, Int32, Int32, Int32, Int32, Int32>) |
Add columns as specified by the builder. This is a parametrized version of .BuildColumns(VariableBuilder.Array4Builder).
(Inherited from XPRSprob.) |
|
BuildColumns<I>(VariableBuilder.Array5Builder, Func<I>, Action7<I, Int32, Int32, Int32, Int32, Int32, Int32>) |
Add columns as specified by the builder. This is a parametrized version of .BuildColumns(VariableBuilder.Array5Builder).
(Inherited from XPRSprob.) |
|
BuildColumns<I>(VariableBuilder.ArrayBuilder, Func<I>, Action<I, Int32, Int32>) |
Add columns as specified by the builder. This is a parametrized version of .BuildColumns(VariableBuilder.ArrayBuilder).
(Inherited from XPRSprob.) |
|
BuildColumns<K1>(VariableBuilder.MapBuilder<K1>, Action<K1, Int32>, Action) |
Create a column map from a builder. This function parametrizes creation of a map that maps keys to created objects.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2>(VariableBuilder.Map2Builder<K1, K2>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2>(VariableBuilder.Map2Builder<K1, K2>, Action<K1, K2, Int32>, Action) |
Create a column map from a builder. This function parametrizes creation of a map that maps keys to created objects.
(Inherited from XPRSprob.) |
|
BuildColumns<I, K1>(VariableBuilder.MapBuilder<K1>, Func<I>, Action<I, K1, Int32>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2, K3>(VariableBuilder.Map3Builder<K1, K2, K3>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<I, K1, K2>(VariableBuilder.Map2Builder<K1, K2>, Func<I>, Action<I, K1, K2, Int32>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2, K3>(VariableBuilder.Map3Builder<K1, K2, K3>, Action<K1, K2, K3, Int32>, Action) |
Create a column map from a builder. This function parametrizes creation of a map that maps keys to created objects.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2, K3, K4>(VariableBuilder.Map4Builder<K1, K2, K3, K4>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<I, K1, K2, K3>(VariableBuilder.Map3Builder<K1, K2, K3>, Func<I>, Action5<I, K1, K2, K3, Int32>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2, K3, K4>(VariableBuilder.Map4Builder<K1, K2, K3, K4>, Action5<K1, K2, K3, K4, Int32>, Action) |
Create a column map from a builder. This function parametrizes creation of a map that maps keys to created objects.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2, K3, K4, K5>(VariableBuilder.Map5Builder<K1, K2, K3, K4, K5>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<I, K1, K2, K3, K4>(VariableBuilder.Map4Builder<K1, K2, K3, K4>, Func<I>, Action6<I, K1, K2, K3, K4, Int32>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildColumns<K1, K2, K3, K4, K5>(VariableBuilder.Map5Builder<K1, K2, K3, K4, K5>, Action6<K1, K2, K3, K4, K5, Int32>, Action) |
Create a column map from a builder. This function parametrizes creation of a map that maps keys to created objects.
(Inherited from XPRSprob.) |
|
BuildColumns<I, K1, K2, K3, K4, K5>(VariableBuilder.Map5Builder<K1, K2, K3, K4, K5>, Func<I>, Action7<I, K1, K2, K3, K4, K5, Int32>) |
Create a column map from a builder.
(Inherited from XPRSprob.) |
|
BuildVariables(VariableBuilder.Array2Builder) |
Create a variable array from a builder.
|
|
BuildVariables(VariableBuilder.Array3Builder) |
Create a variable array from a builder.
|
|
BuildVariables(VariableBuilder.Array4Builder) |
Create a variable array from a builder.
|
|
BuildVariables(VariableBuilder.Array5Builder) |
Create a variable array from a builder.
|
|
BuildVariables(VariableBuilder.ArrayBuilder) |
Create a variable array from a builder.
|
|
BuildVariables<K1>(VariableBuilder.MapBuilder<K1>) |
Create a variable map from a builder.
|
|
BuildVariables<I>(VariableBuilder.Array2Builder, Func<I>, Action<I, Int32, Int32, Variable>) |
Create a variable array from a builder. This is a parametrized version of .BuildVariables(VariableBuilder.Array2Builder).
|
|
BuildVariables<I>(VariableBuilder.Array3Builder, Func<I>, Action5<I, Int32, Int32, Int32, Variable>) |
Create a variable array from a builder. This is a parametrized version of .BuildVariables(VariableBuilder.Array3Builder).
|
|
BuildVariables<I>(VariableBuilder.Array4Builder, Func<I>, Action6<I, Int32, Int32, Int32, Int32, Variable>) |
Create a variable array from a builder. This is a parametrized version of .BuildVariables(VariableBuilder.Array4Builder).
|
|
BuildVariables<I>(VariableBuilder.Array5Builder, Func<I>, Action7<I, Int32, Int32, Int32, Int32, Int32, Variable>) |
Create a variable array from a builder. This is a parametrized version of .BuildVariables(VariableBuilder.Array5Builder).
|
|
BuildVariables<I>(VariableBuilder.ArrayBuilder, Func<I>, Action<I, Int32, Variable>) |
Create a variable array from a builder. This is a parametrized version of .BuildVariables(VariableBuilder.ArrayBuilder).
|
|
BuildVariables<K1, K2>(VariableBuilder.Map2Builder<K1, K2>) |
Create a variable map from a builder.
|
|
BuildVariables<I, K1>(VariableBuilder.MapBuilder<K1>, Func<I>, Action<I, K1, Variable>) |
Create a variable map from a builder.
|
|
BuildVariables<K1, K2, K3>(VariableBuilder.Map3Builder<K1, K2, K3>) |
Create a variable map from a builder.
|
|
BuildVariables<I, K1, K2>(VariableBuilder.Map2Builder<K1, K2>, Func<I>, Action<I, K1, K2, Variable>) |
Create a variable map from a builder.
|
|
BuildVariables<K1, K2, K3, K4>(VariableBuilder.Map4Builder<K1, K2, K3, K4>) |
Create a variable map from a builder.
|
|
BuildVariables<I, K1, K2, K3>(VariableBuilder.Map3Builder<K1, K2, K3>, Func<I>, Action5<I, K1, K2, K3, Variable>) |
Create a variable map from a builder.
|
|
BuildVariables<K1, K2, K3, K4, K5>(VariableBuilder.Map5Builder<K1, K2, K3, K4, K5>) |
Create a variable map from a builder.
|
|
BuildVariables<I, K1, K2, K3, K4>(VariableBuilder.Map4Builder<K1, K2, K3, K4>, Func<I>, Action6<I, K1, K2, K3, K4, Variable>) |
Create a variable map from a builder.
|
|
BuildVariables<I, K1, K2, K3, K4, K5>(VariableBuilder.Map5Builder<K1, K2, K3, K4, K5>, Func<I>, Action7<I, K1, K2, K3, K4, K5, Variable>) |
Create a variable map from a builder.
|
|
CalcObjective(Double) |
Convenience wrapper for
CalcObjective(double[],double) that returns the output argument.
(Inherited from XPRSprob.) |
|
CalcObjective(Double, Double) |
Calculates the objective value of a given solution.
(Inherited from XPRSprob.) |
|
CalcObjN(Int32, Double) |
Convenience wrapper for
CalcObjN(int,double[],double) that returns the output argument.
(Inherited from XPRSprob.) |
|
CalcObjN(Int32, Double, Double) |
Calculates the objective value of the given objective function in a multi-objective problem.
(Inherited from XPRSprob.) |
|
CalcReducedCosts |
Calculates the reduced cost values for a given (row) dual solution.
(Inherited from XPRSprob.) |
|
CalcSlacks |
Calculates the row slack values for a given solution.
(Inherited from XPRSprob.) |
|
CalcSolInfo(Double, Double, Int32) |
Convenience wrapper for
CalcSolInfo(double[],double[],int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
CalcSolInfo(Double, Double, Int32, Double) |
Calculates the required property of a solution, like maximum infeasibility of a given primal and dual solution.
(Inherited from XPRSprob.) |
|
ChgBounds(Int32, Double, Double) |
Change bounds of a single column.
(Inherited from XPRSprob.) |
|
ChgBounds(Variable, Char, Double) |
Change bounds for multiple variables.
|
|
ChgBounds(Int32, Int32, Char, Double) |
Used to change the bounds on columns in the matrix.
(Inherited from XPRSprob.) |
|
ChgCoef(Int32, Int32, Double) |
Used to change a single coefficient in the matrix. If the coefficient does not already exist, a new coefficient will be added to the matrix. If many coefficients are being added to a row of the matrix, it may be more efficient to delete the old row of the matrix and add a new row.
(Inherited from XPRSprob.) |
|
ChgCoef(Inequality, Variable, Double) |
Changes the coefficient for
variable in
row in the linear matrix.
|
|
ChgCoefs |
Change coefficients in the linear matrix. The function changes the coefficients as indicated by the triplets given by
row,
variable,
coefficient.
|
|
ChgColType(Int32, Char) |
Convenience wrapper for
ChgColType(int, int[], char[]).
(Inherited from XPRSprob.) |
|
ChgColType(Variable, ColumnType) |
Change types for multiple variables.
|
|
ChgColType(Int32, Int32, Char) |
Used to change the type of a specified set of columns in the matrix.
(Inherited from XPRSprob.) |
|
ChgGlbLimit(Int32, Double) |
Convenience wrapper for
ChgGlbLimit(int, int[], double[]).
(Inherited from XPRSprob.) |
|
ChgGlbLimit(Int32, Int32, Double) |
Used to change semi-continuous or semi-integer lower bounds, or upper limits on partial integers.
(Inherited from XPRSprob.) |
|
ChgLB |
Change the lower bound of a single column.
(Inherited from XPRSprob.) |
|
ChgMCoef(Int32, Int32, Int32, Double) |
Used to change multiple coefficients in the matrix. If any coefficient does not already exist, it will be added to the matrix. If many coefficients are being added to a row of the matrix, it may be more efficient to delete the old row of the matrix and add a new one.
(Inherited from XPRSprob.) |
|
ChgMCoef(Int64, Int32, Int32, Double) |
Used to change multiple coefficients in the matrix. If any coefficient does not already exist, it will be added to the matrix. If many coefficients are being added to a row of the matrix, it may be more efficient to delete the old row of the matrix and add a new one.
(Inherited from XPRSprob.) |
|
ChgMQObj(Int32, Int32, Int32, Double) |
Used to change multiple quadratic coefficients in the objective function. If any of the coefficients does not exist already, new coefficients will be added to the objective function.
(Inherited from XPRSprob.) |
|
ChgMQObj(Int64, Int32, Int32, Double) |
Used to change multiple quadratic coefficients in the objective function. If any of the coefficients does not exist already, new coefficients will be added to the objective function.
(Inherited from XPRSprob.) |
|
ChgObj(Int32, Double) |
Convenience wrapper for
ChgObj(int, int[], double[]).
(Inherited from XPRSprob.) |
|
ChgObj(Variable, Double) |
Change objective function coefficient. This changes the linear coefficient in the first/primary objective function. In order to delete a coefficient from the objective set it to 0 (zero).
|
|
ChgObj(Variable, Double) |
Change objective function coefficients. This changes the linear coefficients in the first/primary objective function. In order to delete a coefficient from the objective set it to 0 (zero).
|
|
ChgObj(Int32, Int32, Double) |
Used to change the objective function coefficients.
(Inherited from XPRSprob.) |
|
ChgObjN(Int32, Variable, Double) |
Change an objective function coefficient for a multi-objective problem. This changes the linear coefficient in the objective function
objidx. In order to delete a coefficient from the objective set it to 0 (zero).
|
|
ChgObjN(Int32, Variable, Double) |
Change objective function coefficients for a multi-objective problem. This changes tje linear coefficients in the objective function
objidx. In order to delete a coefficient from the obejctive set it to 0 (zero).
|
|
ChgObjN(Int32, Int32, Int32, Double) |
Modifies one or more coefficients of an objective function in a multi-objective problem. If the objective already exists, any coefficients not present in the
colind and
objcoef arrays will unchanged. If the objective does not exist, it will be added to the problem.
(Inherited from XPRSprob.) |
|
ChgObjSense(Int32) | (Inherited from XPRSprob.) |
|
ChgObjSense(ObjSense) |
Changes the problem's objective function sense to minimize or maximize.
(Inherited from XPRSprob.) |
|
ChgQObj |
Used to change a single quadratic coefficient in the objective function corresponding to the variable pair
(objqcol1,objqcol2) of the Hessian matrix.
(Inherited from XPRSprob.) |
|
ChgQRowCoeff |
Changes a single quadratic coefficient in a row.
(Inherited from XPRSprob.) |
|
ChgRHS(Int32, Double) |
Convenience wrapper for
ChgRHS(int, int[], double[]).
(Inherited from XPRSprob.) |
|
ChgRHS(Inequality, Double) |
Change right-hand side for multiple rows.
|
|
ChgRHS(Int32, Int32, Double) |
Used to change right--hand side values of the problem.
(Inherited from XPRSprob.) |
|
ChgRHSRange(Int32, Double) |
Convenience wrapper for
ChgRHSRange(int, int[], double[]).
(Inherited from XPRSprob.) |
|
ChgRHSRange(Inequality, Double) |
Change right-hand side ranges for multiple rows.
|
|
ChgRHSRange(Int32, Int32, Double) |
Used to change the range for a row of the problem matrix.
(Inherited from XPRSprob.) |
|
ChgRowType(Int32, Char) |
Convenience wrapper for
ChgRowType(int, int[], char[]).
(Inherited from XPRSprob.) |
|
ChgRowType(Inequality, RowType) |
Change types for multiple rows.
|
|
ChgRowType(Int32, Int32, Char) |
Used to change the type of a row in the matrix.
(Inherited from XPRSprob.) |
|
ChgUB |
Change the upper bound of a single column.
(Inherited from XPRSprob.) |
|
ClearIIS |
Resets the search for Irreducible Infeasible Sets (IIS).
(Inherited from XPRSprob.) |
|
ClearObjective |
Clear the objective function.
(Inherited from XPRSprob.) |
|
ClearRowFlags |
Clears extra information attached to a range of rows.
(Inherited from XPRSprob.) |
|
Clone |
Create a copy of the problem, including controls and callbacks.
(Inherited from XPRSprob.) |
 |
ColumnTypeToArray |
Convert a column type array to an array of low-level type indicators.
(Inherited from XPRSprob.) |
|
ContVar() |
Create a continuous variable with default bounds [0, infinity].
(Inherited from XPRSprob.) |
|
ContVar(String) |
Create a continuous variable with default bounds [0, infinity] and a specified name.
(Inherited from XPRSprob.) |
|
ContVar(Double, Double) |
Create a continuous variable with specified bounds.
(Inherited from XPRSprob.) |
|
ContVar(Double, Double, String) |
Create a continuous variable with specified bounds and name.
(Inherited from XPRSprob.) |
|
ContVarArray(Int32, Double, Double, Func<Int32, String>) |
Create an array of continuous variables. All the variables created by this function have the same types and bounds.
(Inherited from XPRSprob.) |
|
ContVarArray(Int32, Double, Double, String) |
Create an array of continuous variables.
(Inherited from XPRSprob.) |
|
ContVarArray(Int32, Func<Int32, Double>, Func<Int32, Double>, Func<Int32, String>) |
Create an array of continuous variables.
(Inherited from XPRSprob.) |
|
ContVarArray<T>(ICollection<T>, Double, Double, Func<T, String>) |
Create an array of continuous variables. All the variables created by this function have the same types and bounds. The function will create one variable for each of the objects listed in
objs.
(Inherited from XPRSprob.) |
|
ContVarArray<T>(ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>) |
Create an array of continuous variables. The function will create one variable for each of the objects listed in
objs.
(Inherited from XPRSprob.) |
|
ContVarMap<T>(ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>) |
Create a map of continuous variables. The function creates a new variable for each object in
objs. It returns a hash map in which each object in
objs maps to the index of the variable that was created for it.
(Inherited from XPRSprob.) |
|
ContVarMap<T>(ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>, IDictionary<T, Int32>) |
Create a map of continuous variables. The function creates a new variable for each object in
objs. For each object o it puts the Pair (o, idx) into
map where idx is the index of the variable that was created for o.
(Inherited from XPRSprob.) |
|
CopyCallbacks |
Copy callbacks to this XPRSprob from another
(Inherited from XPRSprob.) |
|
CopyControls |
Copies controls defined for one problem to another.
(Inherited from XPRSprob.) |
|
CopyProb(XPRSprob) |
Create a copy of the problem.
(Inherited from XPRSprob.) |
|
CopyProb(XPRSprob, String) |
Create a copy of the problem with the given name.
(Inherited from XPRSprob.) |
|
CreateBranchObject() |
Create a new branch object. This is different from the super class's CreateBranchObject() function in two aspects: - it returns an instance of
BranchObject, not
XPRSbranchobject. The former is a subclass of the latter and has functions to add bounds and constraints that reference
Variable objects. - the returned object always operates in the original space.
|
|
CreateBranchObject(Boolean) |
Create a branching object.
(Inherited from XPRSprob.) |
|
CreateBranchObjectFromGlobal | Obsolete. (Inherited from XPRSprob.) |
|
CrossoverLpSol() |
Convenience wrapper for
CrossoverLpSol(int) that returns the output argument.
(Inherited from XPRSprob.) |
|
CrossoverLpSol(Int32) |
Provides a basic optimal solution for a given solution of an LP problem. This function behaves like the crossover after the barrier algorithm.
(Inherited from XPRSprob.) |
|
DelCols |
Delete columns from this problem. Note that this may be expensive if you use
Variable instances to formulate your problem since indices of remaining variables will have to be updated after columns were deleted from the underlying model. If you have to delete multiple variables then it is best to collect all variables to be deleted in an array and then delete all of them with a single call to this function.
(Overrides XPRSprob.DelCols(Int32, Int32).) |
|
DelCPCuts() |
During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using
delCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using
delCPCuts.
(Inherited from XPRSprob.) |
|
DelCPCuts(Int32, Cut) |
During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using
delCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using
delCPCuts.
(Inherited from XPRSprob.) |
|
DelCPCuts(Int32, Int32) |
During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using
delCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using
delCPCuts.
(Inherited from XPRSprob.) |
|
DelCPCuts(Int32, Int32, Int32, Cut) |
During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using
delCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using
delCPCuts.
(Inherited from XPRSprob.) |
|
DelCuts(Int32) |
Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using
addCuts or
loadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.
(Inherited from XPRSprob.) |
|
DelCuts(Int32, Int32, Cut) |
Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using
addCuts or
loadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.
(Inherited from XPRSprob.) |
|
DelCuts(Int32, Int32, Int32) |
Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using
addCuts or
loadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.
(Inherited from XPRSprob.) |
|
DelCuts(Int32, Int32, Int32, Double) |
Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using
addCuts or
loadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.
(Inherited from XPRSprob.) |
|
DelCuts(Int32, Int32, Int32, Double, Int32, Cut) |
Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using
addCuts or
loadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.
(Inherited from XPRSprob.) |
|
DelGenCons |
Delete constraints from this problem. Note that this may be expensive if you use
GeneralConstraint instances to formulate your problem since indices of remaining constraints will have to be updated after constraints were deleted from the underlying model. If you have to delete multiple constraints then it is best to collect all constraints to be deleted in an array and then delete all of them with a single call to this function.
(Overrides XPRSprob.DelGenCons(Int32, Int32).) |
|
DelGeneralConstraints |
Delete general constraints from this problem.
|
|
DelIndicator(Int32) |
Delete a single indicator constraint. This only deletes the "indicator property from the specified row. Neither the associated variable nor the row are deleted.
(Inherited from XPRSprob.) |
|
DelIndicator(Inequality) |
Delete a single indicator constraint. This only deletes the "indicator property from the specified row. Neither the associated variable nor the row are deleted.
|
|
DelIndicators |
Delete indicator constraints. This turns the specified rows into normal rows (not controlled by indicator variables).
(Inherited from XPRSprob.) |
|
DelInequalities |
Delete inequality constraints from this problem.
|
|
DelObj |
Removes an objective function from a multi-objective problem. Any objectives with
index > objidx will be shifted down. Deleting the last objective function in the problem causes all the objective coefficients to be zeroed, but
OBJECTIVES remains set to
1.
(Inherited from XPRSprob.) |
|
DelPwlCons |
Delete piecewise linear constraints from this problem. Note that this may be expensive if you use
PWL instances to formulate your problem since indices of remaining variables will have to be updated after columns were deleted from the underlying model. If you have to delete multiple variables then it is best to collect all variables to be deleted in an array and then delete all of them with a single call to this function.
(Overrides XPRSprob.DelPwlCons(Int32, Int32).) |
|
DelPwlConstraints |
Delete PWL constraints from this problem.
|
|
DelQMatrix |
Deletes the quadratic part of a row or of the objective function.
(Inherited from XPRSprob.) |
|
DelRows |
Delete rows from this problem. Note that this may be expensive if you use
Inequality instances to formulate your problem since indices of remaining rows will have to be updated after rows were deleted from the underlying model. If you have to delete multiple rows then it is best to collect all rows to be deleted in an array and then delete all of them with a single call to this function.
(Overrides XPRSprob.DelRows(Int32, Int32).) |
|
DelSets |
Delete sets from this problem. Note that this may be expensive if you use
SOS instances to formulate your problem since indices of remaining sets will have to be updated after sets were deleted from the underlying model. If you have to delete multiple sets then it is best to collect all sets to be deleted in an array and then delete all of them with a single call to this function.
(Overrides XPRSprob.DelSets(Int32, Int32).) |
|
DelSOS(SOS) |
Delete a single SOS from the problem.
|
|
DelSOS(SOS) |
Delete special ordered set constraints. Removes all the specified special ordered set constraints from this problem.
|
|
DelVariables |
Delete variables from this problem.
|
|
Destroy | Obsolete.
Destroy the problem, freeing all native resources used. Equivalent to calling Dipose().
(Inherited from XPRSprob.) |
|
Dispose | (Inherited from XPRSobject.) |
|
Drop |
Function that is called when the whole problem representation is dropped and will be replaced by a new one soon. This happens for example if
readProb is called or any of the
load functions are called.
(Overrides XPRSprob.Drop().) |
|
DumpControls |
Displays the list of controls and their current value for those controls that have been set to a non default value.
(Inherited from XPRSprob.) |
|
Equals | (Inherited from XPRSobject.) |
|
EstimateRowDualRanges |
Performs a dual side range sensitivity analysis, i.e. calculates estimates for the possible ranges for dual values.
(Inherited from XPRSprob.) |
|
Finalize | (Inherited from XPRSobject.) |
|
FirstIIS(Int32) |
Convenience wrapper for
FirstIIS(int,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
FirstIIS(Int32, Int32) |
Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem.
(Inherited from XPRSprob.) |
|
FixGlobals | Obsolete. (Inherited from XPRSprob.) |
|
FixMIPEntities |
Fixes all the MIP entities to the values of the last found MIP solution. This is useful for finding the reduced costs for the continuous variables after the integer variables have been fixed to their optimal values.
(Inherited from XPRSprob.) |
|
FTran |
Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix.
(Inherited from XPRSprob.) |
|
GeneralConstraintForIndex |
Map a general constraint index to a
GeneralConstraint object.
|
|
GeneralConstraintForIndices |
Map a range of general constraint indices to
GeneralConstraint objects.
|
|
GetAttribInfo |
Accesses the id number and the type information of an attribute given its name. An attribute name may be for example
XPRS_ROWS. Names are case-insensitive and may or may not have the
XPRS_ prefix. The id number is the constant used to identify the attribute for calls to functions such as
getIntAttrib. The type information returned will be one of the below integer constants defined in the
xprs.h header file. The function will return an id number of 0 and a type value of
XPRS_TYPE_NOTDEFINED if the name is not recognized as an attribute name. Note that this will occur if the name is a control name and not an attribute name.
(Inherited from XPRSprob.) |
|
GetBasis |
Returns the current basis into the user's data arrays.
(Inherited from XPRSprob.) |
|
GetBasisVal |
Returns the current basis status for a specific column or row.
(Inherited from XPRSprob.) |
|
GetCallbackDual(Int32) |
Convenience wrapper for
bool(out GetCallbackDuals, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackDual(Inequality) |
Get the dual associated with the current callback for a single row.
|
|
GetCallbackDual(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackDuals, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackDuals() |
Convenience wrapper for
bool(out GetCallbackDuals, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackDuals(Boolean) |
Convenience wrapper for
GetCallbackDuals(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackDuals(ICollection<Inequality>) |
Get the duals associated with the current callback for a collection of rows. The values in the returned array are in 1-to-1 correspondence with the row in
row.
|
|
GetCallbackDuals(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackDuals, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackDuals(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackDuals, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackDuals(Boolean, Double, Int32, Int32) |
Returns the dual values from the solution associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveDual(Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveDuals, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveDual(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveDuals, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveDuals() |
Convenience wrapper for
bool(out GetCallbackPresolveDuals, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveDuals(Boolean) |
Convenience wrapper for
GetCallbackPresolveDuals(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveDuals(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveDuals, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveDuals(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveDuals, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveDuals(Boolean, Double, Int32, Int32) |
Returns the dual values from the solution to the presolved problem associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveRedCost(Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveRedCosts, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveRedCost(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveRedCosts, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveRedCosts() |
Convenience wrapper for
bool(out GetCallbackPresolveRedCosts, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveRedCosts(Boolean) |
Convenience wrapper for
GetCallbackPresolveRedCosts(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveRedCosts(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveRedCosts, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveRedCosts(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveRedCosts, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveRedCosts(Boolean, Double, Int32, Int32) |
Returns the reduced costs from the solution to the presolved problem associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSlack(Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSlacks, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSlack(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSlacks, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSlacks() |
Convenience wrapper for
bool(out GetCallbackPresolveSlacks, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSlacks(Boolean) |
Convenience wrapper for
GetCallbackPresolveSlacks(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSlacks(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSlacks, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSlacks(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSlacks, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSlacks(Boolean, Double, Int32, Int32) |
Returns the slack values from the solution to the presolved problem associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSolution() |
Convenience wrapper for
bool(out GetCallbackPresolveSolution, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSolution(Boolean) |
Convenience wrapper for
GetCallbackPresolveSolution(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSolution(Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSolution, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSolution(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSolution, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSolution(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSolution, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSolution(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackPresolveSolution, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackPresolveSolution(Boolean, Double, Int32, Int32) |
Returns the solution to the presolved problem associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCallbackRedCost(Int32) |
Convenience wrapper for
bool(out GetCallbackRedCosts, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackRedCost(Variable) |
Get the reduced cost associated with the current callbackfor a single variable.
|
|
GetCallbackRedCost(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackRedCosts, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackRedCosts() |
Convenience wrapper for
bool(out GetCallbackRedCosts, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackRedCosts(Boolean) |
Convenience wrapper for
GetCallbackRedCosts(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackRedCosts(ICollection<Variable>) |
Get the reduced costs associated with the current callback for a collection of variables. The values in the returned array are in 1-to-1 correspondence with the variables in
vars.
|
|
GetCallbackRedCosts(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackRedCosts, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackRedCosts(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackRedCosts, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackRedCosts(Boolean, Double, Int32, Int32) |
Returns the reduced costs from the solution associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCallbackSlack(Int32) |
Convenience wrapper for
bool(out GetCallbackSlacks, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackSlack(Inequality) |
Get the slack associated with the current callback for a single row.
|
|
GetCallbackSlack(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackSlacks, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackSlacks() |
Convenience wrapper for
bool(out GetCallbackSlacks, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackSlacks(Boolean) |
Convenience wrapper for
GetCallbackSlacks(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackSlacks(ICollection<Inequality>) |
Get the slacks associated with the current callback for a collection of rows. The values in the returned array are in 1-to-1 correspondence with the rows in
rows.
|
|
GetCallbackSlacks(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackSlacks, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackSlacks(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackSlacks, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackSlacks(Boolean, Double, Int32, Int32) |
Returns the slack values from the solution associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCallbackSolution() |
Convenience wrapper for
bool(out GetCallbackSolution, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackSolution(Boolean) |
Convenience wrapper for
GetCallbackSolution(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetCallbackSolution(Int32) |
Convenience wrapper for
bool(out GetCallbackSolution, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackSolution(Variable) |
Get the solution associated with the current callback for a single variable.
|
|
GetCallbackSolution(ICollection<Variable>) |
Get the solution associated with the current callback for a collection of variables. The values in the returned array are in 1-to-1 correspondence with the variables in
vars.
|
|
GetCallbackSolution(Boolean, Int32) |
Convenience wrapper for
bool(out GetCallbackSolution, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetCallbackSolution(Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackSolution, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackSolution(Boolean, Int32, Int32) |
Convenience wrapper for
bool(out GetCallbackSolution, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetCallbackSolution(Boolean, Double, Int32, Int32) |
Returns the solution associated with the current callback.
(Inherited from XPRSprob.) |
|
GetCoef(Int32, Int32) |
Convenience wrapper for
GetCoef(int,int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetCoef(Inequality, Variable) |
Query a single coefficient from the linear matrix. Retrieves the coefficient of
variable in
row in the linear matrix. Note that the coefficient will be 0 (zero) in case the variable has no coefficient in that row.
|
|
GetCoef(Int32, Int32, Double) |
Returns a single coefficient in the constraint matrix.
(Inherited from XPRSprob.) |
|
GetCols(Int32, Int32) |
Get range of columns.
(Inherited from XPRSprob.) |
|
GetCols(Int32, Int32, Double, Int32, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetCols(Int64, Int32, Double, Int64, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetCols(Int32, Int32, Double, Int32, Int32, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetCols(Int64, Int32, Double, Int64, Int64, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetColType(Int32) |
Convenience wrapper for
GetColType(char[], int, int).
(Inherited from XPRSprob.) |
|
GetColType(Int32, Int32) |
Convenience wrapper for
GetColType(char[], int, int).
(Inherited from XPRSprob.) |
|
GetColType(Char, Int32, Int32) |
Returns the column types for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetColumnName |
Get a column name.
(Inherited from XPRSprob.) |
|
GetColumnNames |
Get names of columns.
(Inherited from XPRSprob.) |
|
GetControlInfo |
Accesses the id number and the type information of a control given its name. A control name may be for example
XPRS_PRESOLVE. Names are case-insensitive and may or may not have the
XPRS_ prefix. The id number is the constant used to identify the control for calls to functions such as
getIntControl. The function will return an id number of
0 and a type value of
XPRS_TYPE_NOTDEFINED if the name is not recognized as a control name. Note that this will occur if the name is an attribute name and not a control name.
(Inherited from XPRSprob.) |
|
GetCPCutList(Int32, Cut, Double) |
Returns a list of cut indices from the cut pool.
(Inherited from XPRSprob.) |
|
GetCPCutList(Int32, Int32, Double, Int32, Cut, Double) |
Returns a list of cut indices from the cut pool.
(Inherited from XPRSprob.) |
|
GetCPCutList(Int32, Int32, Double, Int32, Int32, Cut, Double) |
Returns a list of cut indices from the cut pool.
(Inherited from XPRSprob.) |
|
GetCPCuts(Cut, Int32, Int32, Int32, Char, Int32, Int32, Double, Double) |
Returns cuts from the cut pool. A list of cut pointers in the array
rowind must be passed to the routine. The columns and elements of the cut will be returned in the regions pointed to by the
colind and
cutcoef parameters. The columns and elements will be stored contiguously and the starting point of each cut will be returned in the region pointed to by the
start parameter.
(Inherited from XPRSprob.) |
|
GetCPCuts(Cut, Int32, Int64, Int32, Char, Int64, Int32, Double, Double) |
Returns cuts from the cut pool. A list of cut pointers in the array
rowind must be passed to the routine. The columns and elements of the cut will be returned in the regions pointed to by the
colind and
cutcoef parameters. The columns and elements will be stored contiguously and the starting point of each cut will be returned in the region pointed to by the
start parameter.
(Inherited from XPRSprob.) |
|
GetCutList(Int32, Cut) |
Retrieves a list of cut pointers for the cuts active at the current node.
(Inherited from XPRSprob.) |
|
GetCutList(Int32, Int32, Int32, Cut) |
Retrieves a list of cut pointers for the cuts active at the current node.
(Inherited from XPRSprob.) |
|
GetCutList(Int32, Int32, Int32, Int32, Cut) |
Retrieves a list of cut pointers for the cuts active at the current node.
(Inherited from XPRSprob.) |
|
GetCutMap |
Used to return in which rows a list of cuts are currently loaded into the Optimizer. This is useful for example to retrieve the duals associated with active cuts.
(Inherited from XPRSprob.) |
|
GetCutSlack(Cut) |
Convenience wrapper for
GetCutSlack(Cut,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetCutSlack(Cut, Double) |
Used to calculate the slack value of a cut with respect to the current LP relaxation solution. The slack is calculated from the cut itself, and might be requested for any cut (even if it is not currently loaded into the problem).
(Inherited from XPRSprob.) |
|
GetDblAttrib(Int32) |
Convenience wrapper for
GetDblAttrib(int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetDblAttrib(Int32, Double) |
Enables users to retrieve the values of various double problem attributes. Problem attributes are set during loading and optimization of a problem.
(Inherited from XPRSprob.) |
|
GetDblControl(Int32) |
Convenience wrapper for
GetDblControl(int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetDblControl(Int32, Double) |
Retrieves the value of a given double control parameter.
(Inherited from XPRSprob.) |
|
GetDirs() |
Used to return the directives that have been loaded into a matrix. Priorities, forced branching directions and pseudo costs can be returned. If called after presolve,
getDirs will get the directives for the presolved problem.
(Inherited from XPRSprob.) |
|
GetDirs(Int32, Int32, Char, Double, Double) |
Used to return the directives that have been loaded into a matrix. Priorities, forced branching directions and pseudo costs can be returned. If called after presolve,
getDirs will get the directives for the presolved problem.
(Inherited from XPRSprob.) |
|
GetDirs(Int32, Int32, Int32, Char, Double, Double) |
Used to return the directives that have been loaded into a matrix. Priorities, forced branching directions and pseudo costs can be returned. If called after presolve,
getDirs will get the directives for the presolved problem.
(Inherited from XPRSprob.) |
|
GetDiscreteCols |
Get information about MIP entities.
(Inherited from XPRSprob.) |
|
GetDual(Int32) |
Convenience wrapper for
int(out GetDuals, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetDual(Inequality) |
Get the dual for a single row.
|
|
GetDual(Int32, Int32) |
Convenience wrapper for
int(out GetDuals, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetDualRay |
Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible.
(Inherited from XPRSprob.) |
|
GetDuals() |
Convenience wrapper for
int(out GetDuals, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetDuals(Int32) |
Convenience wrapper for
GetDuals(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetDuals(ICollection<Inequality>) |
Get the duals for a collection of rows. The values in the returned array are in 1-to-1 correspondence with the row in
row.
|
|
GetDuals(Int32, Int32) |
Convenience wrapper for
int(out GetDuals, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetDuals(Int32, Int32, Int32) |
Convenience wrapper for
int(out GetDuals, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetDuals(Int32, Double, Int32, Int32) |
Used to obtain the dual values associated with the incumbent solution during or after optimization of a continuous problem with
optimize,
lpOptimize or
nlpOptimize.
(Inherited from XPRSprob.) |
|
GetGenCons(Int32, Int32) |
Query a range of general constraints.
(Inherited from XPRSprob.) |
|
GetGenCons(GenConsType, Int32, Int32, Int32, Int32, Int32, Int32, Double, Int32, Int32, Int32, Int32) |
Returns the general constraints
y = f(x1, ..., xn, c1, ..., cm) in a given range.
(Inherited from XPRSprob.) |
|
GetGenCons(GenConsType, Int32, Int64, Int32, Int64, Int64, Int64, Double, Int64, Int64, Int32, Int32) |
Returns the general constraints
y = f(x1, ..., xn, c1, ..., cm) in a given range.
(Inherited from XPRSprob.) |
|
GetGenConsName |
Get a general constraint name.
(Inherited from XPRSprob.) |
|
GetGenConsNames |
Get names of general constraints.
(Inherited from XPRSprob.) |
|
GetGeneralConstraints |
Get all the general constraints currently defined in this problem.
|
|
GetGlobal | Obsolete. (Inherited from XPRSprob.) |
|
GetHashCode | (Inherited from XPRSobject.) |
|
GetIIS |
Get the specified IIS.
|
|
GetIISData(Int32) |
Get information about an IIS.
(Inherited from XPRSprob.) |
|
GetIISData(Int32, Int32, Int32, Int32, Int32, Char, Char, Double, Double, Char, Char) |
Returns information for an Irreducible Infeasible Set: size, variables and constraints (row and column vectors), and conflicting sides of the variables. For pure linear problems there is also information on duals, reduced costs and isolations.
(Inherited from XPRSprob.) |
|
GetIndex(Int32, String) |
Convenience wrapper for
GetIndex(int,string,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetIndex(Int32, String, Int32) |
Returns the index for a specified row or column name.
(Inherited from XPRSprob.) |
|
GetIndicator(Int32) |
Get indicator information for a single row.
(Inherited from XPRSprob.) |
|
GetIndicator(Inequality) |
Get indicator information for a single row.
|
|
GetIndicators(Int32, Int32) |
Get indicator information for a range of rows. Returns indicator information for the rows in [
first,
last] that actually are indicator rows. No data is returned for rows in this range that are not indicator rows.
(Inherited from XPRSprob.) |
|
GetIndicators(Int32, Int32, Int32, Int32) |
Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range.
(Inherited from XPRSprob.) |
|
GetInequalities |
Get all the inequalities currently defined in this problem.
|
|
GetInequalityLinear(Inequality) |
Get the linear part of the left-hand side of a row.
|
|
GetInequalityLinear(Inequality, Func<LinExpression>) |
Get the linear part of the left-hand side of a row. The function adds the linear part of
row to the expression provided by
expression. If
expression is
null then the function allocates a new
Optimizer.Objects.LinTermList for it. If the function allocates a new
Optimizer.Objects.LinTermList then it also returns that new object. In that case the list is guaranteed to not have any duplicates.
|
|
GetInfeas |
Returns a list of infeasible primal and dual variables.
(Inherited from XPRSprob.) |
|
GetIntAttrib(Int32) |
Convenience wrapper for
GetIntAttrib(int,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetIntAttrib(Int32, Int32) |
Enables users to recover the values of various integer problem attributes. Problem attributes are set during loading and optimization of a problem.
(Inherited from XPRSprob.) |
|
GetIntControl(Int32) |
Convenience wrapper for
GetIntControl(int,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetIntControl(Int32, Int32) |
Enables users to recover the values of various integer control parameters
(Inherited from XPRSprob.) |
|
GetLastBarSol() |
Get a solution.
(Inherited from XPRSprob.) |
|
GetLastBarSol(Double, Double, Double, Double, Int32) |
Used to obtain the last barrier solution values following optimization that used the barrier solver.
(Inherited from XPRSprob.) |
|
GetLastBarSolDjs |
Get the djs values of a solution.
(Inherited from XPRSprob.) |
|
GetLastBarSolDuals |
Get the duals values of a solution.
(Inherited from XPRSprob.) |
|
GetLastBarSolSlack |
Get the slack values of a solution.
(Inherited from XPRSprob.) |
|
GetLastBarSolX |
Get the x values of a solution.
(Inherited from XPRSprob.) |
|
GetLastError() |
Returns the error message corresponding to the last error encountered by a library function.
(Inherited from XPRSprob.) |
|
GetLastError(String) |
Returns the error message corresponding to the last error encountered by a library function.
(Inherited from XPRSprob.) |
|
GetLB(Int32) |
Convenience wrapper for
GetLB(double[], int, int).
(Inherited from XPRSprob.) |
|
GetLB(Int32, Int32) |
Convenience wrapper for
GetLB(double[], int, int).
(Inherited from XPRSprob.) |
|
GetLB(Double, Int32, Int32) |
Returns the lower bounds for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetLhsExpression |
Get the left-hand side of a row as an expression.
|
|
GetLongAttrib(Int32) |
Convenience wrapper for
GetLongAttrib(int,long) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetLongAttrib(Int32, Int64) |
Enables users to recover the values of various integer problem attributes. Problem attributes are set during loading and optimization of a problem.
(Inherited from XPRSprob.) |
|
GetLongControl(Int32) |
Convenience wrapper for
GetLongControl(int,long) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetLongControl(Int32, Int64) |
Enables users to recover the values of various integer control parameters
(Inherited from XPRSprob.) |
|
GetLpSol() |
Get a solution.
(Inherited from XPRSprob.) |
|
GetLpSol(Double) |
Used to obtain the LP solution values following optimization.
(Inherited from XPRSprob.) |
|
GetLpSol(Double, Double, Double, Double) |
Used to obtain the LP solution values following optimization.
(Inherited from XPRSprob.) |
|
GetLpSolDjs |
Get the djs values of a solution.
(Inherited from XPRSprob.) |
|
GetLpSolDuals |
Get the duals values of a solution.
(Inherited from XPRSprob.) |
|
GetLpSolSlack |
Get the slack values of a solution.
(Inherited from XPRSprob.) |
|
GetLpSolVal | Obsolete.
Used to obtain a single LP solution value following optimization.
(Inherited from XPRSprob.) |
|
GetLpSolX |
Get the x values of a solution.
(Inherited from XPRSprob.) |
|
GetMessageStatus(Int32) |
Convenience wrapper for
GetMessageStatus(int,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetMessageStatus(Int32, Int32) |
Retrieves the current suppression status of a message.
(Inherited from XPRSprob.) |
|
GetMIPEntities() |
Get information about MIP entities and SOS.
(Inherited from XPRSprob.) |
|
GetMIPEntities(Char, Int32, Double) |
Retrieves integr and entity information about a problem. It must be called before
mipOptimize if the presolve option is used.
(Inherited from XPRSprob.) |
|
GetMIPEntities(Int32, Char, Int32, Double) |
Retrieves integr and entity information about a problem. It must be called before
mipOptimize if the presolve option is used.
(Inherited from XPRSprob.) |
|
GetMIPEntities(Int32, Int32, Char, Int32, Double, Char, Int32, Int32, Double) |
Retrieves integr and entity information about a problem. It must be called before
mipOptimize if the presolve option is used.
(Inherited from XPRSprob.) |
|
GetMIPEntities(Int32, Int32, Char, Int32, Double, Char, Int64, Int32, Double) |
Retrieves integr and entity information about a problem. It must be called before
mipOptimize if the presolve option is used.
(Inherited from XPRSprob.) |
|
GetMipSol() | Obsolete.
Get a solution.
(Inherited from XPRSprob.) |
|
GetMipSol(Double) | Obsolete.
Used to obtain the solution values of the last MIP solution that was found.
(Inherited from XPRSprob.) |
|
GetMipSol(Double, Double) | Obsolete.
Used to obtain the solution values of the last MIP solution that was found.
(Inherited from XPRSprob.) |
|
GetMipSolSlack | Obsolete.
Get the slack values of a solution.
(Inherited from XPRSprob.) |
|
GetMipSolVal | Obsolete.
Used to obtain a single solution value of the last MIP solution that was found.
(Inherited from XPRSprob.) |
|
GetMipSolX | Obsolete.
Get the x values of a solution.
(Inherited from XPRSprob.) |
|
GetMQObj(Int32, Int32) |
Get quadratic objective matrix for range of columns.
(Inherited from XPRSprob.) |
|
GetMQObj(Int32, Int32, Double, Int32, Int32, Int32) |
Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency,
getMQObj returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetMQObj(Int64, Int32, Double, Int64, Int32, Int32) |
Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency,
getMQObj returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetMQObj(Int32, Int32, Double, Int32, Int32, Int32, Int32) |
Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency,
getMQObj returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetMQObj(Int64, Int32, Double, Int64, Int64, Int32, Int32) |
Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency,
getMQObj returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetName(Int32, Int32) |
Get the name of a single element.
(Inherited from XPRSprob.) |
|
GetName(Namespaces, Int32) |
Get the name of a single element.
(Inherited from XPRSprob.) |
|
GetNameList(Int32, Int32, Int32) |
Get the given row, column or set names for the given range.
(Inherited from XPRSprob.) |
|
GetNameList(Int32, String, Int32, Int32) |
Get the given row, column or set names for the given range.
(Inherited from XPRSprob.) |
|
GetNameListObject | (Inherited from XPRSprob.) |
|
GetNames(Int32, Int32, Int32) |
Get names. Retrieves names for a certain type of objects.
(Inherited from XPRSprob.) |
|
GetNames(Namespaces, Int32, Int32) |
Get names. Retrieves names for a certain type of objects.
(Inherited from XPRSprob.) |
|
GetNames(Int32, String, Int32, Int32) |
Get the given row, column or set names for the given range.
(Inherited from XPRSprob.) |
|
GetNames(Namespaces, String, Int32, Int32) |
Get names. Retrieves names for a certain type of objects.
(Inherited from XPRSprob.) |
|
GetNlpsol | Obsolete.
Obtain the current SLP solution values
(Inherited from XPRSprob.) |
|
GetObj(Int32) |
Convenience wrapper for
GetObj(double[], int, int).
(Inherited from XPRSprob.) |
|
GetObj(Variable) |
Query an objective function coefficient. Retrieves the linear objective coefficient for the specified variable from the first/primary objective.
|
|
GetObj(Int32, Int32) |
Convenience wrapper for
GetObj(double[], int, int).
(Inherited from XPRSprob.) |
|
GetObj(Double, Int32, Int32) |
Returns the objective function coefficients for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetObjDblAttrib(Int32, Int32) |
Convenience wrapper for
GetObjDblAttrib(int,int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetObjDblAttrib(Int32, Int32, Double) |
Retrieves the value of a given double attribute associated with a multi-objective solve. When solving a multi-objective problem, several objectives might be optimized in sequence. After each solve, the problem attributes are captured so that they can be queried afterwards.
(Inherited from XPRSprob.) |
|
GetObjDblControl(Int32, ObjControl) |
Convenience wrapper for
GetObjDblControl(int,ObjControl,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetObjDblControl(Int32, ObjControl, Double) |
Retrieves the value of a given double control parameter associated with an objective function. These parameters control how the objective is treated during multi-objective optimization.
(Inherited from XPRSprob.) |
|
GetObjectTypeName |
Function to access the type name of an object referenced using the generic Optimizer object pointer
XPRSobject.
(Inherited from XPRSobject.) |
|
GetObjIntAttrib(Int32, Int32) |
Convenience wrapper for
GetObjIntAttrib(int,int,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetObjIntAttrib(Int32, Int32, Int32) |
Retrieves the value of a given integer attribute associated with a multi-objective solve. When solving a multi-objective problem, several objectives might be optimized in sequence. After each solve, the problem attributes are captured so that they can be queried afterwards.
(Inherited from XPRSprob.) |
|
GetObjIntAttrib(Int32, Int32, Int64) |
Retrieves the value of a given integer attribute associated with a multi-objective solve. When solving a multi-objective problem, several objectives might be optimized in sequence. After each solve, the problem attributes are captured so that they can be queried afterwards.
(Inherited from XPRSprob.) |
|
GetObjIntControl(Int32, ObjControl) |
Convenience wrapper for
GetObjIntControl(int,ObjControl,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetObjIntControl(Int32, ObjControl, Int32) |
Retrieves the value of a given integer control parameter associated with an objective. These parameters control how the objective is treated during multi-objective optimization.
(Inherited from XPRSprob.) |
|
GetObjLongAttrib |
Convenience wrapper for
GetObjIntAttrib(int,int,long) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetObjN(Int32, Variable) |
Query an objective function coefficient. Retrieves the linear objective coefficient for the specified variable from objective
objidx.
|
|
GetObjN(Int32, Double, Int32, Int32) |
For a given objective function, returns the objective coefficients for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetPivotOrder |
Returns the pivot order of the basic variables.
(Inherited from XPRSprob.) |
|
GetPivots |
Returns a list of potential leaving variables if a specified variable enters the basis.
(Inherited from XPRSprob.) |
|
GetPresolveBasis |
Returns the current basis from memory into the user's data areas. If the problem is presolved, the presolved basis will be returned. Otherwise the original basis will be returned.
(Inherited from XPRSprob.) |
|
GetPresolveMap |
Returns the mapping of the row and column numbers from the presolve problem back to the original problem.
(Inherited from XPRSprob.) |
|
GetPresolveSol() |
Get a solution.
(Inherited from XPRSprob.) |
|
GetPresolveSol(Double) |
Returns the solution for the presolved problem from memory.
(Inherited from XPRSprob.) |
|
GetPresolveSol(Double, Double, Double, Double) |
Returns the solution for the presolved problem from memory.
(Inherited from XPRSprob.) |
|
GetPresolveSolDjs |
Get the djs values of a solution.
(Inherited from XPRSprob.) |
|
GetPresolveSolDuals |
Get the duals values of a solution.
(Inherited from XPRSprob.) |
|
GetPresolveSolSlack |
Get the slack values of a solution.
(Inherited from XPRSprob.) |
|
GetPresolveSolX |
Get the x values of a solution.
(Inherited from XPRSprob.) |
|
GetPrimalRay |
Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded.
(Inherited from XPRSprob.) |
|
GetProbName() |
Returns the current problem name.
(Inherited from XPRSprob.) |
|
GetProbName(String) |
Returns the current problem name.
(Inherited from XPRSprob.) |
|
GetPwlCons(Int32, Int32, Int32, Double, Double, Int32, Int32, Int32, Int32) |
Returns the piecewise linear constraints
y = f(x) in a given range.
(Inherited from XPRSprob.) |
|
GetPwlCons(Int32, Int32, Int64, Double, Double, Int64, Int64, Int32, Int32) |
Returns the piecewise linear constraints
y = f(x) in a given range.
(Inherited from XPRSprob.) |
|
GetPWLName |
Get a PWL constraint name.
(Inherited from XPRSprob.) |
|
GetPWLNames |
Get names of PWL constraints.
(Inherited from XPRSprob.) |
|
GetPWLs |
Get all piecewise linear constraints currently defined in this problem.
|
|
GetQObj(Int32, Int32) |
Convenience wrapper for
GetQObj(int,int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetQObj(Int32, Int32, Double) |
Returns a single quadratic objective function coefficient corresponding to the variable pair
(objqcol1, objqcol2) of the Hessian matrix.
(Inherited from XPRSprob.) |
|
GetQRowCoeff(Int32, Int32, Int32) |
Convenience wrapper for
GetQRowCoeff(int,int,int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetQRowCoeff(Int32, Int32, Int32, Double) |
Returns a single quadratic constraint coefficient corresponding to the variable pair (
rowqcol1,
rowqcol2) of the Hessian of a given constraint.
(Inherited from XPRSprob.) |
|
GetQRowQMatrix(Int32, Int32, Int32, Double, Int32, Int32, Int32) |
Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range. To achieve maximum efficiency,
getQRowQMatrix returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetQRowQMatrix(Int32, Int32, Int32, Double, Int32, Int32, Int32, Int32) |
Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range. To achieve maximum efficiency,
getQRowQMatrix returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetQRowQMatrixTriplets(Int32, Int32, Int32, Double) |
Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients). To achieve maximum efficiency,
getQRowQMatrixTriplets returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetQRowQMatrixTriplets(Int32, Int32, Int32, Int32, Double) |
Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients). To achieve maximum efficiency,
getQRowQMatrixTriplets returns the lower triangular part of this matrix only.
(Inherited from XPRSprob.) |
|
GetQRows() |
Returns the list indices of the rows that have quadratic coefficients.
(Inherited from XPRSprob.) |
|
GetQRows(Int32) |
Returns the list indices of the rows that have quadratic coefficients.
(Inherited from XPRSprob.) |
|
GetQRows(Int32, Int32) |
Returns the list indices of the rows that have quadratic coefficients.
(Inherited from XPRSprob.) |
|
GetRedCost(Int32) |
Convenience wrapper for
int(out GetRedCosts, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetRedCost(Variable) |
Get the reduced cost for a single variable.
|
|
GetRedCost(Int32, Int32) |
Convenience wrapper for
int(out GetRedCosts, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetRedCosts() |
Convenience wrapper for
int(out GetRedCosts, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetRedCosts(Int32) |
Convenience wrapper for
GetRedCosts(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetRedCosts(ICollection<Variable>) |
Get the reduced costs for a collection of variables. The values in the returned array are in 1-to-1 correspondence with the variables in
vars.
|
|
GetRedCosts(Int32, Int32) |
Convenience wrapper for
int(out GetRedCosts, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetRedCosts(Int32, Int32, Int32) |
Convenience wrapper for
int(out GetRedCosts, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetRedCosts(Int32, Double, Int32, Int32) |
Used to obtain the reduced costs associated with the incumbent solution during or after optimization of a continuous problem with
optimize,
lpOptimize or
nlpOptimize.
(Inherited from XPRSprob.) |
|
GetRHS(Int32) |
Convenience wrapper for
GetRHS(double[], int, int).
(Inherited from XPRSprob.) |
|
GetRHS(Int32, Int32) |
Convenience wrapper for
GetRHS(double[], int, int).
(Inherited from XPRSprob.) |
|
GetRHS(Double, Int32, Int32) |
Returns the right hand side elements for the rows in a given range.
(Inherited from XPRSprob.) |
|
GetRHSRange(Int32) |
Convenience wrapper for
GetRHSRange(double[], int, int).
(Inherited from XPRSprob.) |
|
GetRHSRange(Int32, Int32) |
Convenience wrapper for
GetRHSRange(double[], int, int).
(Inherited from XPRSprob.) |
|
GetRHSRange(Double, Int32, Int32) |
Returns the right hand side range values for the rows in a given range.
(Inherited from XPRSprob.) |
|
GetRowFlags(Int32) |
Convenience wrapper for
GetRowFlags(int[], int, int).
(Inherited from XPRSprob.) |
|
GetRowFlags(Int32, Int32) |
Convenience wrapper for
GetRowFlags(int[], int, int).
(Inherited from XPRSprob.) |
|
GetRowFlags(Int32, Int32, Int32) |
Retrieve if a range of rows have been set up as special rows.
(Inherited from XPRSprob.) |
|
GetRowName |
Get a row name.
(Inherited from XPRSprob.) |
|
GetRowNames |
Get names of rows.
(Inherited from XPRSprob.) |
|
GetRows(Int32, Int32) |
Get range of rows.
(Inherited from XPRSprob.) |
|
GetRows(Int32, Int32, Double, Int32, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the rows in a given range.
(Inherited from XPRSprob.) |
|
GetRows(Int64, Int32, Double, Int64, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the rows in a given range.
(Inherited from XPRSprob.) |
|
GetRows(Int32, Int32, Double, Int32, Int32, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the rows in a given range.
(Inherited from XPRSprob.) |
|
GetRows(Int64, Int32, Double, Int64, Int64, Int32, Int32) |
Returns the nonzeros in the constraint matrix for the rows in a given range.
(Inherited from XPRSprob.) |
|
GetRowType(Int32) |
Convenience wrapper for
GetRowType(char[], int, int).
(Inherited from XPRSprob.) |
|
GetRowType(Int32, Int32) |
Convenience wrapper for
GetRowType(char[], int, int).
(Inherited from XPRSprob.) |
|
GetRowType(Char, Int32, Int32) |
Returns the row types for the rows in a given range.
(Inherited from XPRSprob.) |
|
GetScale |
Returns the the current scaling of the matrix.
(Inherited from XPRSprob.) |
|
GetScaledInfeas |
Returns a list of scaled infeasible primal and dual variables for the original problem. If the problem is currently presolved, it is postsolved before the function returns.
(Inherited from XPRSprob.) |
|
GetSetDefinitions |
Get information about SOS.
(Inherited from XPRSprob.) |
|
GetSetName |
Get a Set (SOS) name.
(Inherited from XPRSprob.) |
|
GetSetNames |
Get names of Sets (SOS).
(Inherited from XPRSprob.) |
|
GetSets |
Get information about SOS.
(Inherited from XPRSprob.) |
|
GetSlack(Int32) |
Convenience wrapper for
int(out GetSlacks, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetSlack(Inequality) |
Get the current slack for a single row.
|
|
GetSlack(Int32, Int32) |
Convenience wrapper for
int(out GetSlacks, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetSlacks() |
Convenience wrapper for
int(out GetSlacks, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetSlacks(Int32) |
Convenience wrapper for
GetSlacks(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetSlacks(ICollection<Inequality>) |
Get the current slacks for a collection of rows. The values in the returned array are in 1-to-1 correspondence with the rows in
rows.
|
|
GetSlacks(Int32, Int32) |
Convenience wrapper for
int(out GetSlacks, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetSlacks(Int32, Int32, Int32) |
Convenience wrapper for
int(out GetSlacks, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetSlacks(Int32, Double, Int32, Int32) |
Used to obtain the slack values associated with the incumbent solution during or after optimization with
optimize,
mipOptimize,
lpOptimize or
nlpOptimize.
(Inherited from XPRSprob.) |
|
GetSolDjs | Obsolete.
Get the djs values of a solution.
(Inherited from XPRSprob.) |
|
GetSolDuals | Obsolete.
Get the duals values of a solution.
(Inherited from XPRSprob.) |
|
GetSolSlack | Obsolete.
Get the slack values of a solution.
(Inherited from XPRSprob.) |
|
GetSolution() |
Convenience wrapper for
int(out GetSolution, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetSolution(Int32) |
Convenience wrapper for
int(out GetSolution, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetSolution(Int32) |
Convenience wrapper for
GetSolution(IntHolder, double[], int, int) that allocates the output array and queries all elements.
(Inherited from XPRSprob.) |
|
GetSolution(Variable) |
Get the current solution for a single variable.
|
|
GetSolution(ICollection<Variable>) |
Get the current solution for a collection of variables. The values in the returned array are in 1-to-1 correspondence with the variables in
vars.
|
|
GetSolution(Int32, Int32) |
Convenience wrapper for
int(out GetSolution, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetSolution(Int32, Int32) |
Convenience wrapper for
int(out GetSolution, double[], int, int) that queries only a single value.
(Inherited from XPRSprob.) |
|
GetSolution(Int32, Int32, Int32) |
Convenience wrapper for
int(out GetSolution, double[], int, int) that allocates the output array.
(Inherited from XPRSprob.) |
|
GetSolution(Int32, Double, Int32, Int32) |
Used to obtain the incumbent solution during or after optimization with
optimize,
mipOptimize,
lpOptimize or
nlpOptimize.
(Inherited from XPRSprob.) |
|
GetSolX | Obsolete.
Get the x values of a solution.
(Inherited from XPRSprob.) |
|
GetSOSs |
Get all the special ordered set constraints currently defined in this problem.
|
|
GetStrAttrib(Int32) |
Get the current value of a string attribute
(Inherited from XPRSprob.) |
|
GetStrAttrib(Int32, String) |
Get the current value of a string attribute
(Inherited from XPRSprob.) |
|
GetStrControl(Int32) |
Get the current value of a string control
(Inherited from XPRSprob.) |
|
GetStrControl(Int32, String) |
Get the current value of a string control
(Inherited from XPRSprob.) |
|
GetStringControl |
Returns the value of a given string control parameters.
(Inherited from XPRSprob.) |
|
GetStrStringAttrib |
Enables users to recover the values of various string problem attributes. Problem attributes are set during loading and optimization of a problem.
(Inherited from XPRSprob.) |
|
GetType |
Gets the
Type of the current instance.
(Inherited from Object.) |
|
GetUB(Int32) |
Convenience wrapper for
GetUB(double[], int, int).
(Inherited from XPRSprob.) |
|
GetUB(Int32, Int32) |
Convenience wrapper for
GetUB(double[], int, int).
(Inherited from XPRSprob.) |
|
GetUB(Double, Int32, Int32) |
Returns the upper bounds for the columns in a given range.
(Inherited from XPRSprob.) |
|
GetUnbVec() |
Convenience wrapper for
GetUnbVec(int) that returns the output argument.
(Inherited from XPRSprob.) |
|
GetUnbVec(Int32) |
Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a matrix is primal or dual unbounded respectively.
(Inherited from XPRSprob.) |
|
GetVariables |
Get all the variables currently defined in this problem.
|
|
IISAll |
Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem.
(Inherited from XPRSprob.) |
|
IISIsolations |
Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS). This function applies only to linear problems.
(Inherited from XPRSprob.) |
|
IISStatus() |
Get the IIS status.
(Inherited from XPRSprob.) |
|
IISStatus(Int32, Int32, Int32, Double, Int32) |
Returns statistics on the Irreducible Infeasible Sets (IIS) found so far by
firstIIS (
IIS),
nextIIS (
IIS
-n) or
iISAll (
IIS
-a).
(Inherited from XPRSprob.) |
|
InequalitiesForIndices |
Map a range of inequality indices to inequality objects.
|
|
InequalityForIndex |
Map an inequality index to an inequality object.
|
|
Interrupt() |
Interrupts the Optimizer algorithms.
(Inherited from XPRSprob.) |
|
Interrupt(StopType) |
Interrupts the Optimizer algorithms.
(Inherited from XPRSprob.) |
|
IntVar() |
Create a new integer variable with default bounds [0, infinity].
(Inherited from XPRSprob.) |
|
IntVar(String) |
Create a new integer variable with default bounds [0, infinity] and a specified name.
(Inherited from XPRSprob.) |
|
IntVar(Double, Double) |
Create a new integer variable with specified bounds.
(Inherited from XPRSprob.) |
|
IntVar(Double, Double, String) |
Create a new integer variable with specified bounds and name.
(Inherited from XPRSprob.) |
|
IntVarArray(Int32, Double, Double, Func<Int32, String>) |
Create an array of integer variables. All the variables created by this function have the same types and bounds.
(Inherited from XPRSprob.) |
|
IntVarArray(Int32, Double, Double, String) |
Create an array of integer variables.
(Inherited from XPRSprob.) |
|
IntVarArray(Int32, Func<Int32, Double>, Func<Int32, Double>, Func<Int32, String>) |
Create an array of integer variables.
(Inherited from XPRSprob.) |
|
IntVarArray<T>(ICollection<T>, Double, Double, Func<T, String>) |
Create an array of integer variables. All the variables created by this function have the same types and bounds. The function will create one variable for each of the objects listed in
objs.
(Inherited from XPRSprob.) |
|
IntVarArray<T>(ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>) |
Create an array of integer variables. The function will create one variable for each of the objects listed in
objs.
(Inherited from XPRSprob.) |
|
IntVarMap<T>(ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>) |
Create a map of integer variables. The function creates a new variable for each object in
objs. It returns a hash map in which each object in
objs maps to the index of the variable that was created for it.
(Inherited from XPRSprob.) |
|
IntVarMap<T>(ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>, IDictionary<T, Int32>) |
Create a map of integer variables. The function creates a new variable for each object in
objs. For each object o it puts the Pair (o, idx) into
map where idx is the index of the variable that was created for o.
(Inherited from XPRSprob.) |
 |
IsNullVariable |
Check whether a variable is the same as
NULL_VARIABLE. The
NULL_VARIABLE is used in certain places to indicate the absence of a variable. For example, when iterating over the linear terms of an expression, a term with a
NULL_VARIABLE indicates a constant term in the expression.
|
|
IsOriginal |
Check whether this model instance is in the original state. A model is not in the original state if it is a callback problem or its problem state indicates being presolved.
|
|
LoadBasis |
Loads a basis from the user's areas.
(Inherited from XPRSprob.) |
|
LoadBranchDirs(Int32, Int32) |
Convenience wrapper for
LoadBranchDirs(int, int[], int[]).
(Inherited from XPRSprob.) |
|
LoadBranchDirs(Int32, Int32, Int32) |
Loads directives into the current problem to specify which MIP entities the Optimizer should continue to branch on when a node solution is integer feasible.
(Inherited from XPRSprob.) |
|
LoadCuts(Int32, Cut) |
Loads cuts from the cut pool into the matrix. Without calling
loadCuts the cuts will remain in the cut pool but will not be active at the node. Cuts loaded at a node remain active at all descendant nodes unless they are deleted using
delCuts.
(Inherited from XPRSprob.) |
|
LoadCuts(Int32, Int32) |
Loads cuts from the cut pool into the matrix. Without calling
loadCuts the cuts will remain in the cut pool but will not be active at the node. Cuts loaded at a node remain active at all descendant nodes unless they are deleted using
delCuts.
(Inherited from XPRSprob.) |
|
LoadCuts(Int32, Int32, Int32, Cut) |
Loads cuts from the cut pool into the matrix. Without calling
loadCuts the cuts will remain in the cut pool but will not be active at the node. Cuts loaded at a node remain active at all descendant nodes unless they are deleted using
delCuts.
(Inherited from XPRSprob.) |
|
LoadDelayedRows(Inequality) |
Marks a set of rows as delayed rows.
|
|
LoadDelayedRows(Int32, Int32) |
Specifies that a set of rows in the matrix will be treated as delayed rows during a tree search. These are rows that must be satisfied for any integer solution, but will not be loaded into the active set of constraints until required.
(Inherited from XPRSprob.) |
|
LoadDirs |
Loads directives into the matrix.
(Inherited from XPRSprob.) |
|
LoadGlobal(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Char, Int32, Double, Char, Int32, Int32, Double) | Obsolete. (Inherited from XPRSprob.) |
|
LoadGlobal(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int32, Int32, Char, Int32, Double, Char, Int64, Int32, Double) | Obsolete. (Inherited from XPRSprob.) |
|
LoadLP(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double) |
Enables the user to pass a matrix directly to the Optimizer, rather than reading the matrix from a file.
(Inherited from XPRSprob.) |
|
LoadLP(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double) |
Enables the user to pass a matrix directly to the Optimizer, rather than reading the matrix from a file.
(Inherited from XPRSprob.) |
|
LoadLPSol(Double, Double, Double, Double) |
Convenience wrapper for
LoadLPSol(double[],double[],double[],double[],int) that returns the output argument.
(Inherited from XPRSprob.) |
|
LoadLPSol(Double, Double, Double, Double, Int32) |
Loads an LP solution for the problem into the Optimizer.
(Inherited from XPRSprob.) |
|
LoadMIP(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Char, Int32, Double, Char, Int32, Int32, Double) |
Used to load a MIP problem into the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.
(Inherited from XPRSprob.) |
|
LoadMIP(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int32, Int32, Char, Int32, Double, Char, Int64, Int32, Double) |
Used to load a MIP problem into the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.
(Inherited from XPRSprob.) |
|
LoadMipSol(Double) |
Convenience wrapper for
LoadMipSol(double[],int) that returns the output argument.
(Inherited from XPRSprob.) |
|
LoadMipSol(Double, Int32) |
Loads a starting MIP solution for the problem into the Optimizer.
(Inherited from XPRSprob.) |
|
LoadMIQCQP(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Int32, Double, Int32, Int32, Int32, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int32, Int32, Double) |
Used to load a mixed integer quadratic problem with quadratic constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.
(Inherited from XPRSprob.) |
|
LoadMIQCQP(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int64, Int32, Int32, Double, Int32, Int32, Int64, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int64, Int32, Double) |
Used to load a mixed integer quadratic problem with quadratic constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.
(Inherited from XPRSprob.) |
|
LoadMIQP(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int32, Int32, Double) |
Used to load a MIQP problem, hence a MIP with quadratic objective coefficients, into the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.
(Inherited from XPRSprob.) |
|
LoadMIQP(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int64, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int64, Int32, Double) |
Used to load a MIQP problem, hence a MIP with quadratic objective coefficients, into the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.
(Inherited from XPRSprob.) |
|
LoadModelCuts(Inequality) |
Marks a set of rows as model cuts.
|
|
LoadModelCuts(Int32, Int32) |
Specifies that a set of rows in the matrix will be treated as model cuts.
(Inherited from XPRSprob.) |
|
LoadPresolveBasis |
Loads a presolved basis from the user's areas.
(Inherited from XPRSprob.) |
|
LoadPresolveDirs |
Loads directives into the presolved matrix.
(Inherited from XPRSprob.) |
|
LoadQCQP(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Int32, Double, Int32, Int32, Int32, Int32, Int32, Double) |
Used to load a quadratic problem with quadratic side constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints.
(Inherited from XPRSprob.) |
|
LoadQCQP(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int64, Int32, Int32, Double, Int32, Int32, Int64, Int32, Int32, Double) |
Used to load a quadratic problem with quadratic side constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints.
(Inherited from XPRSprob.) |
|
LoadQCQPGlobal(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Int32, Double, Int32, Int32, Int32, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int32, Int32, Double) | Obsolete. (Inherited from XPRSprob.) |
|
LoadQCQPGlobal(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int64, Int32, Int32, Double, Int32, Int32, Int64, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int64, Int32, Double) | Obsolete. (Inherited from XPRSprob.) |
|
LoadQGlobal(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int32, Int32, Double) | Obsolete. (Inherited from XPRSprob.) |
|
LoadQGlobal(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int64, Int32, Int32, Double, Int32, Int32, Char, Int32, Double, Char, Int64, Int32, Double) | Obsolete. (Inherited from XPRSprob.) |
|
LoadQP(String, Int32, Int32, Char, Double, Double, Double, Int32, Int32, Int32, Double, Double, Double, Int32, Int32, Int32, Double) |
Used to load a quadratic problem into the Optimizer data structure. Such a problem may have quadratic terms in its objective function, although not in its constraints.
(Inherited from XPRSprob.) |
|
LoadQP(String, Int32, Int32, Char, Double, Double, Double, Int64, Int32, Int32, Double, Double, Double, Int64, Int32, Int32, Double) |
Used to load a quadratic problem into the Optimizer data structure. Such a problem may have quadratic terms in its objective function, although not in its constraints.
(Inherited from XPRSprob.) |
|
LoadSecureVecs |
Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the matrix.
(Inherited from XPRSprob.) |
|
LpOptimize() |
This function begins a search for the optimal continuous (LP) solution. The direction of optimization is given by
OBJSENSE. The status of the problem when the function completes can be checked using
LPSTATUS. Any MIP entities in the problem will be ignored.
(Inherited from XPRSprob.) |
|
LpOptimize(String) |
This function begins a search for the optimal continuous (LP) solution. The direction of optimization is given by
OBJSENSE. The status of the problem when the function completes can be checked using
LPSTATUS. Any MIP entities in the problem will be ignored.
(Inherited from XPRSprob.) |
|
MakeConstraintCreator() |
Create a
ConstraintCreator for this problem instance.
|
|
MakeConstraintCreator(Boolean) |
Create a
ConstraintCreator for this problem instance.
|
|
Maxim() | Obsolete.
Begins a search for the optimal LP solution.
(Inherited from XPRSprob.) |
|
Maxim(String) | Obsolete.
Begins a search for the optimal LP solution.
(Inherited from XPRSprob.) |
|
MemberwiseClone |
Creates a shallow copy of the current
Object.
(Inherited from Object.) |
|
Minim() | Obsolete.
Begins a search for the optimal LP solution.
(Inherited from XPRSprob.) |
|
Minim(String) | Obsolete.
Begins a search for the optimal LP solution.
(Inherited from XPRSprob.) |
|
MipOptimize() |
This function begins a tree search for the optimal MIP solution. The direction of optimization is given by
OBJSENSE. The status of the problem when the function completes can be checked using
MIPSTATUS.
(Inherited from XPRSprob.) |
|
MipOptimize(String) |
This function begins a tree search for the optimal MIP solution. The direction of optimization is given by
OBJSENSE. The status of the problem when the function completes can be checked using
MIPSTATUS.
(Inherited from XPRSprob.) |
|
MsAddCustomPreset |
A combined version of XSLPmsaddjob and XSLPmsaddpreset. The preset described is loaded, topped up with the specific settings supplied
(Inherited from XPRSprob.) |
|
MsAddJob |
Adds a multistart job to the multistart pool
(Inherited from XPRSprob.) |
|
MsAddPreset |
Loads a preset of jobs into the multistart job pool.
(Inherited from XPRSprob.) |
|
MsClear |
Removes all scheduled jobs from the multistart job pool
(Inherited from XPRSprob.) |
|
NextIIS() |
Convenience wrapper for
NextIIS(int) that returns the output argument.
(Inherited from XPRSprob.) |
|
NextIIS(Int32) |
Continues the search for further Irreducible Infeasible Sets (IIS), or calls
firstIIS (
IIS) if no IIS has been identified yet.
(Inherited from XPRSprob.) |
|
NlpAddFormulas |
Add non-linear formulas to the SLP problem.
(Inherited from XPRSprob.) |
|
NlpCalcSlacks |
Calculate the slack values for the provided solution in the non-linear problem
(Inherited from XPRSprob.) |
|
NlpChgFormula |
Add or replace a single matrix formula using a parsed or unparsed formula
(Inherited from XPRSprob.) |
|
NlpChgFormulaStr |
Add or replace a single matrix formula using a character string for the formula.
(Inherited from XPRSprob.) |
|
NlpChgFormulaString | Obsolete.
Add or replace a single matrix formula using a character string for the formula.
(Inherited from XPRSprob.) |
|
NlpCurrentIV |
Transfer the current solution to initial values
(Inherited from XPRSprob.) |
|
NlpDelFormulas |
Delete nonlinear formulas from the current problem
(Inherited from XPRSprob.) |
|
NlpDelUserFunction |
Delete a user function from the current problem
(Inherited from XPRSprob.) |
|
NlpEvaluateFormula(Int32, Int32, Double) |
Convenience wrapper for
NlpEvaluateFormula(int,int[],double[],double) that returns the output argument.
(Inherited from XPRSprob.) |
|
NlpEvaluateFormula(Int32, Int32, Double, Double) |
Evaluate a formula using the current values of the variables
(Inherited from XPRSprob.) |
|
NlpGetFormula |
Retrieve a single matrix formula as a formula split into tokens.
(Inherited from XPRSprob.) |
|
NlpGetFormulaRows |
Retrieve the list of positions of the nonlinear formulas in the problem
(Inherited from XPRSprob.) |
|
NlpGetFormulaStr |
Retrieve a single matrix formula in a character string.
(Inherited from XPRSprob.) |
|
NlpGetFormulaString | Obsolete.
Retrieve a single matrix formula in a character string.
(Inherited from XPRSprob.) |
|
NlpImportLibFunc |
Imports a function from a library file to be called as a user function
(Inherited from XPRSprob.) |
|
NlpLoadFormulas |
Load non-linear formulas into the SLP problem
(Inherited from XPRSprob.) |
|
NlpOptimize |
Maximize or minimize an SLP problem
(Inherited from XPRSprob.) |
|
NlpPostsolveProb |
Restores the problem to its pre-solve state
(Inherited from XPRSprob.) |
|
NlpPrintEvalInfo |
Print a summary of any evaluation errors that may have occurred during solving a problem
(Inherited from XPRSprob.) |
|
NlpSetFunctionError |
Set the function error flag for the problem
(Inherited from XPRSprob.) |
|
NlpSetInitVal(IDictionary<Variable, Double>) |
Set initial values of variables for a non-linear solve.
|
|
NlpSetInitVal(Int32, Double) |
Convenience wrapper for
NlpSetInitVal(int, int[], double[]).
(Inherited from XPRSprob.) |
|
NlpSetInitVal(Variable, Double) |
Set initial values of variables for a non-linear solve.
|
|
NlpSetInitVal(Int32, Int32, Double) |
Set the initial value of a variable
(Inherited from XPRSprob.) |
|
NlpValidate |
Validate the feasibility of constraints in a converged solution
(Inherited from XPRSprob.) |
|
NlpValidateKKT |
Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution
(Inherited from XPRSprob.) |
|
NlpValidateRow |
Prints an extensive analysis on a given constraint of the SLP problem
(Inherited from XPRSprob.) |
|
NlpValidateVector |
Validate the feasibility of constraints for a given solution
(Inherited from XPRSprob.) |
|
Objsa(Variable, Double, Double) |
Returns upper and lower sensitivity ranges for specified objective function coefficients. If the objective coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.
|
|
Objsa(Int32, Int32, Double, Double) |
Returns upper and lower sensitivity ranges for specified objective function coefficients. If the objective coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.
(Inherited from XPRSprob.) |
|
Objsa(Int32, Variable, Double, Double) |
Returns upper and lower sensitivity ranges for specified objective function coefficients. If the objective coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.
|
|
Optimize() |
Convenience wrapper for .Optimize(string , out int, out int). This function calls
optimize with default arguments and returns the solve status. The solution status is returned and must be queried explicitly afterwards using the corresponding attribute. See the documentation of the overloaded function for more details.
(Inherited from XPRSprob.) |
|
Optimize(String) |
Convenience wrapper for .Optimize(string , out int, out int). This function calls
optimize with the specified flags and returns the solve status. The solution status is returned and must be queried explicitly afterwards using the corresponding attribute. See the documentation of the overloaded function for more details.
(Inherited from XPRSprob.) |
|
Optimize(String, Int32, Int32) |
This function begins a search for the optimal solution of the problem. The direction of optimization is given by
OBJSENSE.
(Inherited from XPRSprob.) |
|
Pivot |
Performs a simplex pivot by bringing variable
enter into the basis and removing
leave.
(Inherited from XPRSprob.) |
|
PostSolve |
Postsolve the current matrix when it is in a presolved state.
(Inherited from XPRSprob.) |
|
PostSolveSol |
Postsolves a primal solution formulated in the presolved space into the corresponding solution formulated in the original space. The problem itself is unchanged.
(Inherited from XPRSprob.) |
|
PresolveRow(XPRSprob.RowInfo) |
Presolve a row. The function transforms a row that is given in terms of the original model to a row that is given in terms of the presolved model.
(Inherited from XPRSprob.) |
|
PresolveRow(Int32, Double, Char, Double) |
Presolve a row. The function transforms a row that is given in terms of the original model to a row that is given in terms of the presolved model.
(Inherited from XPRSprob.) |
|
PresolveRow(Char, Int32, Int32, Double, Double, Int32, Int32, Int32, Double, Double, Int32) |
Presolves a row formulated in terms of the original variables such that it can be added to a presolved matrix.
(Inherited from XPRSprob.) |
|
PrintIIS |
Prints a given Irreducible Infeasible Set (IIS) in the log. If 0 is passed as the IIS number parameter, the initial infeasible subproblem is printed.
(Inherited from XPRSprob.) |
|
PwlForIndex |
Map a PWL index to a PWL object.
|
|
PwlsForIndices |
Map a range of PWL indices to PWL objects.
|
|
ReadBasis() |
Instructs the Optimizer to read in a previously saved basis from a file.
(Inherited from XPRSprob.) |
|
ReadBasis(String) |
Instructs the Optimizer to read in a previously saved basis from a file.
(Inherited from XPRSprob.) |
|
ReadBasis(String, String) |
Instructs the Optimizer to read in a previously saved basis from a file.
(Inherited from XPRSprob.) |
|
ReadBinSol() |
Reads a solution from a binary solution file.
(Inherited from XPRSprob.) |
|
ReadBinSol(String) |
Reads a solution from a binary solution file.
(Inherited from XPRSprob.) |
|
ReadBinSol(String, String) |
Reads a solution from a binary solution file.
(Inherited from XPRSprob.) |
|
ReadDirs() |
Reads a directives file to help direct the tree search.
(Inherited from XPRSprob.) |
|
ReadDirs(String) |
Reads a directives file to help direct the tree search.
(Inherited from XPRSprob.) |
|
ReadProb(String) |
Reads an (X)MPS or LP format matrix from file.
(Inherited from XPRSprob.) |
|
ReadProb(String, String) |
Reads an (X)MPS or LP format matrix from file.
(Inherited from XPRSprob.) |
|
ReadSlxSol() |
Reads an ASCII solution file [
.slx] created by the
writeSlxSol function.
(Inherited from XPRSprob.) |
|
ReadSlxSol(String) |
Reads an ASCII solution file [
.slx] created by the
writeSlxSol function.
(Inherited from XPRSprob.) |
|
ReadSlxSol(String, String) |
Reads an ASCII solution file [
.slx] created by the
writeSlxSol function.
(Inherited from XPRSprob.) |
|
RefineMipSol | Obsolete.
Executes the MIP solution refiner.
(Inherited from XPRSprob.) |
|
RemoveAfterObjectiveCallback |
Remove AfterObjective callback.
(Inherited from XPRSprob.) |
|
RemoveAfterObjectiveCallbacks |
Remove all AfterObjective callbacks.
(Inherited from XPRSprob.) |
|
RemoveBarIterationCallback |
Remove BarIteration callback.
(Inherited from XPRSprob.) |
|
RemoveBarIterationCallbacks |
Remove all BarIteration callbacks.
(Inherited from XPRSprob.) |
|
RemoveBarlogCallback |
Remove Barlog callback.
(Inherited from XPRSprob.) |
|
RemoveBarlogCallbacks |
Remove all Barlog callbacks.
(Inherited from XPRSprob.) |
|
RemoveBeforeObjectiveCallback |
Remove BeforeObjective callback.
(Inherited from XPRSprob.) |
|
RemoveBeforeObjectiveCallbacks |
Remove all BeforeObjective callbacks.
(Inherited from XPRSprob.) |
|
RemoveBeforeSolveCallback |
Remove BeforeSolve callback.
(Inherited from XPRSprob.) |
|
RemoveBeforeSolveCallbacks |
Remove all BeforeSolve callbacks.
(Inherited from XPRSprob.) |
|
RemoveChangeBranchObjectCallback |
Remove ChangeBranchObject callback.
(Inherited from XPRSprob.) |
|
RemoveChangeBranchObjectCallbacks |
Remove all ChangeBranchObject callbacks.
(Inherited from XPRSprob.) |
|
RemoveCheckTimeCallback |
Remove CheckTime callback.
(Inherited from XPRSprob.) |
|
RemoveCheckTimeCallbacks |
Remove all CheckTime callbacks.
(Inherited from XPRSprob.) |
|
RemoveChgbranchCallback | Obsolete.
Remove Chgbranch callback.
(Inherited from XPRSprob.) |
|
RemoveChgbranchCallbacks | Obsolete.
Remove all Chgbranch callbacks.
(Inherited from XPRSprob.) |
|
RemoveChgnodeCallback | Obsolete.
Remove Chgnode callback.
(Inherited from XPRSprob.) |
|
RemoveChgnodeCallbacks | Obsolete.
Remove all Chgnode callbacks.
(Inherited from XPRSprob.) |
|
RemoveComputeRestartCallback |
Remove ComputeRestart callback.
(Inherited from XPRSprob.) |
|
RemoveComputeRestartCallbacks |
Remove all ComputeRestart callbacks.
(Inherited from XPRSprob.) |
|
RemoveCutlogCallback |
Remove Cutlog callback.
(Inherited from XPRSprob.) |
|
RemoveCutlogCallbacks |
Remove all Cutlog callbacks.
(Inherited from XPRSprob.) |
|
RemoveCutmgrCallback | Obsolete.
Remove Cutmgr callback.
(Inherited from XPRSprob.) |
|
RemoveCutmgrCallbacks | Obsolete.
Remove all Cutmgr callbacks.
(Inherited from XPRSprob.) |
|
RemoveGapNotifyCallback |
Remove GapNotify callback.
(Inherited from XPRSprob.) |
|
RemoveGapNotifyCallbacks |
Remove all GapNotify callbacks.
(Inherited from XPRSprob.) |
|
RemoveInfnodeCallback |
Remove Infnode callback.
(Inherited from XPRSprob.) |
|
RemoveInfnodeCallbacks |
Remove all Infnode callbacks.
(Inherited from XPRSprob.) |
|
RemoveIntsolCallback |
Remove Intsol callback.
(Inherited from XPRSprob.) |
|
RemoveIntsolCallbacks |
Remove all Intsol callbacks.
(Inherited from XPRSprob.) |
|
RemoveLplogCallback |
Remove Lplog callback.
(Inherited from XPRSprob.) |
|
RemoveLplogCallbacks |
Remove all Lplog callbacks.
(Inherited from XPRSprob.) |
|
RemoveMessageCallback |
Remove Message callback.
(Inherited from XPRSprob.) |
|
RemoveMessageCallbacks |
Remove all Message callbacks.
(Inherited from XPRSprob.) |
|
RemoveMiplogCallback |
Remove Miplog callback.
(Inherited from XPRSprob.) |
|
RemoveMiplogCallbacks |
Remove all Miplog callbacks.
(Inherited from XPRSprob.) |
|
RemoveMipThreadCallback |
Remove MipThread callback.
(Inherited from XPRSprob.) |
|
RemoveMipThreadCallbacks |
Remove all MipThread callbacks.
(Inherited from XPRSprob.) |
|
RemoveMipThreadDestroyCallback |
Remove MipThreadDestroy callback.
(Inherited from XPRSprob.) |
|
RemoveMipThreadDestroyCallbacks |
Remove all MipThreadDestroy callbacks.
(Inherited from XPRSprob.) |
|
RemoveMsgHandlerCallback |
Remove MsgHandler callback.
(Inherited from XPRSprob.) |
|
RemoveMsgHandlerCallbacks |
Remove all MsgHandler callbacks.
(Inherited from XPRSprob.) |
|
RemoveMsJobEndCallback |
Remove MsJobEnd callback.
(Inherited from XPRSprob.) |
|
RemoveMsJobEndCallbacks |
Remove all MsJobEnd callbacks.
(Inherited from XPRSprob.) |
|
RemoveMsJobStartCallback |
Remove MsJobStart callback.
(Inherited from XPRSprob.) |
|
RemoveMsJobStartCallbacks |
Remove all MsJobStart callbacks.
(Inherited from XPRSprob.) |
|
RemoveMsWinnerCallback |
Remove MsWinner callback.
(Inherited from XPRSprob.) |
|
RemoveMsWinnerCallbacks |
Remove all MsWinner callbacks.
(Inherited from XPRSprob.) |
|
RemoveNewnodeCallback |
Remove Newnode callback.
(Inherited from XPRSprob.) |
|
RemoveNewnodeCallbacks |
Remove all Newnode callbacks.
(Inherited from XPRSprob.) |
|
RemoveNlpCoefEvalErrorCallback |
Remove NlpCoefEvalError callback.
(Inherited from XPRSprob.) |
|
RemoveNlpCoefEvalErrorCallbacks |
Remove all NlpCoefEvalError callbacks.
(Inherited from XPRSprob.) |
|
RemoveNodecutoffCallback |
Remove Nodecutoff callback.
(Inherited from XPRSprob.) |
|
RemoveNodecutoffCallbacks |
Remove all Nodecutoff callbacks.
(Inherited from XPRSprob.) |
|
RemoveNodeLPSolvedCallback |
Remove NodeLPSolved callback.
(Inherited from XPRSprob.) |
|
RemoveNodeLPSolvedCallbacks |
Remove all NodeLPSolved callbacks.
(Inherited from XPRSprob.) |
|
RemoveOptnodeCallback |
Remove Optnode callback.
(Inherited from XPRSprob.) |
|
RemoveOptnodeCallbacks |
Remove all Optnode callbacks.
(Inherited from XPRSprob.) |
|
RemovePreIntsolCallback |
Remove PreIntsol callback.
(Inherited from XPRSprob.) |
|
RemovePreIntsolCallbacks |
Remove all PreIntsol callbacks.
(Inherited from XPRSprob.) |
|
RemovePrenodeCallback |
Remove Prenode callback.
(Inherited from XPRSprob.) |
|
RemovePrenodeCallbacks |
Remove all Prenode callbacks.
(Inherited from XPRSprob.) |
|
RemovePresolveCallback |
Remove Presolve callback.
(Inherited from XPRSprob.) |
|
RemovePresolveCallbacks |
Remove all Presolve callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeEndCallback |
Remove SlpCascadeEnd callback.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeEndCallbacks |
Remove all SlpCascadeEnd callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeStartCallback |
Remove SlpCascadeStart callback.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeStartCallbacks |
Remove all SlpCascadeStart callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeVarCallback |
Remove SlpCascadeVar callback.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeVarCallbacks |
Remove all SlpCascadeVar callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeVarFailCallback |
Remove SlpCascadeVarFail callback.
(Inherited from XPRSprob.) |
|
RemoveSlpCascadeVarFailCallbacks |
Remove all SlpCascadeVarFail callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpConstructCallback |
Remove SlpConstruct callback.
(Inherited from XPRSprob.) |
|
RemoveSlpConstructCallbacks |
Remove all SlpConstruct callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpDrColCallback |
Remove SlpDrCol callback.
(Inherited from XPRSprob.) |
|
RemoveSlpDrColCallbacks |
Remove all SlpDrCol callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpIntSolCallback |
Remove SlpIntSol callback.
(Inherited from XPRSprob.) |
|
RemoveSlpIntSolCallbacks |
Remove all SlpIntSol callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpIterEndCallback |
Remove SlpIterEnd callback.
(Inherited from XPRSprob.) |
|
RemoveSlpIterEndCallbacks |
Remove all SlpIterEnd callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpIterStartCallback |
Remove SlpIterStart callback.
(Inherited from XPRSprob.) |
|
RemoveSlpIterStartCallbacks |
Remove all SlpIterStart callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpIterVarCallback |
Remove SlpIterVar callback.
(Inherited from XPRSprob.) |
|
RemoveSlpIterVarCallbacks |
Remove all SlpIterVar callbacks.
(Inherited from XPRSprob.) |
|
RemoveSlpPreUpdateLinearizationCallback |
Remove SlpPreUpdateLinearization callback.
(Inherited from XPRSprob.) |
|
RemoveSlpPreUpdateLinearizationCallbacks |
Remove all SlpPreUpdateLinearization callbacks.
(Inherited from XPRSprob.) |
|
RemoveUserSolNotifyCallback |
Remove UserSolNotify callback.
(Inherited from XPRSprob.) |
|
RemoveUserSolNotifyCallbacks |
Remove all UserSolNotify callbacks.
(Inherited from XPRSprob.) |
|
RepairInfeas(Char, Char, Char, Double, Double, Double, Double, Double) |
Convenience wrapper for
RepairInfeas(int,char,char,char,double,double,double,double,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
RepairInfeas(Int32, Char, Char, Char, Double, Double, Double, Double, Double) |
Provides a simplified interface for
repairWeightedInfeas.
(Inherited from XPRSprob.) |
|
RepairWeightedInfeas(Double, Double, Double, Double, Char, Double, String) |
Convenience wrapper for
RepairWeightedInfeas(int,double[],double[],double[],double[],char,double,string) that returns the output argument.
(Inherited from XPRSprob.) |
|
RepairWeightedInfeas(IDictionary<Inequality, Double>, IDictionary<Inequality, Double>, IDictionary<Variable, Double>, IDictionary<Variable, Double>, Char, Double, String) |
Repair infeasibilities using weights. By relaxing a set of selected constraints and bounds of an infeasible problem, it attempts to identify a 'solution' that violates the selected set of constraints and bounds minimally, while satisfying all other constraints and bounds. Among such solution candidates, it selects one that is optimal regarding the original objective function.
|
|
RepairWeightedInfeas(Int32, Double, Double, Double, Double, Char, Double, String) |
By relaxing a set of selected constraints and bounds of an infeasible problem, it attempts to identify a 'solution' that violates the selected set of constraints and bounds minimally, while satisfying all other constraints and bounds. Among such solution candidates, it selects one that is optimal regarding the original objective function. For the console version, see
REPAIRINFEAS.
(Inherited from XPRSprob.) |
|
RepairWeightedInfeasBounds(Double, Double, Double, Double, Double, Double, Double, Double, Char, Double, String) |
Convenience wrapper for
RepairWeightedInfeasBounds(int,double[],double[],double[],double[],double[],double[],double[],double[],char,double,string) that returns the output argument.
(Inherited from XPRSprob.) |
|
RepairWeightedInfeasBounds(Int32, Double, Double, Double, Double, Double, Double, Double, Double, Char, Double, String) |
An extended version of
repairWeightedInfeas that allows for bounding the level of relaxation allowed.
(Inherited from XPRSprob.) |
|
Restore() |
Restores the Optimizer's data structures from a file created by
save (
SAVE). Optimization may then recommence from the point at which the file was created.
(Inherited from XPRSprob.) |
|
Restore(String) |
Restores the Optimizer's data structures from a file created by
save (
SAVE). Optimization may then recommence from the point at which the file was created.
(Inherited from XPRSprob.) |
|
Restore(String, String) |
Restores the Optimizer's data structures from a file created by
save (
SAVE). Optimization may then recommence from the point at which the file was created.
(Inherited from XPRSprob.) |
|
RHSsa(Inequality, Double, Double) |
Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients. If the RHS coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.
|
|
RHSsa(Int32, Int32, Double, Double) |
Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients. If the RHS coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.
(Inherited from XPRSprob.) |
|
RHSsa(Int32, Inequality, Double, Double) |
Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients. If the RHS coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.
|
|
RowTypeToArray |
Convert a column type array to an array of low-level type indicators.
(Inherited from XPRSprob.) |
|
Save |
Saves the current data structures, i.e. matrices, control settings and problem attribute settings to file and terminates the run so that optimization can be resumed later.
(Inherited from XPRSprob.) |
|
SaveAs |
Saves the current data structures, i.e. matrices, control settings and problem attribute settings to file and terminates the run so that optimization can be resumed later.
(Inherited from XPRSprob.) |
|
Scale |
Re-scales the current matrix.
(Inherited from XPRSprob.) |
|
SetDblControl |
Sets the value of a given double control parameter.
(Inherited from XPRSprob.) |
|
SetDefaultControl |
Set a default control value.
(Inherited from XPRSprob.) |
|
SetDefaults |
Sets all controls to their default values. Must be called before the problem is read or loaded by
readProb,
loadMIP,
loadLP,
loadMIQP,
loadQP.
(Inherited from XPRSprob.) |
|
SetIndicator(Int32, Int32, Int32) |
Add a single indicator constraint.
(Inherited from XPRSprob.) |
|
SetIndicator(Variable, Boolean, Inequality) |
Add an indicator constraint to this model. Both variable and row must exist.
|
|
SetIndicators(Variable, Boolean, Inequality) |
Add indicator constraints to this model. The provided arrays must all have length at least
count and for any
i in 0..
count-1 an indicator constraint is constructed from
indicatorVariable[i],
indicatorValue[i] and
row[i]. If
indicatorValue[i] is
true then the constraints states that if
indicatorVariable[i] is 1 (one), then
row[i] must be Satisfied (and if
indicator is 0 (zero) then
row[i] is ignored). Otherwise,
row[i] must be satisfied if
indicator[i] is 0 (zero) and is ignored otherwise. All referenced variables and rows must exist.
|
|
SetIndicators(Int32, Int32, Int32, Int32) |
Specifies that a set of rows in the matrix will be treated as indicator constraints during a tree search. An indicator constraint is made of a
condition and a
constraint. The
condition is of the type "bin = value", where
bin is a binary variable and
value is either 0 or 1. The
constraint is any matrix row (may be linear, quadratic or general nonlinear). During tree search, a row configured as an indicator constraint is enforced only when condition holds, that is only if the indicator variable
bin has the specified value. Note that every row may only get assigned a single indicator variable and term. If a row needs to be activated by multiple different terms, the row needs to be duplicated so that each term can be assigned to a distinct row. If the indicator variable should be changed, the old term needs to be deleted first (by calling
delIndicators or by calling this function with a comps argument of 0) before assigning a new one.
(Inherited from XPRSprob.) |
|
SetIndicators(Int32, Func<Int32, Variable>, Func<Int32, Boolean>, Func<Int32, Inequality>) |
Add indicator constraints to this model. The function iterates through
[0, ... ,count[ and calls the provided functions for each in this interval. The return values of the functions are used to construct an indicator constraint. For a fixed
t, if
IndicatorValue(t) returns
true then the created constraint states that if
IndicatorVariable(t) is 1 (one), then
Row(t) must be satisfied and is ignored otherwise. Otherwise,
Row(t) must be satisfied if
IndicatorVariable(t) is 0 (zero) and is ignored otherwise. All referenced variables and rows must exist.
|
|
SetIndicators<T>(ICollection<T>, Func<T, Variable>, Func<T, Boolean>, Func<T, Inequality>) |
Add indicator constraints to this model. The function iterates through
data and calls the provided functions for each element found. The return values of the functions are used to construct an indicator constraint. For a fixed
t, if
IndicatorValue(t) returns
true then the created constraint states that if
IndicatorVariable(t) is 1 (one), then
Row(t) must be satisfied and is ignored otherwise. Otherwise,
Row(t) must be satisfied if
IndicatorVariable(t) is 0 (zero) and is ignored otherwise. All referenced variables and rows must exist.
|
|
SetIndicators<T>(IEnumerable<T>, Func<T, Variable>, Func<T, Boolean>, Func<T, Inequality>) |
Add indicator constraints to this model. The function iterates through
data and calls the provided functions for each element found. The return values of the functions are used to construct an indicator constraint. For a fixed
t, if
IndicatorValue(t) returns
true then the created constraint states that if
IndicatorVariable(t) is 1 (one), then
Row(t) must be satisfied and is ignored otherwise. Otherwise,
Row(t) must be satisfied if
IndicatorVariable(t) is 0 (zero) and is ignored otherwise. All referenced variables and rows must exist.
|
|
SetIndicators<T>(T, Func<T, Variable>, Func<T, Boolean>, Func<T, Inequality>) |
Add indicator constraints to this model. The function iterates through
data and calls the provided functions for each element found. The return values of the functions are used to construct an indicator constraint. For a fixed
t, if
IndicatorValue(t) returns
true then the created constraint states that if
IndicatorVariable(t) is 1 (one), then
Row(t) must be satisfied and is ignored otherwise. Otherwise,
Row(t) must be satisfied if
IndicatorVariable(t) is 0 (zero) and is ignored otherwise. All referenced variables and rows must exist.
|
|
SetIntControl |
Sets the value of a given integer control parameter.
(Inherited from XPRSprob.) |
|
SetLogFile |
This directs all Optimizer output to a log file.
(Inherited from XPRSprob.) |
|
SetLongControl |
Sets the value of a given integer control parameter.
(Inherited from XPRSprob.) |
|
SetMessageStatus |
Manages suppression of messages.
(Inherited from XPRSprob.) |
|
SetObjDblControl |
Sets the value of a given double control parameter associated with an objective. These parameters control how the objective is treated during multi-objective optimization.
(Inherited from XPRSprob.) |
|
SetObjective(Expression) |
Set the objective function to a new expression.
|
|
SetObjective(Int32, Double) |
Set objective to a linear function. Any previously set objective will be cleared.
(Inherited from XPRSprob.) |
|
SetObjective(Expression, ObjSense) |
Set the objective function to a new expression.
|
|
SetObjective(Int32, Double, ObjSense) |
Set objective to a linear function. Any previously set objective will be cleared.
(Inherited from XPRSprob.) |
|
SetObjective(Int32, Expression, Int32, Double, Double, Double) |
Set an objective function and its controls. In case of error: - if the function created new objectives then all newly created objectives will be removed, - if an existing objective was modified then that objective function will be cleared and all controls will be unchanged.
|
|
SetObjIntControl |
Sets the value of a given integer control parameter associated with an objective. These parameters control how the objective is treated during multi-objective optimization.
(Inherited from XPRSprob.) |
|
SetProbName |
Sets the current default problem name. This command is rarely used.
(Inherited from XPRSprob.) |
|
SetStrControl |
Used to set the value of a given string control parameter.
(Inherited from XPRSprob.) |
|
SlpAddCoefs |
Add non-linear coefficients to the SLP problem. For a simpler version of this function see
XSLPaddformulas.
(Inherited from XPRSprob.) |
|
SlpCascadeOrder |
Establish a re-calculation sequence for SLP variables with determining rows.
(Inherited from XPRSprob.) |
|
SlpCascadeSol |
Re-calculate consistent values for SLP variables based on the current values of the remaining variables.
(Inherited from XPRSprob.) |
|
SlpChgCascadeNLimit |
Set a variable specific cascade iteration limit
(Inherited from XPRSprob.) |
|
SlpChgCCoef | Obsolete.
Add or change a single matrix coefficient using a character string for the formula. For a simpler version of this function see
nlpChgFormulaStr.
(Inherited from XPRSprob.) |
|
SlpChgCoef |
Add or change a single matrix coefficient using a parsed or unparsed formula. For a simpler version of this function see
XSLPchgformula.
(Inherited from XPRSprob.) |
|
SlpChgCoefStr |
Add or change a single matrix coefficient using a character string for the formula. For a simpler version of this function see
nlpChgFormulaStr.
(Inherited from XPRSprob.) |
|
SlpChgDeltaType |
Changes the type of the delta assigned to a nonlinear variable
(Inherited from XPRSprob.) |
|
SlpChgRowStatus(Int32) |
Convenience wrapper for
SlpChgRowStatus(int,int) that returns the output argument.
(Inherited from XPRSprob.) |
|
SlpChgRowStatus(Int32, Int32) |
Change the status setting of a constraint
(Inherited from XPRSprob.) |
|
SlpChgRowWt |
Set or change the initial penalty error weight for a row
(Inherited from XPRSprob.) |
|
SlpConstruct |
Create the full augmented SLP matrix and data structures, ready for optimization
(Inherited from XPRSprob.) |
|
SlpDelCoefs(Int32, Int32) |
Convenience wrapper for
SlpDelCoefs(int, int[], int[]).
(Inherited from XPRSprob.) |
|
SlpDelCoefs(Int32, Int32, Int32) |
Delete coefficients from the current problem. For a simpler version of this function see
XSLPdelformulas.
(Inherited from XPRSprob.) |
|
SlpEvaluateCoef(Int32, Int32) |
Convenience wrapper for
SlpEvaluateCoef(int,int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
SlpEvaluateCoef(Int32, Int32, Double) |
Evaluate a coefficient using the current values of the variables
(Inherited from XPRSprob.) |
|
SlpFixPenalties |
Fixe the values of the error vectors
(Inherited from XPRSprob.) |
|
SlpGetCCoef | Obsolete.
Retrieve a single matrix coefficient as a formula in a character string. For a simpler version of this function see
nlpGetFormulaStr.
(Inherited from XPRSprob.) |
|
SlpGetCoefFormula |
Retrieve a single matrix coefficient as a formula split into tokens. For a simpler version of this function see
XSLPchgformula.
(Inherited from XPRSprob.) |
|
SlpGetCoefs |
Retrieve the list of positions of the nonlinear coefficients in the problem. For a simpler version of this function see
XSLPgetformularows.
(Inherited from XPRSprob.) |
|
SlpGetCoefStr |
Retrieve a single matrix coefficient as a formula in a character string. For a simpler version of this function see
nlpGetFormulaStr.
(Inherited from XPRSprob.) |
|
SlpGetRowStatus |
Retrieve the status setting of a constraint
(Inherited from XPRSprob.) |
|
SlpGetRowWT(Int32) |
Convenience wrapper for
SlpGetRowWT(int,double) that returns the output argument.
(Inherited from XPRSprob.) |
|
SlpGetRowWT(Int32, Double) |
Get the initial penalty error weight for a row
(Inherited from XPRSprob.) |
|
SlpLoadCoefs |
Load non-linear coefficients into the SLP problem. For a simpler version of this function see
XSLPloadformulas.
(Inherited from XPRSprob.) |
|
SlpReInitialize |
Reset the SLP problem to match a just augmented system
(Inherited from XPRSprob.) |
|
SlpSetDetRow(Int32, Int32) |
Convenience wrapper for
SlpSetDetRow(int, int[], int[]).
(Inherited from XPRSprob.) |
|
SlpSetDetRow(Variable, Inequality) |
Set the determining row of a variable.
|
|
SlpSetDetRow(Int32, Int32, Int32) |
Set the determining row of a variable
(Inherited from XPRSprob.) |
|
SlpUnConstruct |
Removes the augmentation and returns the problem to its pre-linearization state
(Inherited from XPRSprob.) |
|
SlpUpdateLinearization |
Updates the current linearization
(Inherited from XPRSprob.) |
|
SosForIndex |
Map an SOS index to an SOS object.
|
|
SosForIndices |
Map a range of SOS indices to SOS objects.
|
|
SparseBTran |
Post-multiplies a (row) vector provided by the user by the inverse of the current matrix. Sparse version of
bTran.
(Inherited from XPRSprob.) |
|
SparseFTran |
Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix. Sparse version of
fTran.
(Inherited from XPRSprob.) |
|
StoreCuts(Int32, Int32, Int32, Char, Double, Int32, Cut, Int32, Double) |
Stores cuts into the cut pool, but does not apply them to the current node. These cuts must be explicitly loaded into the matrix using
loadCuts before they become active.
(Inherited from XPRSprob.) |
|
StoreCuts(Int32, Int32, Int32, Char, Double, Int64, Cut, Int32, Double) |
Stores cuts into the cut pool, but does not apply them to the current node. These cuts must be explicitly loaded into the matrix using
loadCuts before they become active.
(Inherited from XPRSprob.) |
|
StrongBranch |
Performs strong branching iterations on all specified bound changes. For each candidate bound change,
strongBranch performs dual simplex iterations starting from the current optimal solution of the base LP, and returns both the status and objective value reached after these iterations.
(Inherited from XPRSprob.) |
|
StrongBranchCB |
Performs strong branching iterations on all specified bound changes. For each candidate bound change,
strongBranchCB performs dual simplex iterations starting from the current optimal solution of the base LP, and returns both the status and objective value reached after these iterations.
(Inherited from XPRSprob.) |
|
ToString | (Inherited from Object.) |
|
Tune |
This function begins a tuner session for the current problem. The tuner will solve the problem multiple times while evaluating a list of control settings and promising combinations of them. When finished, the tuner will select and set the best control setting on the problem. Note that the direction of optimization is given by
OBJSENSE.
(Inherited from XPRSprob.) |
|
TuneProbSetFile |
This function begins a tuner session for a set of problems. The tuner will solve the problems multiple times while evaluating a list of control settings and promising combinations of them. When finished, the tuner will select and set the best control setting on the problems.
(Inherited from XPRSprob.) |
|
TunerReadMethod |
This function loads a user defined tuner method from the given file.
(Inherited from XPRSprob.) |
|
TunerWriteMethod |
This function writes the current tuner method to a given file or prints it to the console.
(Inherited from XPRSprob.) |
|
UnloadProb |
Unloads and frees all memory associated with the current problem. It also invalidates the current problem (as opposed to reading in an empty problem).
(Inherited from XPRSprob.) |
|
VarArray(Char, Int32, Double, Double, Func<Int32, String>) |
Create an array of variables with the same type. All the variables created by this function have the same types and bounds.
(Inherited from XPRSprob.) |
|
VarArray(Char, Int32, Double, Double, String) |
Create an array of variables with the same type.
(Inherited from XPRSprob.) |
|
VarArray(Char, Int32, Func<Int32, Double>, Func<Int32, Double>, Func<Int32, String>) |
Create an array of variables with the same type.
(Inherited from XPRSprob.) |
|
VarArray<T>(Char, ICollection<T>, Double, Double, Func<T, String>) |
Create an array of variables with the same type. All the variables created by this function have the same types and bounds. The function will create one variable for each of the objects listed in
objs.
(Inherited from XPRSprob.) |
|
VarArray<T>(Char, ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>) |
Create an array of variables with the same type. The function will create one variable for each of the objects listed in
objs.
(Inherited from XPRSprob.) |
|
VariableForIndex |
Map a variable index to a variable object.
|
|
VariablesForIndices |
Map a range of variable indices to variable objects.
|
|
VarMap<T>(Char, ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>) |
Create a map of variables that all have the same type. The function creates a new variable for each object in
objs. It returns a hash map in which each object in
objs maps to the index of the variable that was created for it.
(Inherited from XPRSprob.) |
|
VarMap<T>(Char, ICollection<T>, Func<T, Double>, Func<T, Double>, Func<T, String>, IDictionary<T, Int32>) |
Create a map of variables that all have the same type. The function creates a new variable for each object in
objs. For each object o it puts the Pair (o, idx) into
map where idx is the index of the variable that was created for o.
(Inherited from XPRSprob.) |
|
WriteBasis() |
Writes the current basis to a file for later input into the Optimizer.
(Inherited from XPRSprob.) |
|
WriteBasis(String) |
Writes the current basis to a file for later input into the Optimizer.
(Inherited from XPRSprob.) |
|
WriteBasis(String, String) |
Writes the current basis to a file for later input into the Optimizer.
(Inherited from XPRSprob.) |
|
WriteBinSol() |
Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.
(Inherited from XPRSprob.) |
|
WriteBinSol(String) |
Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.
(Inherited from XPRSprob.) |
|
WriteBinSol(String, String) |
Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.
(Inherited from XPRSprob.) |
|
WriteDirs() |
Writes the tree search directives from the current problem to a directives file.
(Inherited from XPRSprob.) |
|
WriteDirs(String) |
Writes the tree search directives from the current problem to a directives file.
(Inherited from XPRSprob.) |
|
WriteIIS(Int32, String, Int32) |
Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS). If 0 is passed as the IIS number parameter, the initial infeasible subproblem is written.
(Inherited from XPRSprob.) |
|
WriteIIS(Int32, String, Int32, String) |
Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS). If 0 is passed as the IIS number parameter, the initial infeasible subproblem is written.
(Inherited from XPRSprob.) |
|
WriteProb() |
Writes the current problem to an MPS or LP file.
(Inherited from XPRSprob.) |
|
WriteProb(String) |
Writes the current problem to an MPS or LP file.
(Inherited from XPRSprob.) |
|
WriteProb(String, String) |
Writes the current problem to an MPS or LP file.
(Inherited from XPRSprob.) |
|
WritePrtSol() |
Writes the current solution to a fixed format ASCII file,
problem_name
.prt.
(Inherited from XPRSprob.) |
|
WritePrtSol(String) |
Writes the current solution to a fixed format ASCII file,
problem_name
.prt.
(Inherited from XPRSprob.) |
|
WritePrtSol(String, String) |
Writes the current solution to a fixed format ASCII file,
problem_name
.prt.
(Inherited from XPRSprob.) |
|
WriteSlxSol() |
Creates an ASCII solution file (
.slx) using a similar format to MPS files. These files can be read back into the Optimizer using the
readSlxSol function.
(Inherited from XPRSprob.) |
|
WriteSlxSol(String) |
Creates an ASCII solution file (
.slx) using a similar format to MPS files. These files can be read back into the Optimizer using the
readSlxSol function.
(Inherited from XPRSprob.) |
|
WriteSlxSol(String, String) |
Creates an ASCII solution file (
.slx) using a similar format to MPS files. These files can be read back into the Optimizer using the
readSlxSol function.
(Inherited from XPRSprob.) |
|
WriteSol() |
Writes the current solution to a CSV format ASCII file,
problem_name
.asc (and
.hdr).
(Inherited from XPRSprob.) |
|
WriteSol(String) |
Writes the current solution to a CSV format ASCII file,
problem_name
.asc (and
.hdr).
(Inherited from XPRSprob.) |
|
WriteSol(String, String) |
Writes the current solution to a CSV format ASCII file,
problem_name
.asc (and
.hdr).
(Inherited from XPRSprob.) |
Fields
| Name | Description | |
|---|---|---|
 |
callbacks |
Property through which callbacks for this instance can be accessed.
|
|
NULL_VARIABLE |
Variable object that is used to indicate a constant term in expressions that are implemented as maps.
|
See Also
Reference
© 2001-2024 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.