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

gamspy_gurobi/optgurobi.def

@@ -2,11 +2,7 @@
 * optgurobi.def
 *
 
-Presolve enumint 0 -1 1 5 Presolve level
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
+Presolve integer 0 -1 -1 2 1 5 Presolve level
 Tuning string 1 "" 1 16 Parameter Tuning
 bariterlimit integer 0 maxint 0 maxint 1 1 Barrier iteration limit
 bestbdstop double 0 maxdouble mindouble maxdouble 1 1 Best objective bound to stop
@@ -42,97 +38,71 @@ record boolean 0 0 0 4 Enable API call recording
 resultfile string 0 "" 0 4 Result file written upon completion of optimization
 solfiles string 0 "" 1 4 Location to store intermediate solution files
 aggfill integer 0 -1 -1 maxint 1 5 Allowed fill during presolve aggregation
-aggregate integer 0 1 0 2 1 5 Presolve aggregation control
+aggregate enumint 0 1 1 5 Presolve aggregation control
+ 0 1 off
+ 1 1 moderate
+ 2 1 or aggressive
 dualreductions boolean 0 1 1 5 Disables dual reductions in presolve
-precrush boolean 0 0 1 5 Allows presolve to translate constraints on the original model toequivalent constraints on the presolved model
+precrush boolean 0 0 1 5 Allows presolve to translate constraints on the original model to equivalent constraints on the presolved model
 predeprow integer 0 -1 -1 1 1 5 Presolve dependent row reduction
 predual integer 0 -1 -1 2 1 5 Presolve dualization
-premiqcpform enumint 0 -1 1 5 Format of presolved MIQCP model
- -1 1 Auto
- 0 1 Always leaves the model in MIQCP form
- 1 1 Always transforms the model into MISOCP form
- 2 1 Always transforms the model into disaggregated MISOCP form
+premiqcpform integer 0 -1 -1 2 1 5 Format of presolved MIQCP model
 prepasses integer 0 -1 -1 maxint 1 5 Presolve pass limit
-preqlinearize enumint 0 -1 1 5 Presolve Q matrix linearization
- -1 1 Auto
- 0 1 Linearization off
- 1 1 Force Linearization and get strong LP relaxation
- 2 1 Force Linearization and get compact relaxation
+preqlinearize integer 0 -1 -1 2 1 5 Presolve Q matrix linearization
 presos1bigm double 0 -1 -1 1e+10 1 5 Controls largest coefficient in SOS1 reformulation
 presos1encoding integer 0 -1 -1 3 1 5 Controls SOS1 reformulation
 presos2bigm double 0 -1 -1 1e+10 1 5 Controls largest coefficient in SOS2 reformulation
 presos2encoding integer 0 -1 -1 3 1 5 Controls SOS2 reformulation
 presparsify integer 0 -1 -1 2 1 5 Presolve sparsify reduction
- -1 Auto
- 0 Disable the presolve sparsify reduction
- 1 Enable the presolve sparsify reduction for MIPs
- 2 Enable the presolve sparsify reduction for all model types
 lpwarmstart integer 0 -1 -1 2 1 6 Warm start usage in simplex
 method enumint 0 -1 1 6 Define method, e.g., Simplex, to solve continuous models
- -1 1 Automatic
- 0 1 Primal simplex
- 1 1 Dual simplex
- 2 1 Barrier
- 3 1 Concurrent
- 4 1 Deterministic concurrent
- 5 1 Both primal and dual simplex
+ -1 1 automatic
+ 0 1 primal simplex
+ 1 1 dual simplex
+ 2 1 barrier
+ 3 1 concurrent
+ 4 1 deterministic concurrent
+ 5 1 deterministic concurrent simplex (deprecated; see \ref GUROBIconcurrentmethod "concurrentmethod")
+ 6 1 PDHG (Primal-Dual Hybrid Gradient)
 networkalg integer 0 -1 -1 1 1 6 Network simplex algorithm
 normadjust integer 0 -1 -1 3 1 6 Simplex pricing norm
 perturbvalue double 0 0.0002 0 maxdouble 1 6 Simplex perturbation magnitude
 quad integer 0 -1 -1 1 1 6 Quad precision computation in simplex
 sifting enumint 0 -1 1 6 Sifting within dual simplex
- -1 1 Auto
+ -1 1 Automatic
  0 1 Off
  1 1 Moderate
- 2 1 Agressive
+ 2 1 Aggressive
 siftmethod enumint 0 -1 1 6 LP method used to solve sifting sub-problems
- -1 1 Auto
+ -1 1 Automatic
  0 1 Primal Simplex
  1 1 Dual Simplex
  2 1 Barrier
 simplexpricing enumint 0 -1 1 6 Simplex variable pricing strategy
- -1 1 Auto
+ -1 1 Automatic
  0 1 Partial Pricing
  1 1 Steepest Edge
  2 1 Devex
  3 1 Quick-Start Steepest Edge
 barcorrectors integer 0 -1 -1 maxint 1 7 Central correction limit
-barhomogeneous enumint 0 -1 1 7 Barrier homogeneous algorithm
- -1 1 Auto
- 0 1 Homogeneous Barrier off
- 1 1 Force Homogeneous Barrier on
-barorder enumint 0 -1 1 7 Barrier ordering algorithm
- -1 1 Auto
- 0 1 Approximate Minimum Degree ordering
- 1 1 Nested Dissection ordering
+barhomogeneous integer 0 -1 -1 1 1 7 Barrier homogeneous algorithm
+barorder integer 0 -1 -1 1 1 7 Barrier ordering algorithm
 crossover integer 0 -1 -1 5 1 7 Barrier crossover strategy
-crossoverbasis enumint 0 -1 1 7 Crossover initial basis construction strategy
- -1 1 Auto
- 0 1 Chooses an initial basis quickly
- 1 1 Can take much longer, but often produces a more numerically stable start basis
+crossoverbasis integer 0 -1 -1 1 1 7 Crossover initial basis construction strategy
 qcpdual boolean 0 0 1 7 Compute dual variables for QCP models
- 0 Do not compute dual for QCP problem
- 1 Compute dual for QCP problem
 objscale double 0 0 -1 maxdouble 1 8 Objective scaling
 scaleflag integer 0 -1 -1 3 1 8 Model scaling
-branchdir enumint 0 0 1 9 Branch direction preference
- -1 1 Always explore the down branch first
- 0 1 Automatic
- 1 1 Always explore the up branch first
+branchdir integer 0 0 -1 1 1 9 Branch direction preference
 concurrentjobs integer 0 0 0 maxint 1 9 Enables distributed concurrent solver
 concurrentmethod enumint 0 -1 1 9 Chooses continuous solvers to run concurrently
- -1 1 Auto
+ -1 1 automatic
  0 1 barrier, dual, primal simplex
  1 1 barrier and dual simplex
  2 1 barrier and primal simplex
  3 1 dual and primal simplex
 concurrentmip integer 0 1 1 64 1 9 Enables concurrent MIP solver
 degenmoves integer 0 -1 -1 maxint 1 9 Degenerate simplex moves
-disconnected enumint 0 -1 1 9 Disconnected component strategy
- -1 1 Auto
- 0 1 Ignores structure entirely
- 1 1 Conservative
- 2 1 Aggressive
+disconnected integer 0 -1 -1 2 1 9 Disconnected component strategy
 distributedmipjobs integer 0 0 0 maxint 1 9 Enables the distributed MIP solver
 fixvarsinindicators boolean 0 0 1 9 Controls conversion of indicator constraints in the fixed model
 heuristics double 0 0.05 0 1 1 9 Turn MIP heuristics up or down
@@ -141,26 +111,17 @@ improvestartnodes double 0 maxdouble 0 maxdouble 1 9 Trigger solution improvemen
 improvestarttime double 0 maxdouble 0 maxdouble 1 9 Trigger solution improvement
 improvestartwork double 0 maxdouble 0 maxdouble 1 9 Trigger solution improvement
 integralityfocus boolean 0 0 1 9 Set the integrality focus
- 0 Disable the integrality focus
- 1 Enable the integrality focus
 minrelnodes integer 0 -1 -1 maxint 1 9 Minimum relaxation heuristic control
-mipfocus enumint 0 0 1 9 Set the focus of the MIP solver
- 0 1 Balance between finding good feasible solutions and proving optimality
- 1 1 Focus towards finding feasible solutions
- 2 1 Focus towards proving optimality
- 3 1 Focus on moving the best objective bound
-miqcpmethod enumint 0 -1 1 9 Method used to solve MIQCP models
- -1 1 Auto
- 0 1 Continuous QCP relaxations at each node
- 1 1 Linearized, outer-approximation approach
+mipfocus integer 0 0 0 3 1 9 Set the focus of the MIP solver
+miqcpmethod integer 0 -1 -1 1 1 9 Method used to solve MIQCP models
 nlpheur integer 0 -1 -1 3 1 9 Controls the NLP heuristic for non-convex quadratic models
 nodefiledir string 0 "." 1 9 Directory for MIP node files
 nodefilestart double 0 maxdouble 0 maxdouble 1 9 Memory threshold for writing MIP tree nodes to disk
 nodemethod enumint 0 -1 1 9 Method used to solve MIP node relaxations
- -1 1 Automatic
- 0 1 Primal simplex
- 1 1 Dual simplex
- 2 1 Barrier
+ -1 1 automatic
+ 0 1 primal simplex
+ 1 1 dual simplex
+ 2 1 barrier
 nonconvex integer 0 -1 -1 2 1 9 Control how to deal with non-convex quadratic programs
 norelheurtime double 0 0 0 maxdouble 1 9 Limits the amount of time (in seconds) spent in the NoRel heuristic
 norelheurwork double 0 0 0 maxdouble 1 9 Limits the amount of work performed by the NoRel heuristic
@@ -172,126 +133,48 @@ startnodelimit integer 0 -1 -3 maxint 1 9 Node limit for MIP start sub-MIP
 starttimelimit double 0 maxdouble 0 maxdouble 1 9 Time limit for MIP start sub-MIP (in seconds)
 startworklimit double 0 maxdouble 0 maxdouble 1 9 Work limit for MIP start sub-MIP (in work units)
 submipnodes integer 0 500 0 maxint 1 9 Nodes explored by sub-MIP heuristics
-symmetry enumint 0 -1 1 9 Symmetry detection
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-varbranch enumint 0 -1 1 9 Branch variable selection strategy
- -1 1 Auto
- 0 1 Pseudo Reduced Cost Branching
- 1 1 Pseudo Shadow Price Branching
- 2 1 Maximum Infeasibility Branching
- 3 1 Strong Branching
+symmetry integer 0 -1 -1 2 1 9 Symmetry detection
+varbranch integer 0 -1 -1 3 1 9 Branch variable selection strategy
 zeroobjnodes integer 0 -1 -1 maxint 1 9 Zero objective heuristic control
-bqpcuts enumint 0 -1 1 10 BQP cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-cuts enumint 0 -1 1 10 Global cut generation control
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
- 3 1 Very aggressive
-cliquecuts enumint 0 -1 1 10 Clique cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-covercuts enumint 0 -1 1 10 Cover cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
+bqpcuts integer 0 -1 -1 2 1 10 BQP cut generation
+cuts integer 0 -1 -1 3 1 10 Global cut generation control
+cliquecuts integer 0 -1 -1 2 1 10 Clique cut generation
+covercuts integer 0 -1 -1 2 1 10 Cover cut generation
 cutaggpasses integer 0 -1 -1 maxint 1 10 Constraint aggregation passes performed during cut generation
 cutpasses integer 0 -1 -1 maxint 1 10 Root cutting plane pass limit
 dualimpliedcuts integer 0 -1 -1 2 1 10 Dual implied bound cut generation
-flowcovercuts enumint 0 -1 1 10 Flow cover cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-flowpathcuts enumint 0 -1 1 10 Flow path cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
+flowcovercuts integer 0 -1 -1 2 1 10 Flow cover cut generation
+flowpathcuts integer 0 -1 -1 2 1 10 Flow path cut generation
 gomorypasses integer 0 -1 -1 maxint 1 10 Root Gomory cut pass limit
-gubcovercuts enumint 0 -1 1 10 GUB cover cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-impliedcuts enumint 0 -1 1 10 Implied bound cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
+gubcovercuts integer 0 -1 -1 2 1 10 GUB cover cut generation
+impliedcuts integer 0 -1 -1 2 1 10 Implied bound cut generation
 infproofcuts integer 0 -1 -1 2 1 10 Infeasibility proof cut generation
 liftprojectcuts integer 0 -1 -1 2 1 10 Lift-and-project cut generation
 masterknapsackcuts integer 0 -1 -1 2 1 10 Master Knapsack Polytope cut generation
-mipsepcuts enumint 0 -1 1 10 MIP separation cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-mircuts enumint 0 -1 1 10 MIR cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
+mipsepcuts integer 0 -1 -1 2 1 10 MIP separation cut generation
+mircuts integer 0 -1 -1 2 1 10 MIR cut generation
 mixingcuts integer 0 -1 -1 2 1 10 Mixing cut generation
 modkcuts integer 0 -1 -1 2 1 10 Mod-k cut generation
-networkcuts enumint 0 -1 1 10 Network cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-projimpliedcuts enumint 0 -1 1 10 Projected implied bound cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Moderate
- 2 1 Aggressive
-psdcuts enumint 0 -1 1 10 PSD cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Moderate
- 2 1 Aggressive
-relaxliftcuts enumint 0 -1 1 10 Relax-and-lift cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
-rltcuts enumint 0 -1 1 10 RLT cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
+networkcuts integer 0 -1 -1 2 1 10 Network cut generation
+projimpliedcuts integer 0 -1 -1 2 1 10 Projected implied bound cut generation
+psdcuts integer 0 -1 -1 2 1 10 PSD cut generation
+relaxliftcuts integer 0 -1 -1 2 1 10 Relax-and-lift cut generation
+rltcuts integer 0 -1 -1 2 1 10 RLT cut generation
 strongcgcuts integer 0 -1 -1 2 1 10 Strong-CG cut generation
 submipcuts integer 0 -1 -1 2 1 10 Sub-MIP cut generation
-zerohalfcuts enumint 0 -1 1 10 Zero-half cut generation
- -1 1 Auto
- 0 1 Off
- 1 1 Conservative
- 2 1 Aggressive
+zerohalfcuts integer 0 -1 -1 2 1 10 Zero-half cut generation
 numericfocus integer 0 0 0 3 1 11 Set the numerical focus
 tunecleanup double 0 0 0 1 1 12 Enables a tuning cleanup phase
 tunecriterion integer 0 -1 -1 3 1 12 Specify tuning criterion
 tunedynamicjobs integer 0 0 -1 maxint 1 12 Enables distributed tuning using a dynamic set of workers
 tunejobs integer 0 0 0 maxint 1 12 Enables distributed tuning using a static set of workers
 tunemetric integer 0 -1 -1 1 1 12 Metric to aggregate results into a single measure
-tuneoutput enumint 0 2 1 12 Tuning output level
- 0 1 No output
- 1 1 Summary output only when a new best parameter set is found
- 2 1 Summary output for each parameter set that is tried
- 3 1 Summary output, plus detailed solver output, for each parameter set tried
+tuneoutput integer 0 2 0 3 1 12 Tuning output level
 tuneresults integer 0 -1 -2 maxint 1 12 Number of improved parameter sets returned
 tunetargetmipgap double 0 0 0 maxdouble 1 12 A target gap to be reached
 tunetargettime double 0 0.005 0 maxdouble 1 12 A target runtime in seconds to be reached
 tunetimelimit double 0 86400 0 maxdouble 1 12 Time limit for tuning
-tunetrials integer 0 0 0 maxint 1 12 Perform multiple runs on each parameter set to limit the effect ofrandom noise
+tunetrials integer 0 0 0 maxint 1 12 Perform multiple runs on each parameter set to limit the effect of random noise
 poolgap double 0 maxdouble 0 maxdouble 1 13 Relative gap for solutions in pool
 poolgapabs double 0 maxdouble 0 maxdouble 1 13 Absolute gap for solutions in pool
 poolsearchmode integer 0 0 0 2 1 13 Choose the approach used to find additional solutions
@@ -303,7 +186,7 @@ workerpassword string 0 "" 1 15 Password for distributed worker cluster
 feasrelaxbigm double 0 1e+06 0 maxdouble 1 16 Big-M value for feasibility relaxations
 funcpieceerror double 0 0.001 1e-06 1e+06 1 16 Error allowed for PWL translation of function constraint
 funcpiecelength double 0 0.01 1e-05 1e+06 1 16 Piece length for PWL translation of function constraint
-funcpieceratio double 0 -1 -1 1 1 16 Controls whether to under- or over-estimate function values in PWLapproximation
+funcpieceratio double 0 -1 -1 1 1 16 Controls whether to under- or over-estimate function values in PWL approximation
 funcpieces integer 0 0 -2 200000000 1 16 Sets strategy for PWL function approximation
  -2 Bounds the relative error of the approximation; the error bound is provided in the FuncPieceError parameter
  -1 Bounds the absolute error of the approximation; the error bound is provided in the FuncPieceError parameter
@@ -312,14 +195,12 @@ funcpieces integer 0 0 -2 200000000 1 16 Sets strategy for PWL function approxim
  >=2 Sets the number of pieces; pieces are equal width
 funcmaxval double 0 1e+06 0.01 maxdouble 1 16 Maximum value for x and y variables in function constraints
 funcnonlinear boolean 0 1 1 16 Chooses the approximation approach used to handle function constraints
- 0 Piecewise-linear approximations
- 1 Nonlinear functions
 iismethod integer 0 -1 -1 3 1 16 IIS method
 seed integer 0 0 0 maxint 1 16 Modify the random number seed
 solutiontarget enumint 0 -1 1 16 Specify the solution target for LP
- -1 1 Auto
- 0 1 primal and dual optimal, and basic
- 1 1 primal and dual optimal
+ -1 1 Automatic
+ 0 1 primal dual optimal, basic
+ 1 1 primal dual optimal
 appname string 1 "" 0 16 App Name for Gurobi license manager
 .dofuncpieceerror double 0 1e-3 1e-6 1e6 1 16 Error allowed for PWL translation of function constraints
 .dofuncpiecelength double 0 1e-2 1e-5 1e6 1 16 Piece length for PWL translation of function constraints

gamspy_gurobi/version.py

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

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

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

gamspy_gurobi-52.2.0.dist-info/RECORD

@@ -0,0 +1,12 @@
+gamspy_gurobi/__init__.py,sha256=eHxKdqMZ7ru_stD2y0irwnYwNzjYAhoQA8dfYL1OQVI,433
+gamspy_gurobi/grbcclib64.dll,sha256=BAws5Vx_sp4k1u1z5xoAOGeRP1IVPumpAWfMuV-hMaE,514560
+gamspy_gurobi/grbgetkey.exe,sha256=z34lDV8XLr8Zpc2wr89oXQGDMQh3AAllxHPNYpyQcbs,17621664
+gamspy_gurobi/grbprobe.exe,sha256=ERSGUkStel7Bo82IuzYo_UrY2dVm_hZOaCJCAu_r0to,20826040
+gamspy_gurobi/gsi.dll,sha256=pLY93qkBo_F5_QFdR48LOnV7wjvfGjyoAZmbWtYYTtk,968704
+gamspy_gurobi/gurobi130.dll,sha256=1V_frj2C3x7_-PCyd4L4HRuP53GvKO_bETVVOQdJYx4,38670296
+gamspy_gurobi/optgurobi.def,sha256=SEbTAFs0lPrd-ISHaVJnxJ1PoetxRxxb41KJ04QMt3w,20657
+gamspy_gurobi/version.py,sha256=Xw9hqiSQBvONRKP4CmKIOPViNBcVT3IYUWqB4s8BDMs,22
+gamspy_gurobi-52.2.0.dist-info/METADATA,sha256=fjSsx5m63C3VK5-yRPpfujzuoh9nV7OJb0xgFwYQ8J0,61
+gamspy_gurobi-52.2.0.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
+gamspy_gurobi-52.2.0.dist-info/top_level.txt,sha256=3w4TYVPqS1HlETRlDgAPOeLV1j-gUeKE1iJ6ds47eQI,14
+gamspy_gurobi-52.2.0.dist-info/RECORD,,

gamspy_gurobi-52.1.0.dist-info/RECORD

@@ -1,12 +0,0 @@
-gamspy_gurobi/__init__.py,sha256=eHxKdqMZ7ru_stD2y0irwnYwNzjYAhoQA8dfYL1OQVI,433
-gamspy_gurobi/grbcclib64.dll,sha256=lwqx16Ylx9FOZ27AjSmxUYICrpe1s74LOJMdm-MptWE,514560
-gamspy_gurobi/grbgetkey.exe,sha256=z34lDV8XLr8Zpc2wr89oXQGDMQh3AAllxHPNYpyQcbs,17621664
-gamspy_gurobi/grbprobe.exe,sha256=ERSGUkStel7Bo82IuzYo_UrY2dVm_hZOaCJCAu_r0to,20826040
-gamspy_gurobi/gsi.dll,sha256=DPjI0Q9u1gpXT8oUTGujpf8s4rHnRK1eT8JmOcfJxc8,969728
-gamspy_gurobi/gurobi130.dll,sha256=1V_frj2C3x7_-PCyd4L4HRuP53GvKO_bETVVOQdJYx4,38670296
-gamspy_gurobi/optgurobi.def,sha256=7f5k94s2_OjskhDTQIwgJkioEZtGuMk_3C6PxXk3eXQ,23250
-gamspy_gurobi/version.py,sha256=MJ6Omh6nCQsTTCAndvdZUVhoZ5exvmUTYWnbHM1eFpg,22
-gamspy_gurobi-52.1.0.dist-info/METADATA,sha256=i1jspRRKrTkRstD86DCrSGHluiKC013ykZOJ72ycFf0,61
-gamspy_gurobi-52.1.0.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
-gamspy_gurobi-52.1.0.dist-info/top_level.txt,sha256=3w4TYVPqS1HlETRlDgAPOeLV1j-gUeKE1iJ6ds47eQI,14
-gamspy_gurobi-52.1.0.dist-info/RECORD,,