gamspy-xpress 51.4.0__py3-none-win_amd64.whl → 52.0.0rc1__py3-none-win_amd64.whl

gamspy_xpress/optxpress.def

@@ -149,6 +149,9 @@ solTimeLimit double 7159000 1e+20 0 maxdouble 1 1 Maximum time in seconds that t
  >0 If an integer solution has been found, stop MIP search after the given number of seconds, otherwise continue until an integer solution is finally found.
 workLimit double 7167000 1e+20 0 maxdouble 1 1 Maximum work (measured in work units) that the Optimizer will run before it terminates
  >0 Stop LP or MIP search when the given number of work units is reached.
+deterministicLog boolean 8505000 0 1 1 Suppress non-deterministic log information in the standard MIP log
+ 0 Report wall clock time stamps and other non-deterministic log information (the default)
+ 1 Suppress non-deterministic log information. In particular, report deterministic work units instead of time.
 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
@@ -189,6 +192,9 @@ backgroundSelect integer 8463000 -1 -1 1 1 2 Bit-vector control to select which
  bit 3 = 8 Fix-propagate-repair heuristic.
 heurSearchBackgroundSelect integer 8477000 -1 -1 maxint 1 2 Bit-vector control to select which large neighborhood searches to run in the background (for example in parallel to the root cut loop)
  bit 1 = 2 Enable L heuristic.
+gpuPlatform boolean 8510000 1 1 2 Controls what kind of GPU support is enabled overall in Xpress
+ 0 Do not use any GPU support.
+ 1 Use GPU support based on CUDA (if available).
 mipPresolve integer 8078000 -1 minint maxint 1 3 Branch and Bound: Type of integer processing to be performed
  bit 0 = 1 Equivalent to \ref XPRESSmipPresolve_reducedCostFixing "mipPresolve_reducedCostFixing".
  bit 1 = 2 Equivalent to \ref XPRESSmipPresolve_logicPreprocessing "mipPresolve_logicPreprocessing".
@@ -801,11 +807,17 @@ autoCutting enumint 8446000 -1 1 10 Automatically decide whether to generate cut
  -1 1 Automatic.
  0 1 Disabled.
  1 1 Enabled.
-mcfCutStrategy enumint 8486000 -1 1 10 Level of Multi-Commodity Flow (MCF) cutting planes separation: This specifies how much aggresively MCF cuts should be separated
+mcfCutStrategy enumint 8486000 -1 1 10 Level of Multi-Commodity Flow (MCF) cutting planes separation: This specifies how aggressively MCF cuts should be separated
  -1 1 Automatic - let the Optimizer decide.
  0 1 Separation of MCF cuts disabled.
  1 1 Moderate separation of MCF cuts.
  2 1 Aggressive separation of MCF cuts.
+sdpCutStrategy enumint 8497000 -1 1 10 Level of SDP cutting planes separation: How aggressively SDP cuts should be separated
+ -1 1 Automatic - let the Optimizer decide.
+ 0 1 Separation of SDP cuts disabled.
+ 1 1 Conservative separation of SDP cuts.
+ 2 1 Moderate separation of SDP cuts.
+ 3 1 Aggressive separation of SDP cuts.
 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.
@@ -974,22 +986,6 @@ barObjPerturb double 7146000 1e-06 mindouble maxdouble 1 7 Defines how the barri
  0 Turn off objective perturbation.
  >0 Let the optimizer decide if the objective is perturbed or not and use the parameter value as the scale of the perturbation.
  <0 Always perturb the objective by the absolute value of the parameter.
-barHGExtrapolate double 7166000 0.15 0 maxdouble 1 7 Extrapolation parameter for the hybrid gradient algorithm
-barHGOps integer 8483000 8 0 maxint 1 7 Bit-vector control options for the hybrid gradient algorithm
- bit 0 = 1 Equivalent to \ref XPRESSbarHGOps_asymAvg "barHGOps_asymAvg".
- bit 1 = 2 Equivalent to \ref XPRESSbarHGOps_startL1 "barHGOps_startL1".
- bit 2 = 4 Equivalent to \ref XPRESSbarHGOps_startL2 "barHGOps_startL2".
- bit 3 = 8 Equivalent to \ref XPRESSbarHGOps_startLInf "barHGOps_startLInf".
- bit 4 = 16 Unused.
- bit 5 = 32 Equivalent to \ref XPRESSbarHGOps_omegaContract "barHGOps_omegaContract".
- bit 6 = 64 Equivalent to \ref XPRESSbarHGOps_omegaInf "barHGOps_omegaInf".
-barHGOps_asymAvg boolean 8483001 0 1 7 Use an asymmetric average for the primal averaging
-barHGOps_startL1 boolean 8483002 0 1 7 Use the 1-norm of the coefficient matrix in normalizing the initial solution
-barHGOps_startL2 boolean 8483003 0 1 7 Use the 2-norm of the coefficient matrix in normalizing the initial solution
-barHGOps_startLInf boolean 8483004 1 1 7 Use the infinity norm of the coefficient matrix in normalizing the initial solution
-barHGOps_omegaContract boolean 8483006 0 1 7 Contract omega towards 1 if the infeasibility is small enough
-barHGOps_omegaInf boolean 8483007 0 1 7 Omega is based on the infeasibility
-barHGMaxRestarts integer 8484000 1250 0 maxint 1 7 Maximum number of restarts in the hybrid gradient algorithm
 barIterative integer 8492000 -2 -2 maxint 1 7 Maximum number of barrier iterations in which an iterative solver is used instead of the Cholesky decomposition
  -2 Automatically determined.
  -1 Turn iterative solver off.
@@ -1008,6 +1004,12 @@ heurSearchCopyControls enumint 8480000 1 1 8 Select how user-set controls should
  2 1 Copy all user-set controls
 globalNLPCuts integer 8481000 -1 -1 maxint 1 8 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
 globalTreeNLPCuts integer 8482000 -1 -1 maxint 1 8 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
+globalPresolveOBBT enumint 8494000 -1 1 8 Controls the amount of work performed by Optimization-Based Bound Tightening (OBBT)
+ -1 1 Automatic. The solver decides how much effort goes into OBBT.
+ 0 1 Disabled. No OBBT will be 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.
 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".
@@ -1389,7 +1391,7 @@ xslp_mipFixStepBounds_coefOnly boolean 12338003 0 1 24 Fix step bounds on SLP va
 xslp_mipFixStepBounds_structAll boolean 12338002 0 1 24 Fix step bounds on all structural SLP variables
 xslp_mipFixStepBounds_structNotCoef boolean 12338001 0 1 24 Fix step bounds on structural SLP variables which are not in coefficients
 xslp_heurStrategy enumint 12400000 -1 1 24 Branch and Bound: MINLP heuristic strategy
- -1 1 Automatic selection of heuristic strategy.
+ -1 1 Automatic selection of heuristic strategy (depending on XPRS_HEUREMPHASIS).
  0 1 No heuristics.
  1 1 Basic heuristic strategy.
  2 1 Enhanced heuristic strategy.
@@ -1409,6 +1411,32 @@ xslp_mipRelaxStepBounds_coef boolean 12337004 1 1 24 Relax step bounds on SLP va
 xslp_mipRelaxStepBounds_coefOnly boolean 12337003 1 1 24 Relax step bounds on SLP variables appearing only in coefficients
 xslp_mipRelaxStepBounds_structAll boolean 12337002 1 1 24 Relax step bounds on all structural SLP variables
 xslp_mipRelaxStepBounds_structNotCoef boolean 12337001 1 1 24 Relax step bounds on structural SLP variables which are not in coefficients
+barHGExtrapolate double 7166000 0.15 0 maxdouble 1 26 Extrapolation parameter for the hybrid gradient algorithm
+barHGOps integer 8483000 24 0 maxint 1 26 Bit-vector control options for the hybrid gradient algorithm
+ bit 0 = 1 Equivalent to \ref XPRESSbarHGOps_asymAvg "barHGOps_asymAvg".
+ bit 1 = 2 Equivalent to \ref XPRESSbarHGOps_startL1 "barHGOps_startL1".
+ bit 2 = 4 Equivalent to \ref XPRESSbarHGOps_startL2 "barHGOps_startL2".
+ bit 3 = 8 Equivalent to \ref XPRESSbarHGOps_startLInf "barHGOps_startLInf".
+ bit 4 = 16 Equivalent to \ref XPRESSbarHGOps_restartL2 "barHGOps_restartL2".
+ bit 5 = 32 Equivalent to \ref XPRESSbarHGOps_omegaContract "barHGOps_omegaContract".
+ bit 6 = 64 Equivalent to \ref XPRESSbarHGOps_omegaInf "barHGOps_omegaInf".
+barHGOps_asymAvg boolean 8483001 0 1 26 Use an asymmetric average for the primal averaging
+barHGOps_startL1 boolean 8483002 0 1 26 Use the 1-norm of the coefficient matrix in normalizing the initial solution
+barHGOps_startL2 boolean 8483003 0 1 26 Use the 2-norm of the coefficient matrix in normalizing the initial solution
+barHGOps_startLInf boolean 8483004 1 1 26 Use the infinity norm of the coefficient matrix in normalizing the initial solution
+barHGOps_restartL2 boolean 8483005 1 1 26 Use L2 norm to measure solution quality
+barHGOps_omegaContract boolean 8483006 0 1 26 Contract omega towards 1 if the infeasibility is small enough
+barHGOps_omegaInf boolean 8483007 0 1 26 Omega is based on the infeasibility
+barHGMaxRestarts integer 8484000 1250 0 maxint 1 26 Maximum number of restarts in the hybrid gradient algorithm
+barHGRelTol double 7177000 0 0 maxdouble 1 26 Relative feasibility tolerance for the hybrid gradient algorithm
+barHGGPU boolean 8506000 0 1 26 Whether to use a GPU for the hybrid gradient algorithm
+ 0 Do not use a GPU.
+ 1 Use the GPU.
+barHGPrecision enumint 8507000 -1 1 26 Whether to use single or double precision floating-point arithmetic in the hybrid gardient algorithm
+ -1 1 Automatically selected based on the value of \ref XPRESSbarHGGPU "barHGGPU"
+ 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
 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.
@@ -1421,13 +1449,13 @@ knitro_bar_murule integer 0 0 0 6 1 25 Which barrier parameter update strategy.
 knitro_bar_switchrule integer 0 -1 -1 3 1 25 Switching rule strategy for barrier algorithms that controls switching between optimality and feasibility phases.
 knitro_blasoption integer 0 -1 -1 4 1 25 Which BLAS/LAPACK library to use.  Intel MKL library is only available on some platforms; see the User Manual for details.
 knitro_delta double 0 1 1e-14 maxdouble 1 25 Initial trust region radius scaling factor, used to determine the initial trust region size.
-knitro_feastol double 0 1e-06 0 maxdouble 1 25 Specifies the final relative stopping tolerance for the feasibility error. Smaller values of feastol result in a higher degree of accuracy in the solution with respect to feasibility.
+knitro_feastol double 0 -1 -1 maxdouble 1 25 Specifies the final relative stopping tolerance for the feasibility error. Smaller values of feastol result in a higher degree of accuracy in the solution with respect to feasibility.
 knitro_gradopt integer 0 1 1 5 1 25 How to compute/approximate the gradient of the objective and constraint functions.
 knitro_hessopt integer 0 0 0 6 1 25 How to compute/approximate the Hessian of the Lagrangian.
 knitro_honorbnds integer 0 -1 -1 2 1 25 Whether to enforce satisfaction of simple bounds at all iterations.
 knitro_infeastol double 0 1e-08 0 maxdouble 1 25 Specifies relative stopping tolerance used to declare infeasibility.
-knitro_linsolver integer 0 0 0 8 1 25 Which linear system solver to use.
-knitro_lmsize integer 0 10 1 100 1 25 Number of limited memory pairs to store when Hessian choice is lbfgs.
+knitro_linsolver integer 0 0 0 9 1 25 Which linear system solver to use.
+knitro_lmsize integer 0 8 1 100 1 25 Number of limited memory pairs to store when Hessian choice is lbfgs.
 knitro_maxit integer 0 0 0 maxint 1 25 Maximum number of iterations to allow (if 0 then \ref S_KNITRO "KNITRO" determines the best value). Default values are 10000 for NLP and 3000 for MIP.
 knitro_mip_branchrule integer 0 0 0 3 1 25 Specifies the MIP branching rule for choosing a variable.
 knitro_mip_gub_branch integer 0 0 0 1 1 25 Whether to branch on generalized upper bounds (GUBs).
@@ -1445,7 +1473,7 @@ knitro_mip_strong_candlim integer 0 128 0 maxint 1 25 Maximum number of candidat
 knitro_mip_strong_level integer 0 10 0 maxint 1 25 Maximum number of levels on which to perform MIP strong branching.
 knitro_mip_strong_maxit integer 0 1000 0 maxint 1 25 Maximum number of iterations to allow for MIP strong branching solves.
 knitro_objrange double 0 1e+20 0 maxdouble 1 25 Valid range of objective values.
-knitro_opttol double 0 1e-06 0 maxdouble 1 25 Specifies the final relative stopping tolerance for the KKT (optimality) error. Smaller values of opttol result in a higher degree of accuracy in the solution with respect to optimality.
+knitro_opttol double 0 -1 -1 maxdouble 1 25 Specifies the final relative stopping tolerance for the KKT (optimality) error. Smaller values of opttol result in a higher degree of accuracy in the solution with respect to optimality.
 knitro_outlev integer 0 2 0 6 1 25 Specifies the verbosity of output.
 knitro_presolve integer 0 1 0 1 1 25 Whether to apply any presolve operations to the model.
 knitro_presolve_tol double 0 1e-06 0 maxdouble 1 25 Specifies the tolerance used to determine whether or not deduced bounds from the presolve operation are infeasible.
@@ -1506,4 +1534,5 @@ SLP_diff group 22 1 NLP Derivative Options
 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
 *** End of file

gamspy_xpress/version.py

@@ -1 +1 @@
-__version__ = '51.4.0'
+__version__ = '52.0.0rc1'

gamspy_xpress/xpauth.xpr

@@ -1,9 +1,9 @@
 license expiry="never" features="Hyper OptLib OptConsole OptJava \
-	Barrier Network Quadratic Integer Threads=20 ParaMIP=20 \
+	Barrier Network Quadratic IVE Integer Threads=20 ParaMIP=20 \
 	ParaBar=20 Global MINLP SLPLib XPKNTLib XpressNL MISLP mmxnlp" \
-	fico_xpress_release="9.7" hostid="any" oem="GAMS Development \
+	fico_xpress_release="9.8" hostid="any" oem="GAMS Development \
 	Corp. for GAMS" platform="any" release="2025" \
-	static="uncounted" terminal-services sig="3704 3edd fe49 5924 \
-	ea8a f308 392c 3de9 d99f 59e7 e799 bce6 0c9f effd d7aa c87e \
-	4295 58ee b648 3e8f f642 30cf 1217 3942 c734 aa66 3dd3 889c \
-	17ad 5623 bafc b95e"
+	static="uncounted" terminal-services sig="3b8d aa18 804c 10e7 \
+	1371 9cb5 9b34 696f 51a4 758c c912 feeb 77af 8c99 9a04 bae5 \
+	4d82 e386 443b c2c0 7fa2 758c 0426 7762 721f 5b91 167c 0adc \
+	e999 39ab 1435 a75b"

{gamspy_xpress-51.4.0.dist-info → gamspy_xpress-52.0.0rc1.dist-info}/METADATA

@@ -1,3 +1,3 @@
 Metadata-Version: 2.4
 Name: gamspy_xpress
-Version: 51.4.0
+Version: 52.0.0rc1

gamspy_xpress-52.0.0rc1.dist-info/RECORD

@@ -0,0 +1,12 @@
+gamspy_xpress/__init__.py,sha256=LshAhVOg-o6i_Mp5X-W09FPVuSIg_OPkiSciBQUNKIs,429
+gamspy_xpress/gsi.dll,sha256=ykL1NkiCAT6_TK9v-6SqPMRAvbEZNuouYfoj4Z93bGU,967680
+gamspy_xpress/optxpress.def,sha256=uPBCI65DOwjRoyhkZLq18aPE2znr98xSrlnBTSqxsgk,138354
+gamspy_xpress/version.py,sha256=xEmi9aNSuCk1FB4wuU1dnHDcnFovh89ZPfIiCZCjNrA,25
+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=EO0HZEgbyjBcx9IpOrt3kRwbl8Ndm6PkfiE4e3Ln6os,412672
+gamspy_xpress-52.0.0rc1.dist-info/METADATA,sha256=yjYF54_ToI13lQ7BMfgdg-gTwN6agISIGtndvXm3zDQ,64
+gamspy_xpress-52.0.0rc1.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
+gamspy_xpress-52.0.0rc1.dist-info/top_level.txt,sha256=Qm1c_bADQJ0s3xzALK5pOrKhRu7IGmlmAb5BPK6axvs,14
+gamspy_xpress-52.0.0rc1.dist-info/RECORD,,

gamspy_xpress-51.4.0.dist-info/RECORD

@@ -1,12 +0,0 @@
-gamspy_xpress/__init__.py,sha256=LshAhVOg-o6i_Mp5X-W09FPVuSIg_OPkiSciBQUNKIs,429
-gamspy_xpress/gsi.dll,sha256=Phkw27ZDvXGSorX03gkE6zk_XteHNmMCk9t18xVVnfc,971776
-gamspy_xpress/optxpress.def,sha256=C-XrFpjN_DkvBFaPeOASlam3iw88OHDVRHz2TvbG4Ao,135935
-gamspy_xpress/version.py,sha256=gNUseCSqh1U7glcQ7-vMIqyrfVzNn6VTB9xFgTqHTdo,22
-gamspy_xpress/xpauth.xpr,sha256=G4Cb-LwiZDxLIzBHX3x4RGDcf4zM0Uu9Aa7m2N2jK2o,527
-gamspy_xpress/xprl.dll,sha256=2u6ABdOfhWt_AJdKV2455zknhb60aPuXsfMUp9xrF2M,871424
-gamspy_xpress/xprs.dll,sha256=uJQsnDr_Jw19_KXdLcdCfiBFE-veLG1zCSs-GkywnUY,22072320
-gamspy_xpress/xpxcclib64.dll,sha256=x4tS4Bo47eZ9LcChLRLAeMGJ4jNWb8PzS0HMUlSgIWo,546816
-gamspy_xpress-51.4.0.dist-info/METADATA,sha256=IrDWwBGyECYimC5wgltNHHc8reovSZkgETCuMcC2TzA,61
-gamspy_xpress-51.4.0.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
-gamspy_xpress-51.4.0.dist-info/top_level.txt,sha256=Qm1c_bADQJ0s3xzALK5pOrKhRu7IGmlmAb5BPK6axvs,14
-gamspy_xpress-51.4.0.dist-info/RECORD,,