gamspy-copt 52.1.0__py3-none-manylinux_2_28_x86_64.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_copt/__init__.py +9 -0
- gamspy_copt/libcopt.so +0 -0
- gamspy_copt/libcptcclib64.so +0 -0
- gamspy_copt/optcopt.def +258 -0
- gamspy_copt/version.py +1 -0
- gamspy_copt-52.1.0.dist-info/METADATA +3 -0
- gamspy_copt-52.1.0.dist-info/RECORD +9 -0
- gamspy_copt-52.1.0.dist-info/WHEEL +5 -0
- gamspy_copt-52.1.0.dist-info/top_level.txt +1 -0
gamspy_copt/__init__.py
ADDED
|
@@ -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 = ['libcopt.so', 'optcopt.def', 'libcptcclib64.so']
|
|
7
|
+
|
|
8
|
+
file_paths = [directory + os.sep + file for file in files]
|
|
9
|
+
verbatim = 'COPT 1011 5 CT 1 0 2 LP MIP RMIP QCP MIQCP RMIQCP\ngmsgenus.run\ngmsgenux.out\nlibcptcclib64.so cpt 1 1'
|
gamspy_copt/libcopt.so
ADDED
|
Binary file
|
|
Binary file
|
gamspy_copt/optcopt.def
ADDED
|
@@ -0,0 +1,258 @@
|
|
|
1
|
+
* This file is autogenerated by optcopt.
|
|
2
|
+
.feaspref double 12 1 0 maxdouble 1 7 preference to include variable bound or equation side into feasibility relaxation
|
|
3
|
+
AbsGap double 0 0 0 maxdouble 1 1 The absolute gap for MIP
|
|
4
|
+
BarHomogeneous enumint 0 -1 1 3 Whether to use homogeneous self-dual form in barrier
|
|
5
|
+
-1 1 Choose automatically.
|
|
6
|
+
0 1 No.
|
|
7
|
+
1 1 Yes.
|
|
8
|
+
BarIterLimit integer 0 maxint 0 maxint 1 1 Barrier iteration limit
|
|
9
|
+
BarOrder enumint 0 -1 1 3 Ordering method for barrier
|
|
10
|
+
-1 1 Choose automatically.
|
|
11
|
+
0 1 Approximate Minimum Degree (AMD).
|
|
12
|
+
1 1 Nested Dissection (ND).
|
|
13
|
+
2 1 Nested Dissection 2 (ND2)
|
|
14
|
+
BarStart enumint 0 -1 1 3 Starting point method for barrier
|
|
15
|
+
-1 1 Choose automatically.
|
|
16
|
+
0 1 Simple.
|
|
17
|
+
1 1 Mehrotra.
|
|
18
|
+
2 1 Modified Mehrotra.
|
|
19
|
+
BarThreads integer 0 -1 -1 128 1 6 Number of threads to use in the barrier solver
|
|
20
|
+
ConflictAnalysis enumint 0 -1 1 4 Whether to perform conflict analysis
|
|
21
|
+
-1 1 Automatic.
|
|
22
|
+
0 1 No.
|
|
23
|
+
1 1 Yes.
|
|
24
|
+
Crossover enumint 0 1 1 3 Whether to run crossover after barrier
|
|
25
|
+
-1 1 Choose automatically. Only run crossover when the LP solution is not primal-dual feasible.
|
|
26
|
+
0 1 No.
|
|
27
|
+
1 1 Yes.
|
|
28
|
+
CrossoverThreads integer 0 -1 -1 128 1 6 Number of threads to use in the crossover
|
|
29
|
+
CutLevel enumint 0 -1 1 4 Level of cutting planes generation
|
|
30
|
+
-1 1 Automatic.
|
|
31
|
+
0 1 Off.
|
|
32
|
+
1 1 Fast.
|
|
33
|
+
2 1 Normal.
|
|
34
|
+
3 1 Aggressive.
|
|
35
|
+
DivingHeurLevel enumint 0 -1 1 4 Level of diving heuristics
|
|
36
|
+
-1 1 Automatic.
|
|
37
|
+
0 1 Off.
|
|
38
|
+
1 1 Fast.
|
|
39
|
+
2 1 Normal.
|
|
40
|
+
3 1 Aggressive.
|
|
41
|
+
Dualize enumint 0 -1 1 2 Whether to dualize a problem before solving it
|
|
42
|
+
-1 1 Choose automatically.
|
|
43
|
+
0 1 No dualizing.
|
|
44
|
+
1 1 Dualizing the problem.
|
|
45
|
+
DualPerturb enumint 0 -1 1 3 Whether to allow the objective function perturbation
|
|
46
|
+
-1 1 Choose automatically.
|
|
47
|
+
0 1 No perturbation.
|
|
48
|
+
1 1 Allow objective function perturbation.
|
|
49
|
+
DualPrice enumint 0 -1 1 3 Specifies the dual simplex pricing algorithm
|
|
50
|
+
-1 1 Choose automatically.
|
|
51
|
+
0 1 Using Devex pricing algorithm.
|
|
52
|
+
1 1 Using dual steepest-edge pricing algorithm .
|
|
53
|
+
DualTol double 0 1e-06 1e-09 0.0001 1 1 The tolerance for dual solutions and reduced cost
|
|
54
|
+
FAPHeurLevel enumint 0 -1 1 4 Level of fix-and-propagate heuristics
|
|
55
|
+
-1 1 Automatic.
|
|
56
|
+
0 1 Off.
|
|
57
|
+
1 1 Fast.
|
|
58
|
+
2 1 Normal.
|
|
59
|
+
3 1 Aggressive.
|
|
60
|
+
4 1 Very aggressive.
|
|
61
|
+
FeasRelax boolean 11 0 1 7 whether to compute a feasible relaxation instead of solving the problem
|
|
62
|
+
FeasRelaxMode enumint 0 0 1 7 Specifies the feasibility relaxation mode
|
|
63
|
+
0 1 Minimize sum of violations.
|
|
64
|
+
1 1 Optimize original objective function under minimal sum of violations.
|
|
65
|
+
2 1 Minimize number of violations.
|
|
66
|
+
3 1 Optimize original objective function under minimal number of violations.
|
|
67
|
+
4 1 Minimize sum of squared violations.
|
|
68
|
+
5 1 Optimize original objective function under minimal sum of squared violations.
|
|
69
|
+
FeasTol double 0 1e-06 1e-09 0.0001 1 1 The feasibility tolerance
|
|
70
|
+
GPUDevice integer 0 -1 -1 maxint 1 3 Specifies GPU device to use (-1: auto)
|
|
71
|
+
GPUMode enumint 0 -1 1 3 Specifies GPU mode
|
|
72
|
+
-1 1 Choose automatically.
|
|
73
|
+
0 1 Force the use of CPU mode.
|
|
74
|
+
1 1 Attempt to use the standard GPU mode.
|
|
75
|
+
2 1 For the barrier method, attempt to use the high-performance GPU mode when solving LP problems, which may lead to higher memory usage.
|
|
76
|
+
HeurLevel enumint 0 -1 1 4 Level of heuristics
|
|
77
|
+
-1 1 Automatic.
|
|
78
|
+
0 1 Off.
|
|
79
|
+
1 1 Fast.
|
|
80
|
+
2 1 Normal.
|
|
81
|
+
3 1 Aggressive.
|
|
82
|
+
iis enumint 10 0 1 7 whether to compute an Irreducible Inconsistent Subsystem (IIS) if the problem is infeasible
|
|
83
|
+
0 1 no
|
|
84
|
+
1 1 compute IIS after solve if infeasible
|
|
85
|
+
2 1 compute IIS without solving original problem
|
|
86
|
+
IISMethod enumint 0 -1 1 7 Specifies the IIS method
|
|
87
|
+
-1 1 Automatic.
|
|
88
|
+
0 1 Find smaller IIS.
|
|
89
|
+
1 1 Find IIS quickly.
|
|
90
|
+
IntTol double 0 1e-06 1e-09 0.1 1 1 The integer feasibility tolerance
|
|
91
|
+
LinearizeIndicators enumint 0 0 1 4 Force linearization of indicator constraints
|
|
92
|
+
0 1 Do not force linearization of indicator constraints.
|
|
93
|
+
1 1 Force linearization of all indicator constraints. All indicator constraints will be transformed into equivalent linear constraints if enabled.
|
|
94
|
+
LinearizeSos enumint 0 0 1 4 Force linearization of SOS constraints
|
|
95
|
+
0 1 Do not force linearization of SOS constraints.
|
|
96
|
+
1 1 Force linearization of all SOS constraints. All SOS constraints will be transformed into equivalent linear constraints if enabled.
|
|
97
|
+
LogLevel enumint 0 2 1 9 Log level of solving information
|
|
98
|
+
2 1 Print basic optimization logs.
|
|
99
|
+
3 1 Print memory usage information in addition to basic optimization logs (for MIP problems).
|
|
100
|
+
LpMethod enumint 0 -1 1 3 Specifies the LP method
|
|
101
|
+
-1 1 Dual Simplex for LP. Automatic choice between Dual Simplex and Barrier for MIP.
|
|
102
|
+
1 1 Dual simplex.
|
|
103
|
+
2 1 Barrier.
|
|
104
|
+
3 1 Crossover.
|
|
105
|
+
4 1 Concurrent (Use simplex and barrier simultaneously).
|
|
106
|
+
5 1 Choose between simplex and barrier automatically (Based on features such as sparsity and/or coefficients ranges).
|
|
107
|
+
6 1 First-order method (PDLP).
|
|
108
|
+
MatrixTol double 0 1e-10 0 1e-07 1 1 The input matrix coefficient tolerance
|
|
109
|
+
MipNLPIterLimit integer 0 100 -1 maxint 1 5 Iteration limit for solving NLP problem(s) within the MIP solver (-1: no limit)
|
|
110
|
+
MipRepair integer 0 -1 -1 3 1 4 Level for repairing the MIP solution in case of numerical issues (-1: only when time left, 0: off, >0 extend time limit)
|
|
111
|
+
MipStartMode enumint 0 -1 1 4 Specifies MIP start mode
|
|
112
|
+
-1 1 Automatic.
|
|
113
|
+
0 1 Disable MIP starts.
|
|
114
|
+
1 1 Only use full and feasible MIP starts.
|
|
115
|
+
2 1 Try to complete partial feasible MIP starts by solving subMIPs.
|
|
116
|
+
MipStartNodeLimit integer 0 -1 -1 maxint 1 4 Limit of nodes for MIP start sub-MIP (to complete partial MIP starts) (-1: unlimited)
|
|
117
|
+
MipTasks integer 0 -1 -1 256 1 6 Number of parallel tasks in MIP solving (-1: automatic)
|
|
118
|
+
NLPIterLimit integer 0 maxint 0 maxint 1 5 Iteration limit for solving NLP problem
|
|
119
|
+
NLPLinScale enumint 0 -1 1 5 Linear system scaling strategy of the nonlinear solver
|
|
120
|
+
-1 1 Choose automatically.
|
|
121
|
+
0 1 No scaling.
|
|
122
|
+
1 1 Always scale.
|
|
123
|
+
NLPMuUpdate enumint 0 -1 1 5 Barrier parameter update strategy of the nonlinear solver
|
|
124
|
+
-1 1 Choose automatically.
|
|
125
|
+
0 1 Monotonically decreasing.
|
|
126
|
+
1 1 Adaptive adjustment.
|
|
127
|
+
NLPTol double 0 1e-08 1e-13 0.001 1 5 Optimal relative tolerance for nonlinear programming
|
|
128
|
+
NodeCutRounds integer 0 -1 -1 maxint 1 4 Maximum cut rounds in a local node
|
|
129
|
+
NodeLimit integer 0 maxint -1 maxint 1 1 Limit of nodes for MIP
|
|
130
|
+
NonConvex enumint 0 -1 1 5 Whether to solve non-convex problem
|
|
131
|
+
-1 1 Choose automatically.
|
|
132
|
+
0 1 Report nonconvexity and terminate.
|
|
133
|
+
1 1 Search for a local optimal solution.
|
|
134
|
+
2 1 Search for a global optimal solution.
|
|
135
|
+
PDLPTol double 0 1e-06 1e-12 0.0001 1 1 Convergence tolerance for the first-order method (PDLP)
|
|
136
|
+
PreRootHeurLevel enumint 0 -1 1 4 Level of pre-root heuristics
|
|
137
|
+
-1 1 Automatic.
|
|
138
|
+
0 1 Off.
|
|
139
|
+
1 1 Fast.
|
|
140
|
+
2 1 Normal.
|
|
141
|
+
3 1 Aggressive.
|
|
142
|
+
Presolve enumint 0 -1 1 2 Level of presolving performed before solving a problem
|
|
143
|
+
-1 1 Choose automatically.
|
|
144
|
+
0 1 No presolving.
|
|
145
|
+
1 1 Fast presolving.
|
|
146
|
+
2 1 Normal presolving.
|
|
147
|
+
3 1 Aggressive presolving.
|
|
148
|
+
4 1 No Limitations, continues until the model cannot be modified.
|
|
149
|
+
qextractalg enumint 18 0 1 10 extraction algorithm for quadratic equations
|
|
150
|
+
0 1 choose automatically
|
|
151
|
+
1 1 threepass: uses a three-pass forward / backward / forward AD technique to compute function / gradient / Hessian values and a hybrid scheme for storage
|
|
152
|
+
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
|
|
153
|
+
3 1 concurrent: uses threepass and doubleforward in parallel; as soon as one finishes, the other one stops
|
|
154
|
+
qextractdenseswitchfactor double 19 0.008 0 maxdouble 1 10 sparse/dense factor for quadratic extraction algorithm
|
|
155
|
+
qextractdenseswitchlog boolean 20 0 1 10 whether to print additional information about sparse/dense factor choice in quadratic extraction algorithm
|
|
156
|
+
readparams string 9 "" 1 10 read COPT parameter file
|
|
157
|
+
RelGap double 0 0.0001 0 maxdouble 1 1 The relative gap for MIP
|
|
158
|
+
ReqFarkasRay boolean 0 1 1 3 Whether to return a Farkas or Ray when an LP is infeasible or unbounded
|
|
159
|
+
RootCutLevel enumint 0 -1 1 4 Level of root cutting planes generation
|
|
160
|
+
-1 1 Automatic.
|
|
161
|
+
0 1 Off.
|
|
162
|
+
1 1 Fast.
|
|
163
|
+
2 1 Normal.
|
|
164
|
+
3 1 Aggressive.
|
|
165
|
+
RootCutRounds integer 0 -1 -1 maxint 1 4 Maximum cut rounds in the root (-1: unlimited)
|
|
166
|
+
RoundingHeurLevel enumint 0 -1 1 4 Level of rounding heuristics
|
|
167
|
+
-1 1 Automatic.
|
|
168
|
+
0 1 Off.
|
|
169
|
+
1 1 Fast.
|
|
170
|
+
2 1 Normal.
|
|
171
|
+
3 1 Aggressive.
|
|
172
|
+
Scaling enumint 0 -1 1 2 Whether to perform scaling before solving a problem
|
|
173
|
+
-1 1 Choose automatically.
|
|
174
|
+
0 1 No scaling.
|
|
175
|
+
1 1 Apply scaling.
|
|
176
|
+
SimplexThreads integer 0 -1 -1 128 1 6 Number of threads to use in the simplex solver
|
|
177
|
+
solnpool string 1 "" 1 10 Solution pool file name
|
|
178
|
+
solnpoolmerge string 2 "" 1 10 Solution pool file name for merged solutions
|
|
179
|
+
SolTimeLimit double 0 1e+20 0 1e+20 1 1 Time limit that is only effictive after a primal feasible solution has been found
|
|
180
|
+
solvefinal boolean 3 1 1 10 whether to solve the LP obtained from fixing discrete variables and variables in SOS after a MIP solve
|
|
181
|
+
solvetrace string 15 "" 1 10 name of file for writing solving progress information during solve
|
|
182
|
+
solvetracenodefreq integer 16 100 0 maxint 1 10 frequency in number of nodes for writing to solve trace file
|
|
183
|
+
solvetracetimefreq double 17 5 0 maxdouble 1 10 frequency in seconds for writing to solve trace file
|
|
184
|
+
StrongBranching enumint 0 -1 1 4 Level of strong branching
|
|
185
|
+
-1 1 Automatic.
|
|
186
|
+
0 1 Off.
|
|
187
|
+
1 1 Fast.
|
|
188
|
+
2 1 Normal.
|
|
189
|
+
3 1 Aggressive.
|
|
190
|
+
SubMipHeurLevel enumint 0 -1 1 4 Level of sub-MIP heuristics
|
|
191
|
+
-1 1 Automatic.
|
|
192
|
+
0 1 Off.
|
|
193
|
+
1 1 Fast.
|
|
194
|
+
2 1 Normal.
|
|
195
|
+
3 1 Aggressive.
|
|
196
|
+
Threads integer 0 0 -1 128 1 6 Number of threads to use (-1: automatic, 0: 1 thread)
|
|
197
|
+
TimeLimit double 0 1e+10 0 1e+20 1 1 Time limit of the optimization
|
|
198
|
+
TreeCutLevel enumint 0 -1 1 4 Level of tree cutting planes generation
|
|
199
|
+
-1 1 Automatic.
|
|
200
|
+
0 1 Off.
|
|
201
|
+
1 1 Fast.
|
|
202
|
+
2 1 Normal.
|
|
203
|
+
3 1 Aggressive.
|
|
204
|
+
TuneMeasure enumint 0 -1 1 8 Method to aggregate multiple permutation solves into a single measure for tuner
|
|
205
|
+
-1 1 Choose automatically.
|
|
206
|
+
0 1 Average value.
|
|
207
|
+
1 1 Maximum value.
|
|
208
|
+
TuneMethod enumint 0 -1 1 8 Tuning method
|
|
209
|
+
-1 1 Choose automatically.
|
|
210
|
+
0 1 Greedy search strategy.
|
|
211
|
+
1 1 Broader search strategy.
|
|
212
|
+
TuneMode enumint 0 -1 1 8 Specifies tuning mode for tuner
|
|
213
|
+
-1 1 Choose automatically.
|
|
214
|
+
0 1 Solving time.
|
|
215
|
+
1 1 Relative optimality gap.
|
|
216
|
+
2 1 Primal bound (objective function value of incumbent).
|
|
217
|
+
3 1 Dual bound (bound on optimal value).
|
|
218
|
+
TuneOutputLevel enumint 0 2 1 8 Output level for tuner
|
|
219
|
+
0 1 No tuning log.
|
|
220
|
+
1 1 Summary of the improved parameters only.
|
|
221
|
+
2 1 Summary of each tuning attempt.
|
|
222
|
+
3 1 Detailed log of each tuning attempt.
|
|
223
|
+
TuneParams string 14 "" 1 8 COPT parameter file with options to be tuned
|
|
224
|
+
TunePermutes integer 0 0 0 maxint 1 8 Number of permuted solves for each parameter set by tuner (0: auto)
|
|
225
|
+
TuneTargetRelGap double 0 0.0001 0 maxdouble 1 8 Target relative gap for tuning
|
|
226
|
+
TuneTargetTime double 0 0.01 0 maxdouble 1 8 Target elapsed time for tuning
|
|
227
|
+
TuneTimeLimit double 0 0 0 1e+20 1 8 Time limit of tuning (0: auto)
|
|
228
|
+
Tuning string 13 "" 1 8 If set, enables tuning tool. The option value should be the prefix for names of tuned option files that are written.
|
|
229
|
+
writebas string 7 "" 1 10 name of file to which to write advanced starting basis in basis format
|
|
230
|
+
writebin string 6 "" 1 10 name of file to which to write problem in COPT binary format
|
|
231
|
+
writelp string 4 "" 1 10 name of file to which to write problem in LP file format
|
|
232
|
+
writemps string 5 "" 1 10 name of file to which to write problem in MPS file format
|
|
233
|
+
writemst string 8 "" 1 10 name of file to which to write MIP starting point
|
|
234
|
+
writenl string 21 "" 1 10 name of file to which to write problem in NL file format
|
|
235
|
+
*
|
|
236
|
+
* synonym section
|
|
237
|
+
*
|
|
238
|
+
feasopt synonym FeasRelax
|
|
239
|
+
feasoptmode synonym FeasRelaxMode
|
|
240
|
+
*
|
|
241
|
+
* indicator section
|
|
242
|
+
*
|
|
243
|
+
indicator SEPARATOR " "
|
|
244
|
+
indicator STRINGQUOTE
|
|
245
|
+
indic indicator
|
|
246
|
+
*
|
|
247
|
+
* Groups
|
|
248
|
+
*
|
|
249
|
+
gr_Limits_and_Tolerances group 1 1 Limits and Tolerances
|
|
250
|
+
gr_Presolving_and_Scaling group 2 1 Presolving and Scaling
|
|
251
|
+
gr_LP_solving group 3 1 LP solving
|
|
252
|
+
gr_MIP_solving group 4 1 MIP solving
|
|
253
|
+
gr_NLP_solving group 5 1 NLP solving
|
|
254
|
+
gr_Multithreading group 6 1 Multithreading
|
|
255
|
+
gr_Infeasibility_Analysis group 7 1 Infeasibility Analysis
|
|
256
|
+
gr_Parameter_Tuning group 8 1 Parameter Tuning
|
|
257
|
+
gr_Other group 9 1 Other
|
|
258
|
+
gr_GAMS_COPT_link group 10 1 GAMS/COPT link
|
gamspy_copt/version.py
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
__version__ = '52.1.0'
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
gamspy_copt/__init__.py,sha256=-YjqqmEtat0Add0WYpa0i71cnSTUZkIZacfn1OK4eYc,353
|
|
2
|
+
gamspy_copt/libcopt.so,sha256=RfKsX6pt3ONt0jfc5_gPjYOEvq0ehPeSiw9UyqeFZks,56285864
|
|
3
|
+
gamspy_copt/libcptcclib64.so,sha256=cov-ZmxPVrSHa-HdcLUI6XgzWWaRUUkxteLmi7n1R0I,347336
|
|
4
|
+
gamspy_copt/optcopt.def,sha256=s8kKYb8cQGjjBS1QEVky3T0qcJkaxaMfRFZgP9K0Au4,12201
|
|
5
|
+
gamspy_copt/version.py,sha256=MJ6Omh6nCQsTTCAndvdZUVhoZ5exvmUTYWnbHM1eFpg,22
|
|
6
|
+
gamspy_copt-52.1.0.dist-info/METADATA,sha256=E57iVJq2zA2vr-qOjLp7UADxRWPvAl3962UcRsf3PzQ,56
|
|
7
|
+
gamspy_copt-52.1.0.dist-info/WHEEL,sha256=y8u8XMRMhRO4WIzZsJlf1QLnkoycGOkSMhsygOvn-QU,115
|
|
8
|
+
gamspy_copt-52.1.0.dist-info/top_level.txt,sha256=o5QBGmjwM9C5RbXo-DaXXSQ3pp7mqHaWj3aCHrz-lXY,12
|
|
9
|
+
gamspy_copt-52.1.0.dist-info/RECORD,,
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
gamspy_copt
|