gamspy-gurobi 49.7.0__py3-none-manylinux_2_28_aarch64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- gamspy_gurobi/__init__.py +9 -0
- gamspy_gurobi/grbgetkey +0 -0
- gamspy_gurobi/grbprobe +0 -0
- gamspy_gurobi/libgrbcclib64.so +0 -0
- gamspy_gurobi/libgurobi.so +0 -0
- gamspy_gurobi/optgurobi.def +442 -0
- gamspy_gurobi/version.py +1 -0
- gamspy_gurobi-49.7.0.dist-info/METADATA +3 -0
- gamspy_gurobi-49.7.0.dist-info/RECORD +11 -0
- gamspy_gurobi-49.7.0.dist-info/WHEEL +5 -0
- gamspy_gurobi-49.7.0.dist-info/top_level.txt +1 -0
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
import os
|
|
2
|
+
from pathlib import Path
|
|
3
|
+
from .version import __version__
|
|
4
|
+
directory = str(Path(__file__).resolve().parent)
|
|
5
|
+
|
|
6
|
+
files = ['libgurobi.so', 'grbgetkey', 'grbprobe', 'optgurobi.def', 'libgrbcclib64.so']
|
|
7
|
+
|
|
8
|
+
file_paths = [directory + os.sep + file for file in files]
|
|
9
|
+
verbatim = 'GUROBI 11 5 GUGLGD 1 0 2 LP MIP RMIP NLP DNLP RMINLP MINLP QCP MIQCP RMIQCP\ngmsgenus.run\ngmsgenux.out\nlibgrbcclib64.so grb 1 1'
|
gamspy_gurobi/grbgetkey
ADDED
|
Binary file
|
gamspy_gurobi/grbprobe
ADDED
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
@@ -0,0 +1,442 @@
|
|
|
1
|
+
*
|
|
2
|
+
* optgurobi.def
|
|
3
|
+
*
|
|
4
|
+
|
|
5
|
+
Presolve enumint 0 -1 1 5 Presolve level
|
|
6
|
+
-1 1 Auto
|
|
7
|
+
0 1 Off
|
|
8
|
+
1 1 Conservative
|
|
9
|
+
2 1 Aggressive
|
|
10
|
+
Tuning string 1 "" 1 16 Parameter Tuning
|
|
11
|
+
bariterlimit integer 0 maxint 0 maxint 1 1 Barrier iteration limit
|
|
12
|
+
bestbdstop double 0 maxdouble mindouble maxdouble 1 1 Best objective bound to stop
|
|
13
|
+
bestobjstop double 0 mindouble mindouble maxdouble 1 1 Best objective value to stop
|
|
14
|
+
cutoff double 0 maxdouble mindouble maxdouble 1 1 Objective cutoff
|
|
15
|
+
iterationlimit double 0 maxdouble 0 maxdouble 1 1 Simplex iteration limit
|
|
16
|
+
memlimit double 0 maxdouble 0 maxdouble 1 1 Memory limit
|
|
17
|
+
nodelimit double 0 maxdouble 0 maxdouble 1 1 MIP node limit
|
|
18
|
+
softmemlimit double 0 maxdouble 0 maxdouble 1 1 Soft memory limit
|
|
19
|
+
solutionlimit integer 0 maxint 1 maxint 1 1 MIP feasible solution limit
|
|
20
|
+
timelimit double 0 maxdouble 0 maxdouble 1 1 Time limit
|
|
21
|
+
worklimit double 0 maxdouble 0 maxdouble 1 1 Work limit
|
|
22
|
+
barconvtol double 0 1e-08 0 1 1 2 Barrier convergence tolerance
|
|
23
|
+
barqcpconvtol double 0 1e-06 0 1 1 2 Barrier QCP convergence tolerance
|
|
24
|
+
feasibilitytol double 0 1e-06 1e-09 0.01 1 2 Primal feasibility tolerance
|
|
25
|
+
intfeastol double 0 1e-05 1e-09 0.1 1 2 Integer feasibility tolerance
|
|
26
|
+
markowitztol double 0 0.0078125 0.0001 0.999 1 2 Threshold pivoting tolerance
|
|
27
|
+
mipgap double 0 0.0001 0 maxdouble 1 2 Relative MIP optimality gap
|
|
28
|
+
mipgapabs double 0 1e-10 0 maxdouble 1 2 Absolute MIP optimality gap
|
|
29
|
+
optimalitytol double 0 1e-06 1e-09 0.01 1 2 Dual feasibility tolerance
|
|
30
|
+
psdtol double 0 1e-06 0 maxdouble 1 2 Positive semi-definite tolerance
|
|
31
|
+
displayinterval integer 0 5 1 maxint 1 3 Frequency at which log lines are printed
|
|
32
|
+
outputflag boolean 0 1 0 3 Solver output control
|
|
33
|
+
record boolean 0 0 0 4 Enable API call recording
|
|
34
|
+
resultfile string 0 "" 0 4 Result file written upon completion of optimization
|
|
35
|
+
solfiles string 0 "" 1 4 Location to store intermediate solution files
|
|
36
|
+
aggfill integer 0 -1 -1 maxint 1 5 Allowed fill during presolve aggregation
|
|
37
|
+
aggregate integer 0 1 0 2 1 5 Presolve aggregation control
|
|
38
|
+
dualreductions boolean 0 1 1 5 Disables dual reductions in presolve
|
|
39
|
+
precrush boolean 0 0 1 5 Allows presolve to translate constraints on the original model toequivalent constraints on the presolved model
|
|
40
|
+
predeprow integer 0 -1 -1 1 1 5 Presolve dependent row reduction
|
|
41
|
+
predual integer 0 -1 -1 2 1 5 Presolve dualization
|
|
42
|
+
premiqcpform enumint 0 -1 1 5 Format of presolved MIQCP model
|
|
43
|
+
-1 1 Auto
|
|
44
|
+
0 1 Always leaves the model in MIQCP form
|
|
45
|
+
1 1 Always transforms the model into MISOCP form
|
|
46
|
+
2 1 Always transforms the model into disaggregated MISOCP form
|
|
47
|
+
prepasses integer 0 -1 -1 maxint 1 5 Presolve pass limit
|
|
48
|
+
preqlinearize enumint 0 -1 1 5 Presolve Q matrix linearization
|
|
49
|
+
-1 1 Auto
|
|
50
|
+
0 1 Linearization off
|
|
51
|
+
1 1 Force Linearization and get strong LP relaxation
|
|
52
|
+
2 1 Force Linearization and get compact relaxation
|
|
53
|
+
presos1bigm double 0 -1 -1 1e+10 1 5 Controls largest coefficient in SOS1 reformulation
|
|
54
|
+
presos1encoding integer 0 -1 -1 3 1 5 Controls SOS1 reformulation
|
|
55
|
+
presos2bigm double 0 -1 -1 1e+10 1 5 Controls largest coefficient in SOS2 reformulation
|
|
56
|
+
presos2encoding integer 0 -1 -1 3 1 5 Controls SOS2 reformulation
|
|
57
|
+
presparsify integer 0 -1 -1 2 1 5 Presolve sparsify reduction
|
|
58
|
+
-1 Auto
|
|
59
|
+
0 Disable the presolve sparsify reduction
|
|
60
|
+
1 Enable the presolve sparsify reduction for MIPs
|
|
61
|
+
2 Enable the presolve sparsify reduction for all model types
|
|
62
|
+
lpwarmstart integer 0 1 0 2 1 6 Warm start usage in simplex
|
|
63
|
+
method enumint 0 -1 1 6 Define method, e.g., Simplex, to solve continuous models
|
|
64
|
+
-1 1 Automatic
|
|
65
|
+
0 1 Primal simplex
|
|
66
|
+
1 1 Dual simplex
|
|
67
|
+
2 1 Barrier
|
|
68
|
+
3 1 Concurrent
|
|
69
|
+
4 1 Deterministic concurrent
|
|
70
|
+
5 1 Both primal and dual simplex
|
|
71
|
+
networkalg integer 0 -1 -1 1 1 6 Network simplex algorithm
|
|
72
|
+
normadjust integer 0 -1 -1 3 1 6 Simplex pricing norm
|
|
73
|
+
perturbvalue double 0 0.0002 0 maxdouble 1 6 Simplex perturbation magnitude
|
|
74
|
+
quad integer 0 -1 -1 1 1 6 Quad precision computation in simplex
|
|
75
|
+
sifting enumint 0 -1 1 6 Sifting within dual simplex
|
|
76
|
+
-1 1 Auto
|
|
77
|
+
0 1 Off
|
|
78
|
+
1 1 Moderate
|
|
79
|
+
2 1 Agressive
|
|
80
|
+
siftmethod enumint 0 -1 1 6 LP method used to solve sifting sub-problems
|
|
81
|
+
-1 1 Auto
|
|
82
|
+
0 1 Primal Simplex
|
|
83
|
+
1 1 Dual Simplex
|
|
84
|
+
2 1 Barrier
|
|
85
|
+
simplexpricing enumint 0 -1 1 6 Simplex variable pricing strategy
|
|
86
|
+
-1 1 Auto
|
|
87
|
+
0 1 Partial Pricing
|
|
88
|
+
1 1 Steepest Edge
|
|
89
|
+
2 1 Devex
|
|
90
|
+
3 1 Quick-Start Steepest Edge
|
|
91
|
+
barcorrectors integer 0 -1 -1 maxint 1 7 Central correction limit
|
|
92
|
+
barhomogeneous enumint 0 -1 1 7 Barrier homogeneous algorithm
|
|
93
|
+
-1 1 Auto
|
|
94
|
+
0 1 Homogeneous Barrier off
|
|
95
|
+
1 1 Force Homogeneous Barrier on
|
|
96
|
+
barorder enumint 0 -1 1 7 Barrier ordering algorithm
|
|
97
|
+
-1 1 Auto
|
|
98
|
+
0 1 Approximate Minimum Degree ordering
|
|
99
|
+
1 1 Nested Dissection ordering
|
|
100
|
+
crossover integer 0 -1 -1 5 1 7 Barrier crossover strategy
|
|
101
|
+
crossoverbasis enumint 0 -1 1 7 Crossover initial basis construction strategy
|
|
102
|
+
-1 1 Auto
|
|
103
|
+
0 1 Chooses an initial basis quickly
|
|
104
|
+
1 1 Can take much longer, but often produces a more numerically stable start basis
|
|
105
|
+
qcpdual boolean 0 0 1 7 Compute dual variables for QCP models
|
|
106
|
+
0 Do not compute dual for QCP problem
|
|
107
|
+
1 Compute dual for QCP problem
|
|
108
|
+
objscale double 0 0 -1 maxdouble 1 8 Objective scaling
|
|
109
|
+
scaleflag integer 0 -1 -1 3 1 8 Model scaling
|
|
110
|
+
branchdir enumint 0 0 1 9 Branch direction preference
|
|
111
|
+
-1 1 Always explore the down branch first
|
|
112
|
+
0 1 Automatic
|
|
113
|
+
1 1 Always explore the up branch first
|
|
114
|
+
concurrentjobs integer 0 0 0 maxint 1 9 Enables distributed concurrent solver
|
|
115
|
+
concurrentmethod enumint 0 -1 1 9 Chooses continuous solvers to run concurrently
|
|
116
|
+
-1 1 Auto
|
|
117
|
+
0 1 barrier, dual, primal simplex
|
|
118
|
+
1 1 barrier and dual simplex
|
|
119
|
+
2 1 barrier and primal simplex
|
|
120
|
+
3 1 dual and primal simplex
|
|
121
|
+
concurrentmip integer 0 1 1 64 1 9 Enables concurrent MIP solver
|
|
122
|
+
degenmoves integer 0 -1 -1 maxint 1 9 Degenerate simplex moves
|
|
123
|
+
disconnected enumint 0 -1 1 9 Disconnected component strategy
|
|
124
|
+
-1 1 Auto
|
|
125
|
+
0 1 Ignores structure entirely
|
|
126
|
+
1 1 Conservative
|
|
127
|
+
2 1 Aggressive
|
|
128
|
+
distributedmipjobs integer 0 0 0 maxint 1 9 Enables the distributed MIP solver
|
|
129
|
+
heuristics double 0 0.05 0 1 1 9 Turn MIP heuristics up or down
|
|
130
|
+
improvestartgap double 0 0 0 maxdouble 1 9 Trigger solution improvement
|
|
131
|
+
improvestartnodes double 0 maxdouble 0 maxdouble 1 9 Trigger solution improvement
|
|
132
|
+
improvestarttime double 0 maxdouble 0 maxdouble 1 9 Trigger solution improvement
|
|
133
|
+
integralityfocus boolean 0 0 1 9 Set the integrality focus
|
|
134
|
+
0 Disable the integrality focus
|
|
135
|
+
1 Enable the integrality focus
|
|
136
|
+
minrelnodes integer 0 -1 -1 maxint 1 9 Minimum relaxation heuristic control
|
|
137
|
+
mipfocus enumint 0 0 1 9 Set the focus of the MIP solver
|
|
138
|
+
0 1 Balance between finding good feasible solutions and proving optimality
|
|
139
|
+
1 1 Focus towards finding feasible solutions
|
|
140
|
+
2 1 Focus towards proving optimality
|
|
141
|
+
3 1 Focus on moving the best objective bound
|
|
142
|
+
miqcpmethod enumint 0 -1 1 9 Method used to solve MIQCP models
|
|
143
|
+
-1 1 Auto
|
|
144
|
+
0 1 Continuous QCP relaxations at each node
|
|
145
|
+
1 1 Linearized, outer-approximation approach
|
|
146
|
+
nlpheur boolean 0 1 1 9 Controls the NLP heuristic for non-convex quadratic models
|
|
147
|
+
nodefiledir string 0 "." 1 9 Directory for MIP node files
|
|
148
|
+
nodefilestart double 0 maxdouble 0 maxdouble 1 9 Memory threshold for writing MIP tree nodes to disk
|
|
149
|
+
nodemethod enumint 0 -1 1 9 Method used to solve MIP node relaxations
|
|
150
|
+
-1 1 Automatic
|
|
151
|
+
0 1 Primal simplex
|
|
152
|
+
1 1 Dual simplex
|
|
153
|
+
2 1 Barrier
|
|
154
|
+
nonconvex integer 0 -1 -1 2 1 9 Control how to deal with non-convex quadratic programs
|
|
155
|
+
norelheurtime double 0 0 0 maxdouble 1 9 Limits the amount of time (in seconds) spent in the NoRel heuristic
|
|
156
|
+
norelheurwork double 0 0 0 maxdouble 1 9 Limits the amount of work performed by the NoRel heuristic
|
|
157
|
+
obbt integer 0 -1 -1 3 1 9 Controls aggressiveness of optimality-based bound tightening
|
|
158
|
+
partitionplace integer 0 15 0 31 1 9 Controls when the partition heuristic runs
|
|
159
|
+
pumppasses integer 0 -1 -1 maxint 1 9 Feasibility pump heuristic control
|
|
160
|
+
rins integer 0 -1 -1 maxint 1 9 RINS heuristic
|
|
161
|
+
startnodelimit integer 0 -1 -3 maxint 1 9 Node limit for MIP start sub-MIP
|
|
162
|
+
submipnodes integer 0 500 0 maxint 1 9 Nodes explored by sub-MIP heuristics
|
|
163
|
+
symmetry enumint 0 -1 1 9 Symmetry detection
|
|
164
|
+
-1 1 Auto
|
|
165
|
+
0 1 Off
|
|
166
|
+
1 1 Conservative
|
|
167
|
+
2 1 Aggressive
|
|
168
|
+
varbranch enumint 0 -1 1 9 Branch variable selection strategy
|
|
169
|
+
-1 1 Auto
|
|
170
|
+
0 1 Pseudo Reduced Cost Branching
|
|
171
|
+
1 1 Pseudo Shadow Price Branching
|
|
172
|
+
2 1 Maximum Infeasibility Branching
|
|
173
|
+
3 1 Strong Branching
|
|
174
|
+
zeroobjnodes integer 0 -1 -1 maxint 1 9 Zero objective heuristic control
|
|
175
|
+
bqpcuts enumint 0 -1 1 10 BQP cut generation
|
|
176
|
+
-1 1 Auto
|
|
177
|
+
0 1 Off
|
|
178
|
+
1 1 Conservative
|
|
179
|
+
2 1 Aggressive
|
|
180
|
+
cuts enumint 0 -1 1 10 Global cut generation control
|
|
181
|
+
-1 1 Auto
|
|
182
|
+
0 1 Off
|
|
183
|
+
1 1 Conservative
|
|
184
|
+
2 1 Aggressive
|
|
185
|
+
3 1 Very aggressive
|
|
186
|
+
cliquecuts enumint 0 -1 1 10 Clique cut generation
|
|
187
|
+
-1 1 Auto
|
|
188
|
+
0 1 Off
|
|
189
|
+
1 1 Conservative
|
|
190
|
+
2 1 Aggressive
|
|
191
|
+
covercuts enumint 0 -1 1 10 Cover cut generation
|
|
192
|
+
-1 1 Auto
|
|
193
|
+
0 1 Off
|
|
194
|
+
1 1 Conservative
|
|
195
|
+
2 1 Aggressive
|
|
196
|
+
cutaggpasses integer 0 -1 -1 maxint 1 10 Constraint aggregation passes performed during cut generation
|
|
197
|
+
cutpasses integer 0 -1 -1 maxint 1 10 Root cutting plane pass limit
|
|
198
|
+
dualimpliedcuts integer 0 -1 -1 2 1 10 Dual implied bound cut generation
|
|
199
|
+
flowcovercuts enumint 0 -1 1 10 Flow cover cut generation
|
|
200
|
+
-1 1 Auto
|
|
201
|
+
0 1 Off
|
|
202
|
+
1 1 Conservative
|
|
203
|
+
2 1 Aggressive
|
|
204
|
+
flowpathcuts enumint 0 -1 1 10 Flow path cut generation
|
|
205
|
+
-1 1 Auto
|
|
206
|
+
0 1 Off
|
|
207
|
+
1 1 Conservative
|
|
208
|
+
2 1 Aggressive
|
|
209
|
+
gomorypasses integer 0 -1 -1 maxint 1 10 Root Gomory cut pass limit
|
|
210
|
+
gubcovercuts enumint 0 -1 1 10 GUB cover cut generation
|
|
211
|
+
-1 1 Auto
|
|
212
|
+
0 1 Off
|
|
213
|
+
1 1 Conservative
|
|
214
|
+
2 1 Aggressive
|
|
215
|
+
impliedcuts enumint 0 -1 1 10 Implied bound cut generation
|
|
216
|
+
-1 1 Auto
|
|
217
|
+
0 1 Off
|
|
218
|
+
1 1 Conservative
|
|
219
|
+
2 1 Aggressive
|
|
220
|
+
infproofcuts integer 0 -1 -1 2 1 10 Infeasibility proof cut generation
|
|
221
|
+
liftprojectcuts integer 0 -1 -1 2 1 10 Lift-and-project cut generation
|
|
222
|
+
mipsepcuts enumint 0 -1 1 10 MIP separation cut generation
|
|
223
|
+
-1 1 Auto
|
|
224
|
+
0 1 Off
|
|
225
|
+
1 1 Conservative
|
|
226
|
+
2 1 Aggressive
|
|
227
|
+
mircuts enumint 0 -1 1 10 MIR cut generation
|
|
228
|
+
-1 1 Auto
|
|
229
|
+
0 1 Off
|
|
230
|
+
1 1 Conservative
|
|
231
|
+
2 1 Aggressive
|
|
232
|
+
mixingcuts integer 0 -1 -1 2 1 10 Mixing cut generation
|
|
233
|
+
modkcuts integer 0 -1 -1 2 1 10 Mod-k cut generation
|
|
234
|
+
networkcuts enumint 0 -1 1 10 Network cut generation
|
|
235
|
+
-1 1 Auto
|
|
236
|
+
0 1 Off
|
|
237
|
+
1 1 Conservative
|
|
238
|
+
2 1 Aggressive
|
|
239
|
+
projimpliedcuts enumint 0 -1 1 10 Projected implied bound cut generation
|
|
240
|
+
-1 1 Auto
|
|
241
|
+
0 1 Off
|
|
242
|
+
1 1 Moderate
|
|
243
|
+
2 1 Aggressive
|
|
244
|
+
psdcuts enumint 0 -1 1 10 PSD cut generation
|
|
245
|
+
-1 1 Auto
|
|
246
|
+
0 1 Off
|
|
247
|
+
1 1 Moderate
|
|
248
|
+
2 1 Aggressive
|
|
249
|
+
relaxliftcuts enumint 0 -1 1 10 Relax-and-lift cut generation
|
|
250
|
+
-1 1 Auto
|
|
251
|
+
0 1 Off
|
|
252
|
+
1 1 Conservative
|
|
253
|
+
2 1 Aggressive
|
|
254
|
+
rltcuts enumint 0 -1 1 10 RLT cut generation
|
|
255
|
+
-1 1 Auto
|
|
256
|
+
0 1 Off
|
|
257
|
+
1 1 Conservative
|
|
258
|
+
2 1 Aggressive
|
|
259
|
+
strongcgcuts integer 0 -1 -1 2 1 10 Strong-CG cut generation
|
|
260
|
+
submipcuts integer 0 -1 -1 2 1 10 Sub-MIP cut generation
|
|
261
|
+
zerohalfcuts enumint 0 -1 1 10 Zero-half cut generation
|
|
262
|
+
-1 1 Auto
|
|
263
|
+
0 1 Off
|
|
264
|
+
1 1 Conservative
|
|
265
|
+
2 1 Aggressive
|
|
266
|
+
numericfocus integer 0 0 0 3 1 11 Set the numerical focus
|
|
267
|
+
tunecleanup double 0 0 0 1 1 12 Enables a tuning cleanup phase
|
|
268
|
+
tunecriterion integer 0 -1 -1 3 1 12 Specify tuning criterion
|
|
269
|
+
tunedynamicjobs integer 0 0 -1 maxint 1 12 Enables distributed tuning using a dynamic set of workers
|
|
270
|
+
tunejobs integer 0 0 0 maxint 1 12 Enables distributed tuning using a static set of workers
|
|
271
|
+
tunemetric integer 0 -1 -1 1 1 12 Metric to aggregate results into a single measure
|
|
272
|
+
tuneoutput enumint 0 2 1 12 Tuning output level
|
|
273
|
+
0 1 No output
|
|
274
|
+
1 1 Summary output only when a new best parameter set is found
|
|
275
|
+
2 1 Summary output for each parameter set that is tried
|
|
276
|
+
3 1 Summary output, plus detailed solver output, for each parameter set tried
|
|
277
|
+
tuneresults integer 0 -1 -2 maxint 1 12 Number of improved parameter sets returned
|
|
278
|
+
tunetargetmipgap double 0 0 0 maxdouble 1 12 A target gap to be reached
|
|
279
|
+
tunetargettime double 0 0.005 0 maxdouble 1 12 A target runtime in seconds to be reached
|
|
280
|
+
tunetimelimit double 0 maxdouble 0 maxdouble 1 12 Time limit for tuning
|
|
281
|
+
tunetrials integer 0 0 0 maxint 1 12 Perform multiple runs on each parameter set to limit the effect ofrandom noise
|
|
282
|
+
poolgap double 0 maxdouble 0 maxdouble 1 13 Relative gap for solutions in pool
|
|
283
|
+
poolgapabs double 0 maxdouble 0 maxdouble 1 13 Absolute gap for solutions in pool
|
|
284
|
+
poolsearchmode integer 0 0 0 2 1 13 Choose the approach used to find additional solutions
|
|
285
|
+
poolsolutions integer 0 10 1 maxint 1 13 Number of solutions to keep in pool
|
|
286
|
+
multiobjmethod integer 0 -1 -1 2 1 14 Warm-start method to solve for subsequent objectives
|
|
287
|
+
multiobjpre integer 0 -1 -1 2 1 14 Initial presolve on multi-objective models
|
|
288
|
+
threads integer 0 0 -128 1024 1 15 Number of parallel threads to use
|
|
289
|
+
workerpassword string 0 "" 1 15 Password for distributed worker cluster
|
|
290
|
+
feasrelaxbigm double 0 1e+06 0 maxdouble 1 16 Big-M value for feasibility relaxations
|
|
291
|
+
funcpieceerror double 0 0.001 1e-06 1e+06 1 16 Error allowed for PWL translation of function constraint
|
|
292
|
+
funcpiecelength double 0 0.01 1e-05 1e+06 1 16 Piece length for PWL translation of function constraint
|
|
293
|
+
funcpieceratio double 0 -1 -1 1 1 16 Controls whether to under- or over-estimate function values in PWLapproximation
|
|
294
|
+
funcpieces integer 0 0 -2 200000000 1 16 Sets strategy for PWL function approximation
|
|
295
|
+
-2 Bounds the relative error of the approximation; the error bound is provided in the FuncPieceError parameter
|
|
296
|
+
-1 Bounds the absolute error of the approximation; the error bound is provided in the FuncPieceError parameter
|
|
297
|
+
0 Automatic PWL approximation
|
|
298
|
+
1 Uses a fixed width for each piece; the actual width is provided in the FuncPieceLength parameter
|
|
299
|
+
>=2 Sets the number of pieces; pieces are equal width
|
|
300
|
+
funcmaxval double 0 1e+06 0.01 maxdouble 1 16 Maximum value for x and y variables in function constraints
|
|
301
|
+
funcnonlinear boolean 0 1 1 16 Chooses the approximation approach used to handle function constraints
|
|
302
|
+
0 Piecewise-linear approximations
|
|
303
|
+
1 Nonlinear functions
|
|
304
|
+
iismethod integer 0 -1 -1 3 1 16 IIS method
|
|
305
|
+
seed integer 0 0 0 maxint 1 16 Modify the random number seed
|
|
306
|
+
solutiontarget enumint 0 -1 1 16 Specify the solution target for LP
|
|
307
|
+
-1 1 Auto
|
|
308
|
+
0 1 primal and dual optimal, and basic
|
|
309
|
+
1 1 primal and dual optimal
|
|
310
|
+
appname string 1 "" 0 16 App Name for Gurobi license manager
|
|
311
|
+
.dofuncpieceerror double 0 1e-3 1e-6 1e6 1 16 Error allowed for PWL translation of function constraints
|
|
312
|
+
.dofuncpiecelength double 0 1e-2 1e-5 1e6 1 16 Piece length for PWL translation of function constraints
|
|
313
|
+
.dofuncpieceratio double 0 -1 -1 1 1 16 Control whether to under- or over-estimate function values in PWL approximation
|
|
314
|
+
.dofuncpieces integer 0 0 -2 maxint 1 16 Sets strategy for PWL function approximation
|
|
315
|
+
-2 Bounds the relative error of the approximation; the error bound is provided in the FuncPieceError parameter
|
|
316
|
+
-1 Bounds the absolute error of the approximation; the error bound is provided in the FuncPieceError parameter
|
|
317
|
+
0 Automatic based on relative error approach
|
|
318
|
+
1 Uses a fixed width for each piece; the actual width is provided in the FuncPieceLength parameter
|
|
319
|
+
>=2 Sets the number of pieces; pieces are equal width
|
|
320
|
+
dummy string 0 "" 0 16 Pass a parameter string to gurobi directly
|
|
321
|
+
dumpbcsol string 1 "" 1 9 Dump incumbents to GDX files during branch-and-cut
|
|
322
|
+
feasopt boolean 1 0 1 16 Computes a minimum-cost relaxation to make an infeasible model feasible
|
|
323
|
+
0 Turns Feasible Relaxation off
|
|
324
|
+
1 Turns Feasible Relaxation on
|
|
325
|
+
feasoptmode enumint 1 0 1 16 Mode of FeasOpt
|
|
326
|
+
0 1 Minimize sum of relaxations
|
|
327
|
+
1 1 Minimize sum of relaxations and optimize
|
|
328
|
+
2 1 Minimize number of relaxations
|
|
329
|
+
3 1 Minimize number of relaxations and optimize
|
|
330
|
+
4 1 Minimize sum of squares of relaxations
|
|
331
|
+
5 1 Minimize sum of squares of relaxations and optimize
|
|
332
|
+
.feaspref double 1 1 0 1e+020 1 16 feasibility preference
|
|
333
|
+
fixoptfile string 1 "" 1 9 Option file for fixed problem optimization
|
|
334
|
+
freegamsmodel boolean 1 0 1 16 Preserves memory by dumping the GAMS model instance representation temporarily to disk
|
|
335
|
+
.genconstrtype integer 1 0 0 17 0 16 General constraint type
|
|
336
|
+
iis integer 1 0 0 2 1 16 Run the Irreducible Inconsistent Subsystem (IIS) finder if the problem is infeasible
|
|
337
|
+
0 No conflict analysis
|
|
338
|
+
1 Conflict analysis after solve if infeasible
|
|
339
|
+
2 Conflict analysis without previous solve
|
|
340
|
+
isvname string 1 "" 0 16 ISV Name for Gurobi license manager
|
|
341
|
+
kappa boolean 1 0 1 16 Display approximate condition number estimates for the optimal simplex basis
|
|
342
|
+
0 Do not compute and display approximate condition number
|
|
343
|
+
1 Compute and display approximate condition number
|
|
344
|
+
kappaexact boolean 1 0 1 16 Display exact condition number estimates for the optimal simplex basis
|
|
345
|
+
0 Do not compute and display exact condition number
|
|
346
|
+
1 Compute and display exact condition number
|
|
347
|
+
.lazy integer 1 0 -1 3 1 9 Lazy constraints value
|
|
348
|
+
lazyconstraints boolean 1 0 1 9 Indicator to use lazy constraints
|
|
349
|
+
mipstart boolean 1 0 1 9 Use mip starting values
|
|
350
|
+
0 Do not use the values
|
|
351
|
+
1 Use the values
|
|
352
|
+
mipstopexpr strlist 1 1 9 Stop expression for branch and bound
|
|
353
|
+
miptrace string 1 "" 1 16 Filename of MIP trace file
|
|
354
|
+
miptracenode integer 1 100 0 maxint 1 16 Node interval when a trace record is written
|
|
355
|
+
miptracetime double 1 1 0 maxdouble 1 16 Time interval when a trace record is written
|
|
356
|
+
multimipstart strlist 1 1 9 Use multiple (partial) mipstarts provided via gdx files
|
|
357
|
+
multobj boolean 1 0 1 16 Controls the hierarchical optimization of multiple objectives
|
|
358
|
+
names boolean 1 1 1 16 Indicator for loading names
|
|
359
|
+
0 Do not load GAMS names into Gurobi model
|
|
360
|
+
1 Load GAMS names into Gurobi model
|
|
361
|
+
nobounds immediate nobounds 0 16 Ignores bounds on options
|
|
362
|
+
objnabstol strlist 1 1 16 Allowable absolute degradation for objective
|
|
363
|
+
objnreltol strlist 1 1 16 Allowable relative degradation for objective
|
|
364
|
+
.partition integer 1 0 -1 maxint 1 9 Variable partition value
|
|
365
|
+
printoptions boolean 1 0 1 16 List values of all options to GAMS listing file
|
|
366
|
+
0 Do not list option values to GAMS listing file
|
|
367
|
+
1 List option values to GAMS listing file
|
|
368
|
+
.prior double 1 1 1 maxdouble 1 9 Branching priorities
|
|
369
|
+
probread string 1 "" 0 16 Supply a problem via a Gurobi input file
|
|
370
|
+
qextractalg enumint 1 0 1 16 quadratic extraction algorithm in GAMS interface
|
|
371
|
+
0 1 Automatic
|
|
372
|
+
1 1 ThreePass: Uses a three-pass forward / backward / forward AD technique to compute function / gradient / Hessian values and a hybrid scheme for storage.
|
|
373
|
+
2 1 DoubleForward: Uses forward-mode AD to compute and store function, gradient, and Hessian values at each node or stack level as required. The gradients and Hessians are stored in linked lists.
|
|
374
|
+
3 1 Concurrent: Uses ThreePass and DoubleForward in parallel. As soon as one finishes, the other one stops.
|
|
375
|
+
readfile immediate readfile 0 16 Read secondary option file
|
|
376
|
+
readparams string 1 "" 1 16 Read Gurobi parameter file
|
|
377
|
+
rerun enumint 1 -1 1 16 Resolve without presolve in case of unbounded or infeasible
|
|
378
|
+
-1 1 No
|
|
379
|
+
0 1 Auto
|
|
380
|
+
1 1 Yes
|
|
381
|
+
rngrestart string 1 "" 1 16 Write GAMS readable ranging information file
|
|
382
|
+
sensitivity boolean 1 0 1 16 Provide sensitivity information
|
|
383
|
+
0 Do not provide sensitivity information
|
|
384
|
+
1 Provide sensitivity information
|
|
385
|
+
solnpool string 1 "" 1 9 Controls export of alternate MIP solutions
|
|
386
|
+
solnpoolmerge string 1 "" 1 9 Controls export of alternate MIP solutions for merged GDX solution file
|
|
387
|
+
solnpoolnumsym integer 0 10 1 maxint 1 9 Maximum number of variable symbols when writing merged GDX solution file
|
|
388
|
+
solnpoolprefix string 0 "soln" 1 9 First dimension of variables for merged GDX solution file or file name prefix for GDX solution files
|
|
389
|
+
solvefixed boolean 1 1 1 9 Indicator for solving the fixed problem for a MIP to get a dual solution
|
|
390
|
+
0 Do not solve the fixed problem
|
|
391
|
+
1 Solve the fixed problem
|
|
392
|
+
.trynonlin boolean 1 1 1 16 Try nonlinear function general constraint interface for nonlinear constraint
|
|
393
|
+
usebasis enumint 1 0 1 16 Use basis from GAMS
|
|
394
|
+
0 1 No basis
|
|
395
|
+
1 1 Supply basis if basis is full otherwise provide primal dual solution
|
|
396
|
+
2 1 Supply basis iff basis is full
|
|
397
|
+
3 1 Supply primal dual solution
|
|
398
|
+
varhint boolean 1 0 1 16 Guide heuristics and branching through variable hints
|
|
399
|
+
workerpool strlist 2 1 15 Distributed worker cluster
|
|
400
|
+
writeparams string 1 "" 1 16 Write Gurobi parameter file
|
|
401
|
+
writeprob string 1 "" 1 16 Save the problem instance
|
|
402
|
+
*
|
|
403
|
+
* synonym section
|
|
404
|
+
*
|
|
405
|
+
lpmethod synonym method
|
|
406
|
+
rootmethod synonym method
|
|
407
|
+
concurrentmipjobs synonym concurrentjobs
|
|
408
|
+
dumpsolution synonym solnpool
|
|
409
|
+
*
|
|
410
|
+
* indicator section
|
|
411
|
+
*
|
|
412
|
+
indic indicator
|
|
413
|
+
*
|
|
414
|
+
* deprecated section
|
|
415
|
+
*
|
|
416
|
+
gurobi3 deprecated
|
|
417
|
+
lpmethod Use option method to specify algorithm used for LP and QP problems
|
|
418
|
+
rootmethod Use option method to specify algorithm used for root node
|
|
419
|
+
synon deprecated
|
|
420
|
+
concurrentmipjobs
|
|
421
|
+
dumpsolution
|
|
422
|
+
*
|
|
423
|
+
* Groups
|
|
424
|
+
* <group-ident> group <group-number <help-context> <help-text>
|
|
425
|
+
*
|
|
426
|
+
Termination group 1 1 Termination options
|
|
427
|
+
Tolerances group 2 1 Tolerances options
|
|
428
|
+
Logging group 3 1 Logging options
|
|
429
|
+
Output group 4 1 Output options
|
|
430
|
+
Presolve group 5 1 Presolve options
|
|
431
|
+
Simplex group 6 1 Simplex options
|
|
432
|
+
Barrier group 7 1 Barrier options
|
|
433
|
+
Scaling group 8 1 Scaling options
|
|
434
|
+
MIP group 9 1 MIP options
|
|
435
|
+
MIPCuts group 10 1 MIP Cuts options
|
|
436
|
+
Numerics group 11 1 Numerics options
|
|
437
|
+
Tuning group 12 1 Tuning options
|
|
438
|
+
MultipleSolutions group 13 1 Multiple Solutions options
|
|
439
|
+
MultipleObjectives group 14 1 Multiple Objectives options
|
|
440
|
+
ParallelandDistributedComputing group 15 1 Parallel and Distributed Computing options
|
|
441
|
+
Other group 16 1 Other options
|
|
442
|
+
*** End of file
|
gamspy_gurobi/version.py
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
__version__ = '49.7.0'
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
gamspy_gurobi/__init__.py,sha256=8xHg8CtDElz1qY9RUFH-Ap1I6KwpdR9-TK7zV6uyhCE,408
|
|
2
|
+
gamspy_gurobi/grbgetkey,sha256=G8t5HVSF75dRqdkiggWYYiTLrMZksccqEIIVwAfPRA8,10687784
|
|
3
|
+
gamspy_gurobi/grbprobe,sha256=60O23Gx1dkM2vs0YS47Zmja0M6vXE4pBSCPpllUhUr8,12013656
|
|
4
|
+
gamspy_gurobi/libgrbcclib64.so,sha256=elBDoHRzlsC4nGLVoU19f-ZZ70gnSngt3ljyGmaKrRk,534832
|
|
5
|
+
gamspy_gurobi/libgurobi.so,sha256=L62pT7M8wtrFIOcbs0K4LLpcnK1nmiiZlWRb-YGSS0Y,118885728
|
|
6
|
+
gamspy_gurobi/optgurobi.def,sha256=ZmTclmMzi9Jgn5eiUePjaqsVnnFQOB8XJiOHUhDAQCA,21139
|
|
7
|
+
gamspy_gurobi/version.py,sha256=UsATtH8H35cUKz_5YgGCC4BOnDoemmYVZxz0XW_gosg,22
|
|
8
|
+
gamspy_gurobi-49.7.0.dist-info/METADATA,sha256=nAiraa2zQzVGbH1QtTvsCjeUYHcmSfoEClLwDMFRrFs,58
|
|
9
|
+
gamspy_gurobi-49.7.0.dist-info/WHEEL,sha256=t5_TVo5EoIcKNBhWzfot9g64ilMSG_CsDKeV6kLKeBo,116
|
|
10
|
+
gamspy_gurobi-49.7.0.dist-info/top_level.txt,sha256=3w4TYVPqS1HlETRlDgAPOeLV1j-gUeKE1iJ6ds47eQI,14
|
|
11
|
+
gamspy_gurobi-49.7.0.dist-info/RECORD,,
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
gamspy_gurobi
|