gamspy-xpress 52.1.0__py3-none-win_amd64.whl → 52.2.0__py3-none-win_amd64.whl

gamspy_xpress/optxpress.def

@@ -26,6 +26,7 @@ scaling integer 8010000 163 minint maxint 1 4 Bit-vector control determines how
  bit 14 = 16384 Equivalent to \ref XPRESSscaling_noAggressiveQScaling "scaling_noAggressiveQScaling".
  bit 15 = 32768 Equivalent to \ref XPRESSscaling_slackScaling "scaling_slackScaling".
 solnpool string 0 "" 1 12 Solution pool file name
+Tuner boolean 0 0 1 27 Enables tuner
 advBasis enumint 0 1 1 1 Use advanced basis provided by GAMS
  0 1 Do not load basis
  1 1 Load basis if suitable (decided by solver link)
@@ -167,6 +168,19 @@ multiObjLog enumint 8458000 2 1 1 Log level for multi-objective optimization
  0 1 No logging.
  1 1 Print a summary of each problem that is solved as part of the multi-objective optimization.
  2 1 In addition to summaries, print messages produced by each solve at the level determined by \ref XPRESSoutputLog "outputLog".
+cpiAlpha double 7149000 0 mindouble maxdouble 1 1 Decay term for confined primal integral computation
+maxPageLines integer 8034000 23 0 maxint 1 1 Number of lines between page breaks in printable output
+mps18Compatible integer 8223000 0 0 maxint 1 1 Provides compatibility of MPS file output for older MPS readers
+ Bit 0 Do not write objective sense (OBJSENSE section).
+ Bit 1 Fixed binaries are written as fixed only (unless used as a base variable for an indicator constraint).
+forceOutput enumint 8229000 0 1 1 Certain names in the problem object may be incompatible with different file formats (such as names containing spaces for LP files)
+ 0 1 Check format compatibility, and in case of failure try to extend names so that they are reproducible and recognizable.
+ 1 1 Force output using problem names as is.
+ 2 1 Always use ′x(′ original name ′)′ in LP files to create a representation that can be read by Xpress. Default for problem having spaces in names
+ 3 1 Substitute spaces by the ′_′ character in LP files
+escapeNames boolean 8440000 1 1 1 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
+ 0 Illegal characters are not escaped.
+ 1 Illegal characters are escaped.
 barCores integer 8202000 -1 -1 maxint 1 2 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
 barOrderThreads integer 8187000 0 0 maxint 1 2 If set to a positive integer it determines the number of concurrent threads for the sparse matrix ordering algorithm in the Newton-barrier method
 barThreads integer 8053000 -1 -1 maxint 1 2 If set to a positive integer it determines the number of threads implemented to run the Newton-barrier and hybrid gradient algorithms
@@ -388,6 +402,21 @@ preFolding enumint 8410000 -1 1 3 Presolve: Determines if a folding procedure sh
  -1 1 Automatically determined.
  0 1 Disabled.
  1 1 Enabled.
+preSort integer 8107000 0 0 maxint 1 3 Bit-vector control specifies whether to sort rows, columns and MIP entities by their names when starting the presolve
+ bit 0 = 1 Equivalent to \ref XPRESSpreSort_rows "preSort_rows".
+ bit 1 = 2 Equivalent to \ref XPRESSpreSort_cols "preSort_cols".
+ bit 2 = 4 Equivalent to \ref XPRESSpreSort_mip "preSort_mip".
+preSort_rows boolean 8107001 0 1 3 Sort rows
+preSort_cols boolean 8107002 0 1 3 Sort columns
+preSort_mip boolean 8107003 0 1 3 Sort MIP entities
+prePermute integer 8108000 0 0 maxint 1 3 Bit-vector control specifies whether to randomly permute rows, columns and MIP entities when starting the presolve
+ bit 0 = 1 Equivalent to \ref XPRESSprePermute_rows "prePermute_rows".
+ bit 1 = 2 Equivalent to \ref XPRESSprePermute_cols "prePermute_cols".
+ bit 2 = 4 Equivalent to \ref XPRESSprePermute_mip "prePermute_mip".
+prePermute_rows boolean 8108001 0 1 3 Permute rows
+prePermute_cols boolean 8108002 0 1 3 Permute columns
+prePermute_mip boolean 8108003 0 1 3 Permute MIP entities
+prePermuteSeed integer 8109000 1 minint maxint 1 3 Sets the seed for the pseudo-random number generator for permuting the problem when starting the presolve
 autoScaling enumint 8406000 -1 1 4 Whether the Optimizer should automatically select between different scaling algorithms
  -1 1 Automatic.
  0 1 Disabled.
@@ -736,6 +765,26 @@ mipConcurrentSolves integer 8423000 0 -1 maxint 1 9 Selects the number of concur
 maxStallTime double 8443000 0 0 maxdouble 1 9 Maximum time in seconds that the Optimizer will continue to search for improving solution after finding a new incumbent
  0 No stall time limit.
  >0 If an integer solution has been found, stop MIP search after the given number of seconds without a new incumbent. No effect as long as no solution was found.
+refactor enumint 8052000 -1 1 9 Indicates whether the optimization should restart using the current representation of the factorization in memory
+ -1 1 Automatic.
+ 0 1 Do not refactor on reoptimizing.
+ 1 1 Refactor on reoptimizing.
+treeDiagnostics integer 8244000 7 0 maxint 1 9 Bit-vector providing control over how various tree-management-related messages get printed in the tree log file during the branch-and-bound search
+ bit 0 = 1 Equivalent to \ref XPRESStreeDiagnostics_memoryUsageSummaries "treeDiagnostics_memoryUsageSummaries".
+ bit 1 = 2 Equivalent to \ref XPRESStreeDiagnostics_memorySavedReports "treeDiagnostics_memorySavedReports".
+ bit 2 = 4 Equivalent to \ref XPRESStreeDiagnostics_memorySavedReportsInterval "treeDiagnostics_memorySavedReportsInterval".
+treeDiagnostics_memoryUsageSummaries boolean 8244001 1 1 9 Output regular summaries of current tree memory usage
+treeDiagnostics_memorySavedReports boolean 8244002 1 1 9 Output messages whenever tree data is being written to tree file
+treeDiagnostics_memorySavedReportsInterval boolean 8244003 1 1 9 Output progress messages while tree data is being written to the tree file, at an interval controlled by the \ref XPRESStreeFileLogInterval "treeFileLogInterval" control
+alternativeRedCosts enumint 8478000 -1 1 9 Controls aggressiveness of searching for alternative reduced cost
+ -1 1 The solver decides if searching for alternative reduced cost is beneficial or not. This is the default setting.
+ 0 1 Searching for alternative reduced cost is disabled.
+ 1 1 Searching for alternative reduced cost is enabled.
+treeFileLogInterval integer 8389000 60 0 maxint 1 9 Sets the interval between progress messages output while writing tree data to the tree file, in seconds
+maxTreeFileSize integer 8245000 0 0 maxint 1 9 Maximum size, in megabytes, to which the tree file may grow, or 0 for no limit
+mipTerminationMethod boolean 8348000 0 0 9 Branch and Bound: How a MIP solve should be stopped on early termination when there are still active tasks in the system
+ 0 Terminate tasks at the earliest opportunity. This can result in some unfinished node solves being discarded, although never integer solutions.
+ 1 Allow tasks to complete their current work but prevent new tasks from being started.
 conflictCuts enumint 8292000 -1 1 10 Branch and Bound: Specifies how cautious or aggressive the optimizer should be when searching for and applying conflict cuts
  -1 1 Automatic.
  0 1 Disable conflict cuts.
@@ -833,6 +882,10 @@ sdpCutStrategy enumint 8497000 -1 1 10 Level of SDP cutting planes separation: H
  1 1 Conservative separation of SDP cuts.
  2 1 Moderate separation of SDP cuts.
  3 1 Aggressive separation of SDP cuts.
+rltCuts enumint 8476000 -1 1 10 Determines whether RLT cuts should be separated in the Xpress Global Solver
+ -1 1 The solver decides if RLT cuts are beneficial or not. This is the default setting.
+ 0 1 RLT cuts are disabled.
+ 1 1 RLT cuts are separated.
 heurBeforeLp enumint 8280000 -1 1 11 Branch and Bound: Determines whether primal heuristics should be run before the initial LP relaxation has been solved
  -1 1 Automatic - let the optimizer decide if heuristics should be run.
  0 1 Disabled.
@@ -913,6 +966,12 @@ preRootWorklimit double 7172000 -1 -1 maxdouble 1 11 Set an explicit work limit
  -1 No explicit work limit for the Pre-root parallel heuristic phase. If enabled, the work limit for this phase is controlled via \ref XPRESSpreRootEffort "preRootEffort".
  0 Disable Pre-root parallel heuristics.
  x>0 Enable Pre-root parallel heuristics with an explicit work limit of x work units. If set, this work limit has precedence over any work limit set by \ref XPRESSpreRootEffort "preRootEffort".
+userSolHeuristic enumint 8258000 -1 1 11 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
+ -1 1 Automatically determined.
+ 0 1 Search heuristic disabled.
+ 1 1 Light effort.
+ 2 1 Moderate effort.
+ 3 1 High effort.
 solnpoolCullDiversity integer 6602000 -1 -1 maxint 1 12 Cull N solutions based on solution diversity
 solnpoolCullObj integer 6601000 -1 -1 maxint 1 12 Cull N solutions based on objective values
 solnpoolDupPolicy enumint 6203000 0 1 12 Policy to use when handling storage of duplicate solutions
@@ -1006,6 +1065,8 @@ barIterative integer 8492000 -2 -2 maxint 1 7 Maximum number of barrier iteratio
  -1 Turn iterative solver off.
  0 Use iterative solver for the starting point computation.
  n>0 Try to apply iterative solver for the first n barrier iterations.
+barStartWeight double 7076000 0.85 mindouble maxdouble 1 7 Newton barrier: Sets a weight for the warm-start point when warm-start is set for the barrier algorithm
+barLargeBound double 7067000 0 0 maxdouble 1 7 Threshold for the barrier to handle large bounds
 globalNumInitNLPCuts integer 8449000 -1 -1 maxint 1 8 Specifies the maximum number of tangent cuts when setting up the initial relaxation during a global solve
 globalLSHeurStrategy enumint 8464000 -1 1 8 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 can be called on t****
  -1 1 Automatic selection of the strategy.
@@ -1025,6 +1086,19 @@ globalPresolveOBBT enumint 8494000 -1 1 8 Controls the amount of work performed
  1 1 OBBT is run for a small subset of the variables, approximately equal to the square root of the number of total variables used in the solve, i.e., original and auxiliary.
  2 1 OBBT is run on a larger portion of the variables while keeping the computational effort limited w.r.t. the whole global solve.
  3 1 OBBT is run on all variables. This is most computationally taxing as a large number of LPs will be solved.
+globalSpatialBranchPropagationEffort double 7152000 -1 -1 maxdouble 1 8 Limits the effort that is spent on propagation during spatial branching
+ -1 The algorithm chooses the effort limit automatically (default).
+ 0 Disables propagation on branching entities.
+ n>0 Relative effort to spend on propagating on branching entities. Higher values lead to more propagation.
+globalSpatialBranchCuttingEffort double 7153000 -1 -1 1 1 8 Limits the effort that is spent on creating cuts during spatial branching
+ -1 The algorithm chooses the effort limit automatically (default).
+ 0 Disables cuts on branching entities.
+ 0<n<1 Relative effort to spend on cutting on branching entities. Higher values lead to more cuts.
+globalSpatialBranchIfPreferOrig enumint 8465000 -1 1 8 Whether spatial branchings on original variables should be preferred over branching on auxiliary variables that were introduced by the reformulation of the global solver
+ -1 1 Automatically determined.
+ 0 1 Always consider both original and auxiliary variables.
+ 1 1 Always prefer branching on original variables over auxiliaries.
+ 2 1 Always prefer branching on auxiliary variables over originals.
 xslp_algorithm integer 12301000 166 minint maxint 1 13 Bit map describing the SLP algorithm(s) to be used
  bit 0 = 1 Equivalent to \ref XPRESSxslp_algorithm_noStepBounds "xslp_algorithm_noStepBounds".
  bit 1 = 2 Equivalent to \ref XPRESSxslp_algorithm_stepBoundsAsRequired "xslp_algorithm_stepBoundsAsRequired".
@@ -1095,6 +1169,44 @@ xslp_solver enumint 12352000 -1 1 13 Selects the library to use for local solves
 xslp_threads integer 12406000 -1 -1 maxint 1 13 Default number of threads to be used
 xslp_zero double 12123000 1e-15 0 maxdouble 1 13 Absolute tolerance
 xslp_primalIntegralAlpha double 12176000 0 0 maxdouble 1 13 Decay term for primal integral computation
+xslp_objThreshold double 12213000 1e+15 mindouble maxdouble 1 13 Assumed maximum value of the objective function in absolute value
+xslp_cascadeTol_PA double 12142000 0.01 0 maxdouble 1 13 Absolute cascading print tolerance
+xslp_cascadeTol_PR double 12143000 0.01 0 maxdouble 1 13 Relative cascading print tolerance
+xslp_defaultIV double 12145000 100 0 maxdouble 1 13 Default initial value for an SLP variable if none is explicitly given
+xslp_memoryFactor double 12164000 1.6 1 maxdouble 1 13 Factor for expanding size of dynamic arrays in memory
+xslp_dRFixRange double 12195000 0.1 0 maxdouble 1 13 Range around the previous value where variables are fixed in cascading if the determining column is below \ref XPRESSxslp_dRColTol "xslp_dRColTol"
+xslp_dRColDJTol double 12208000 0 0 maxdouble 1 13 Reduced cost tolerance on the delta variable when fixing due to the determining column being below \ref XPRESSxslp_dRColTol "xslp_dRColTol"
+xslp_dRColTol double 12196000 1e-06 0 maxdouble 1 13 Minimum absolute magnitude of a determining column, for which the determined variable is still regarded as well defined
+xslp_cascade integer 12304000 257 0 maxint 1 13 Bit map describing the cascading to be used
+ bit 0 = 1 Equivalent to \ref XPRESSxslp_cascade_all "xslp_cascade_all".
+ bit 1 = 2 Equivalent to \ref XPRESSxslp_cascade_coefVar "xslp_cascade_coefVar".
+ bit 2 = 4 Equivalent to \ref XPRESSxslp_cascade_allCoefVar "xslp_cascade_allCoefVar".
+ bit 3 = 8 Equivalent to \ref XPRESSxslp_cascade_structVar "xslp_cascade_structVar".
+ bit 4 = 16 Equivalent to \ref XPRESSxslp_cascade_allStructVar "xslp_cascade_allStructVar".
+ bit 5 = 32 Equivalent to \ref XPRESSxslp_cascade_secondaryGroups "xslp_cascade_secondaryGroups".
+ bit 6 = 64 Equivalent to \ref XPRESSxslp_cascade_dRColPreviousValue "xslp_cascade_dRColPreviousValue".
+ bit 7 = 128 Equivalent to \ref XPRESSxslp_cascade_dRColPVRange "xslp_cascade_dRColPVRange".
+ bit 8 = 256 Equivalent to \ref XPRESSxslp_cascade_autoApply "xslp_cascade_autoApply".
+xslp_cascade_all boolean 12304001 1 1 13 Apply cascading to all variables with determining rows
+xslp_cascade_coefVar boolean 12304002 0 1 13 Apply cascading to SLP variables which appear in coefficients and which would change by more than XPRS_FEASTOL
+xslp_cascade_allCoefVar boolean 12304003 0 1 13 Apply cascading to all SLP variables which appear in coefficients
+xslp_cascade_structVar boolean 12304004 0 1 13 Apply cascading to SLP variables which are structural and which would change by more than XPRS_FEASTOL
+xslp_cascade_allStructVar boolean 12304005 0 1 13 Apply cascading to all SLP variables which are structural
+xslp_cascade_secondaryGroups boolean 12304006 0 1 13 Create secondary order groupping DR rows with instantiated user functions together in the order
+xslp_cascade_dRColPreviousValue boolean 12304007 0 1 13 In cases where the determining column is below \ref XPRESSxslp_dRColTol "xslp_dRColTol", fix at the previous rather than current value
+xslp_cascade_dRColPVRange boolean 12304008 0 1 13 In cases where the determining column is below \ref XPRESSxslp_dRColTol "xslp_dRColTol", fix within a range \ref XPRESSxslp_dRFixRange "xslp_dRFixRange" of previous value
+xslp_cascade_autoApply boolean 12304009 1 1 13 Automatically determine whether to apply cascading
+xslp_cascadeNLimit integer 12306000 10 0 maxint 1 13 Maximum number of iterations for cascading with non-linear determining rows
+xslp_delayUpdateRows integer 12329000 2 0 maxint 1 13 Number of SLP iterations before update rows are fully activated
+xslp_deterministic boolean 12399000 1 1 13 Determines if the parallel features of SLP should be guaranteed to be deterministic
+xslp_gridHeurSelect integer 12412000 6 0 maxint 1 13 Bit map selectin which heuristics to run if the problem has variable with an integer delta
+ bit 0 = 1 Equivalent to \ref XPRESSxslp_gridHeurSelect_all "xslp_gridHeurSelect_all".
+ bit 1 = 2 Equivalent to \ref XPRESSxslp_gridHeurSelect_simple "xslp_gridHeurSelect_simple".
+ bit 2 = 4 Equivalent to \ref XPRESSxslp_gridHeurSelect_simAnneal "xslp_gridHeurSelect_simAnneal".
+xslp_gridHeurSelect_all boolean 12412001 0 1 13 Enumeration: Try all combinations
+xslp_gridHeurSelect_simple boolean 12412002 1 1 13 Simple search heuristics
+xslp_gridHeurSelect_simAnneal boolean 12412003 1 1 13 Simulated annealing
+xslp_iterFallbackOps string 12474000 "" 1 13 Alternative LP level control values for numerically challengeing problems
 xslp_linQuadBR enumint 12414000 -1 1 14 Use linear and quadratic constraints and objective function to further reduce bounds on all variables
  -1 1 Automatic selection
  0 1 Disable
@@ -1149,6 +1261,29 @@ xslp_probing enumint 12403000 -1 1 14 Determines whether probing on a subset of
  5 1 Activate SLP probing on any variable.
 xslp_presolve_elimTol double 12206000 0.001 0 maxdouble 1 14 Tolerance for nonlinear eliminations during SLP presolve
 xslp_boundThreshold double 12214000 1e+10 0 maxdouble 1 14 Maximum size of a bound that can be introduced by nonlinear presolve
+xslp_reformulate integer 12392000 511 0 maxint 1 14 Controls the problem reformulations carried out before augmentation
+ bit 0 = 1 Equivalent to \ref XPRESSxslp_reformulate_slp2qp "xslp_reformulate_slp2qp".
+ bit 1 = 2 Equivalent to \ref XPRESSxslp_reformulate_qp2slp "xslp_reformulate_qp2slp".
+ bit 2 = 4 Equivalent to \ref XPRESSxslp_reformulate_slp2qcqp "xslp_reformulate_slp2qcqp".
+ bit 3 = 8 Equivalent to \ref XPRESSxslp_reformulate_qcqp2slp "xslp_reformulate_qcqp2slp".
+ bit 4 = 16 Equivalent to \ref XPRESSxslp_reformulate_socp2slp "xslp_reformulate_socp2slp".
+ bit 5 = 32 Equivalent to \ref XPRESSxslp_reformulate_qpsolve "xslp_reformulate_qpsolve".
+ bit 6 = 64 Equivalent to \ref XPRESSxslp_reformulate_pwl "xslp_reformulate_pwl".
+ bit 7 = 128 Equivalent to \ref XPRESSxslp_reformulate_abs "xslp_reformulate_abs".
+ bit 8 = 256 Equivalent to \ref XPRESSxslp_reformulate_minMax "xslp_reformulate_minMax".
+ bit 9 = 512 Equivalent to \ref XPRESSxslp_reformulate_allAbs "xslp_reformulate_allAbs".
+ bit 10 = 1024 Equivalent to \ref XPRESSxslp_reformulate_allMinMax "xslp_reformulate_allMinMax".
+xslp_reformulate_slp2qp boolean 12392001 1 1 14 Solve convex quadratic objectives using the XPRS library
+xslp_reformulate_qp2slp boolean 12392002 1 1 14 Convert non-convex quadratic objectives to SLP constructs
+xslp_reformulate_slp2qcqp boolean 12392003 1 1 14 Solve convex quadratic constraints using the XPRS library
+xslp_reformulate_qcqp2slp boolean 12392004 1 1 14 Convert non-convex QCQP constraints to SLP constructs
+xslp_reformulate_socp2slp boolean 12392005 1 1 14 Keep second order cones in the XPRS problem to keep them in the linearizations
+xslp_reformulate_qpsolve boolean 12392006 1 1 14 Convexity of a quadratic only problem may be checked by calling the optimizer to solve the instance
+xslp_reformulate_pwl boolean 12392007 1 1 14 Convert pievewise linear functions to MIP constructs
+xslp_reformulate_abs boolean 12392008 1 1 14 Convert ABS functions to MIP constraints if the full problem can be made not nonlinear
+xslp_reformulate_minMax boolean 12392009 1 1 14 Convert MIN and MAX functions to MIP expressions if the full problem can be made not nonlinear
+xslp_reformulate_allAbs boolean 12392010 0 1 14 Always convert ABS expressions
+xslp_reformulate_allMinMax boolean 12392011 0 1 14 Always convert MIN and MAX expressions
 xslp_augmentation integer 12302000 12 minint maxint 1 15 Bit map describing the SLP augmentation method(s) to be used
  bit 0 = 1 Equivalent to \ref XPRESSxslp_augmentation_minimum "xslp_augmentation_minimum".
  bit 1 = 2 Equivalent to \ref XPRESSxslp_augmentation_evenHanded "xslp_augmentation_evenHanded".
@@ -1319,6 +1454,7 @@ xslp_validationTol_a double 12165000 1e-05 0 maxdouble 1 20 Absolute tolerance f
 xslp_validationTol_r double 12166000 1e-05 0 maxdouble 1 20 Relative tolerance for the XSLPvalidate procedure (may be used by Xpress Global internally)
 xslp_validationTol_k double 12205000 1e-05 0 maxdouble 1 20 Relative tolerance for the XSLPvalidatekkt procedure (may be used by Xpress Global internally)
 xslp_validationFactor double 12211000 0.001 0 maxdouble 1 20 Minimum improvement in validation targets to continue iterating
+xslp_maxTime integer 12366000 0 minint maxint 1 20 Maximum time in seconds that the SLP optimization will run before it terminates
 xslp_msMaxBoundRange double 12204000 1000 0 maxdouble 1 21 Defines the maximum range inside which initial points are generated by multistart presets
 xslp_multistart_maxSolves integer 12364000 -1 -1 maxint 1 21 Maximum number of jobs to create during the multistart search
 xslp_multistart_maxTime integer 12365000 0 0 maxint 1 21 Maximum total time to be spent in the mutlistart search
@@ -1367,6 +1503,7 @@ xslp_log enumint 12316000 0 1 23 Level of printing during SLP iterations
  4 1 Include all variables in convergence log
  5 1 Include user function call communications in the log
 xslp_slpLog integer 12346000 1 0 maxint 1 23 Frequency with which SLP status is printed
+xslp_multistart_log integer 12395000 0 0 maxint 1 23 Level of logging during the multistart run
 xslp_mipAlgorithm integer 12336000 17 minint maxint 1 24 Bitmap describing the MISLP algorithms to be used
  bit 0 = 1 Equivalent to \ref XPRESSxslp_mipAlgorithm_initialSLP "xslp_mipAlgorithm_initialSLP".
  bit 2 = 4 Equivalent to \ref XPRESSxslp_mipAlgorithm_initialRelaxSLP "xslp_mipAlgorithm_initialRelaxSLP".
@@ -1452,6 +1589,54 @@ barHGPrecision enumint 8507000 -1 1 26 Whether to use single or double precision
  0 1 Use single precision arithmetic on both CPU and GPU platforms.
  1 1 Use double precision arithmetic on both CPU and GPU platforms.
 barHGGPUBlockSize integer 8508000 256 0 maxint 1 26 Size of CUDA blocks to use for the GPU calculations
+tunerMaxTime double 8364000 0 0 maxdouble 1 27 Tuner: Maximum time in seconds that the tuner will run before it terminates
+ 0 No time limit.
+ >0 Stop the tuner after the given number of seconds.
+tunerHistory enumint 8365000 2 1 27 Tuner: Whether to reuse and append to previous tuner results of the same problem
+ 0 1 Discard any previous tuner results.
+ 1 1 Append new results to the previous tuner results, but do not reuse them.
+ 2 1 Reuse the previous results and append new results to it.
+tunerMethod enumint 8360000 -1 1 27 Tuner: Selects a factory tuner method
+ -1 1 Automatically determined. The tuner will select the default method based on the problem type.
+ 0 1 Select the default LP tuner method.
+ 1 1 Select the default MIP tuner method.
+ 2 1 Select a more comprehensive MIP tuner method.
+ 3 1 Select a root-focus MIP tuner method.
+ 4 1 Select a tree-focus MIP tuner method.
+ 5 1 Select a simple MIP tuner method.
+ 6 1 Select the default SLP tuner method.
+ 7 1 Select the default MISLP tuner method.
+ 8 1 Select a MIP tuner method focussed on primal heuristics.
+ 9 1 Select the default Xpress Global tuner method.
+tunerOutput boolean 8372000 1 1 27 Tuner: Whether to output tuner results and logs to the file system
+ 0 Don&prime;t output to the file system.
+ 1 Output results and logs to the file system.
+tunerPermute integer 8366000 0 0 maxint 1 27 Tuner: Defines the number of permutations to solve for each control setting
+ 0 Solve the original problem only for each setting.
+ n>0 Solve the original problem and n permuted problems for each setting.
+tunerTarget enumint 8362000 -1 1 27 Tuner: Defines the tuner target -- what should be evaluated when comparing two runs with different control settings
+ -1 1 Automatically determined. The tuner will choose the default target based on problem type.
+ 0 1 Solution time then gap. (MIP/MISLP default)
+ 1 1 Solution time then best bound.
+ 2 1 Solution time then best integer solution.
+ 3 1 The primal dual integral.
+ 4 1 Time only. (LP/SLP default)
+ 5 1 SLP objective only. (SLP/MISLP choice)
+ 6 1 SLP validation number only. (SLP/MISLP choice)
+ 7 1 Gap only.
+ 8 1 Best bound only.
+ 9 1 Best integer solution only.
+ 10 1 Best primal integral. (Only for individual instances, not for problem sets)
+tunerThreads integer 8363000 1 -1 maxint 1 27 Tuner: Number of threads used by the tuner
+ -1 Choose automaticlly.
+ 1 The tuner will run in sequential.
+ n>1 The tuner will run in parallel with n threads.
+tunerOutputPath string 6018000 "tuneroutput" 1 27 Tuner: Defines a root path to which the tuner writes the result file and logs
+tunerSessionName string 6019000 "" 1 27 Tuner: Defines a session name for the tuner
+tunerMethodFile string 6017000 "" 1 27 Tuner: Defines a file from which the tuner can read user-defined tuner method
+tunerVerbose boolean 8370000 1 1 27 Tuner: Whether the tuner should prints detailed information for each run
+ 0 Print less information.
+ 1 Print extra information.
 knitro_algorithm integer 0 2 0 5 1 25 Which algorithm to use.
 knitro_bar_directinterval integer 0 -1 -1 maxint 1 25 When using the Interior/Direct algorithm, this parameter controls the maximum number of consecutive CG steps before trying to force the algorithm to take a direct step again. (negative implies****
 knitro_bar_feasible integer 0 0 0 3 1 25 Whether feasibility is given special emphasis.
@@ -1550,4 +1735,5 @@ SLP_log group 23 1 NLP Log Options
 MISLP group 24 1 MINLP Options
 knitro group 25 1 KNITRO Options
 PDHG group 26 1 Primal Dual Hybrid Gradient Options
+Tuner group 27 1 Tuner Options
 *** End of file

gamspy_xpress/version.py

@@ -1 +1 @@
-__version__ = '52.1.0'
+__version__ = '52.2.0'

{gamspy_xpress-52.1.0.dist-info → gamspy_xpress-52.2.0.dist-info}/METADATA

@@ -1,3 +1,3 @@
 Metadata-Version: 2.4
 Name: gamspy_xpress
-Version: 52.1.0
+Version: 52.2.0

gamspy_xpress-52.2.0.dist-info/RECORD

@@ -0,0 +1,12 @@
+gamspy_xpress/__init__.py,sha256=LshAhVOg-o6i_Mp5X-W09FPVuSIg_OPkiSciBQUNKIs,429
+gamspy_xpress/gsi.dll,sha256=pLY93qkBo_F5_QFdR48LOnV7wjvfGjyoAZmbWtYYTtk,968704
+gamspy_xpress/optxpress.def,sha256=zkNzUdtn0iuuVsw6oOvWJPAQH938apOxHLc7GaPM690,156613
+gamspy_xpress/version.py,sha256=Xw9hqiSQBvONRKP4CmKIOPViNBcVT3IYUWqB4s8BDMs,22
+gamspy_xpress/xpauth.xpr,sha256=gRp-F02NdKbptOPXIQ4xnydJc0Ynfk2ND81j0mR_Aec,531
+gamspy_xpress/xprl.dll,sha256=PWGbbocFbxD5rLihYqPy6JOGOKI5NB8C9Vm0wJCPNRM,871424
+gamspy_xpress/xprs.dll,sha256=co0gos3fZptg-4f26AJ74Vnj03Hz81PkmXg4EASinTo,21361152
+gamspy_xpress/xpxcclib64.dll,sha256=Tui6x_o3Skonursq8qrLW6L5bghV0u2UhkoKfZK28tc,426496
+gamspy_xpress-52.2.0.dist-info/METADATA,sha256=B4YxlgRMCuWWP_cBg-6YqkdvrBCTkTWkLWLK0eZJ2Ho,61
+gamspy_xpress-52.2.0.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
+gamspy_xpress-52.2.0.dist-info/top_level.txt,sha256=Qm1c_bADQJ0s3xzALK5pOrKhRu7IGmlmAb5BPK6axvs,14
+gamspy_xpress-52.2.0.dist-info/RECORD,,

gamspy_xpress-52.1.0.dist-info/RECORD

@@ -1,12 +0,0 @@
-gamspy_xpress/__init__.py,sha256=LshAhVOg-o6i_Mp5X-W09FPVuSIg_OPkiSciBQUNKIs,429
-gamspy_xpress/gsi.dll,sha256=DPjI0Q9u1gpXT8oUTGujpf8s4rHnRK1eT8JmOcfJxc8,969728
-gamspy_xpress/optxpress.def,sha256=xP5_sbc6JY0nXwX1UDHoFsx1FyrepKlqDTxefN0zgGk,139636
-gamspy_xpress/version.py,sha256=MJ6Omh6nCQsTTCAndvdZUVhoZ5exvmUTYWnbHM1eFpg,22
-gamspy_xpress/xpauth.xpr,sha256=gRp-F02NdKbptOPXIQ4xnydJc0Ynfk2ND81j0mR_Aec,531
-gamspy_xpress/xprl.dll,sha256=PWGbbocFbxD5rLihYqPy6JOGOKI5NB8C9Vm0wJCPNRM,871424
-gamspy_xpress/xprs.dll,sha256=co0gos3fZptg-4f26AJ74Vnj03Hz81PkmXg4EASinTo,21361152
-gamspy_xpress/xpxcclib64.dll,sha256=BbJ5P9JwjN_VsFNLkHbGfpe99NcKpUE0Njctfsf0-IM,419840
-gamspy_xpress-52.1.0.dist-info/METADATA,sha256=_YLUH51qTXStS8OhuBBd__I64hP531TI_0mw_0H_AYA,61
-gamspy_xpress-52.1.0.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
-gamspy_xpress-52.1.0.dist-info/top_level.txt,sha256=Qm1c_bADQJ0s3xzALK5pOrKhRu7IGmlmAb5BPK6axvs,14
-gamspy_xpress-52.1.0.dist-info/RECORD,,