gamspy-copt 49.0.0__py3-none-macosx_12_0_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.
Potentially problematic release.
This version of gamspy-copt might be problematic. Click here for more details.
- gamspy_copt/__init__.py +11 -0
- gamspy_copt/libcopt.dylib +0 -0
- gamspy_copt/libcptcclib64.dylib +0 -0
- gamspy_copt/optcopt.def +212 -0
- gamspy_copt/version.py +1 -0
- gamspy_copt-49.0.0.dist-info/METADATA +3 -0
- gamspy_copt-49.0.0.dist-info/RECORD +9 -0
- gamspy_copt-49.0.0.dist-info/WHEEL +5 -0
- gamspy_copt-49.0.0.dist-info/top_level.txt +1 -0
gamspy_copt/__init__.py
ADDED
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
import os
|
|
2
|
+
from pathlib import Path
|
|
3
|
+
|
|
4
|
+
from .version import __version__
|
|
5
|
+
|
|
6
|
+
directory = str(Path(__file__).resolve().parent)
|
|
7
|
+
|
|
8
|
+
files = ['libcopt.dylib', 'optcopt.def', 'libcptcclib64.dylib']
|
|
9
|
+
|
|
10
|
+
file_paths = [directory + os.sep + file for file in files]
|
|
11
|
+
verbatim = 'COPT 1011 5 CT 1 0 2 LP MIP RMIP QCP MIQCP RMIQCP\ngmsgenus.run\ngmsgenux.out\nlibcptcclib64.dylib cpt 1 1'
|
|
Binary file
|
|
Binary file
|
gamspy_copt/optcopt.def
ADDED
|
@@ -0,0 +1,212 @@
|
|
|
1
|
+
* This file is autogenerated by optcopt.
|
|
2
|
+
.feaspref double 12 1 0 maxdouble 1 6 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
|
+
BarStart enumint 0 -1 1 3 Starting Point method for barrier
|
|
14
|
+
-1 1 Choose automatically.
|
|
15
|
+
0 1 Simple.
|
|
16
|
+
1 1 Mehrotra.
|
|
17
|
+
2 1 Modified Mehrotra.
|
|
18
|
+
BarThreads integer 0 -1 -1 128 1 5 Number of threads to use in the barrier solver
|
|
19
|
+
ConflictAnalysis enumint 0 -1 1 4 Whether to perform conflict analysis
|
|
20
|
+
-1 1 Automatic.
|
|
21
|
+
0 1 No.
|
|
22
|
+
1 1 Yes.
|
|
23
|
+
Crossover enumint 0 1 1 3 Whether to run crossover after barrier
|
|
24
|
+
-1 1 Choose automatically. Only run crossover when the LP solution is not primal-dual feasible.
|
|
25
|
+
0 1 No.
|
|
26
|
+
1 1 Yes.
|
|
27
|
+
CrossoverThreads integer 0 -1 -1 128 1 5 Number of threads to use in the crossover
|
|
28
|
+
CutLevel enumint 0 -1 1 4 Level of cutting planes generation
|
|
29
|
+
-1 1 Automatic.
|
|
30
|
+
0 1 Off.
|
|
31
|
+
1 1 Fast.
|
|
32
|
+
2 1 Normal.
|
|
33
|
+
3 1 Aggressive.
|
|
34
|
+
DivingHeurLevel enumint 0 -1 1 4 Level of diving heuristics
|
|
35
|
+
-1 1 Automatic.
|
|
36
|
+
0 1 Off.
|
|
37
|
+
1 1 Fast.
|
|
38
|
+
2 1 Normal.
|
|
39
|
+
3 1 Aggressive.
|
|
40
|
+
Dualize enumint 0 -1 1 2 Whether to dualize a problem before solving it
|
|
41
|
+
-1 1 Choose automatically.
|
|
42
|
+
0 1 No dualizing.
|
|
43
|
+
1 1 Dualizing the problem.
|
|
44
|
+
DualPerturb enumint 0 -1 1 3 Whether to allow the objective function perturbation
|
|
45
|
+
-1 1 Choose automatically.
|
|
46
|
+
0 1 No perturbation.
|
|
47
|
+
1 1 Allow objective function perturbation.
|
|
48
|
+
DualPrice enumint 0 -1 1 3 Specifies the dual simplex pricing algorithm
|
|
49
|
+
-1 1 Choose automatically.
|
|
50
|
+
0 1 Using Devex pricing algorithm.
|
|
51
|
+
1 1 Using dual steepest-edge pricing algorithm .
|
|
52
|
+
DualTol double 0 1e-06 1e-09 0.0001 1 1 The tolerance for dual solutions and reduced cost
|
|
53
|
+
FAPHeurLevel enumint 0 -1 1 4 Level of fix-and-propagate heuristics
|
|
54
|
+
-1 1 Automatic.
|
|
55
|
+
0 1 Off.
|
|
56
|
+
1 1 Fast.
|
|
57
|
+
2 1 Normal.
|
|
58
|
+
3 1 Aggressive.
|
|
59
|
+
FeasRelax boolean 11 0 1 6 whether to compute a feasible relaxation instead of solving the problem
|
|
60
|
+
FeasRelaxMode enumint 0 0 1 6 Specifies the feasibility relaxation mode
|
|
61
|
+
0 1 Minimize sum of violations.
|
|
62
|
+
1 1 Optimize original objective function under minimal sum of violations.
|
|
63
|
+
2 1 Minimize number of violations.
|
|
64
|
+
3 1 Optimize original objective function under minimal number of violations.
|
|
65
|
+
4 1 Minimize sum of squared violations.
|
|
66
|
+
5 1 Optimize original objective function under minimal sum of squared violations.
|
|
67
|
+
FeasTol double 0 1e-06 1e-09 0.0001 1 1 The feasibility tolerance
|
|
68
|
+
GPUDevice integer 0 -1 -1 maxint 1 3 Utilize the GPU with the specified device ID (in cases where the running machine has multiple GPUs)
|
|
69
|
+
GPUMode enumint 0 -1 1 3 Usage mode of the GPU solver
|
|
70
|
+
-1 1 Choose automatically.
|
|
71
|
+
0 1 Force the use of CPU mode.
|
|
72
|
+
1 1 Utilize NVIDIA GPU.
|
|
73
|
+
HeurLevel enumint 0 -1 1 4 Level of heuristics
|
|
74
|
+
-1 1 Automatic.
|
|
75
|
+
0 1 Off.
|
|
76
|
+
1 1 Fast.
|
|
77
|
+
2 1 Normal.
|
|
78
|
+
3 1 Aggressive.
|
|
79
|
+
iis enumint 10 0 1 6 whether to compute an Irreducible Inconsistent Subsystem (IIS) if the problem is infeasible
|
|
80
|
+
0 1 no
|
|
81
|
+
1 1 compute IIS after solve if infeasible
|
|
82
|
+
2 1 compute IIS without solving original problem
|
|
83
|
+
IISMethod enumint 0 -1 1 6 Specifies the IIS method
|
|
84
|
+
-1 1 Automatic.
|
|
85
|
+
0 1 Find smaller IIS.
|
|
86
|
+
1 1 Find IIS quickly.
|
|
87
|
+
IntTol double 0 1e-06 1e-09 0.1 1 1 The integer feasibility tolerance
|
|
88
|
+
LpMethod enumint 0 -1 1 3 Specifies the LP method
|
|
89
|
+
-1 1 Dual Simplex for LP. Automatic choice between Dual Simplex and Barrier for MIP.
|
|
90
|
+
1 1 Dual simplex.
|
|
91
|
+
2 1 Barrier.
|
|
92
|
+
3 1 Crossover.
|
|
93
|
+
4 1 Concurrent (Use simplex and barrier simultaneously).
|
|
94
|
+
5 1 Choose between simplex and barrier automatically (Based on features such as sparsity and/or coefficients ranges).
|
|
95
|
+
6 1 First-order method (PDLP).
|
|
96
|
+
MatrixTol double 0 1e-10 0 1e-07 1 1 The input matrix coefficient tolerance
|
|
97
|
+
MipStartMode enumint 0 -1 1 4 Specifies MIP start mode
|
|
98
|
+
-1 1 Automatic.
|
|
99
|
+
0 1 Disable MIP starts.
|
|
100
|
+
1 1 Only use full and feasible MIP starts.
|
|
101
|
+
2 1 Try to complete partial feasible MIP starts by solving subMIPs.
|
|
102
|
+
MipStartNodeLimit integer 0 -1 -1 maxint 1 4 Limit of nodes for MIP start sub-MIP (to complete partial MIP starts) (-1: unlimited)
|
|
103
|
+
MipTasks integer 0 -1 -1 256 1 5 Number of parallel tasks in MIP solving (-1: automatic)
|
|
104
|
+
NodeCutRounds integer 0 -1 -1 maxint 1 4 Maximum cut rounds in a local node
|
|
105
|
+
NodeLimit integer 0 maxint -1 maxint 1 1 Limit of nodes for MIP
|
|
106
|
+
PDLPTol double 0 1e-06 1e-12 0.0001 1 1 Convergence tolerance for the first-order method (PDLP)
|
|
107
|
+
Presolve enumint 0 -1 1 2 Level of presolving performed before solving a problem
|
|
108
|
+
-1 1 Choose automatically.
|
|
109
|
+
0 1 No presolving.
|
|
110
|
+
1 1 Fast presolving.
|
|
111
|
+
2 1 Normal presolving.
|
|
112
|
+
3 1 Aggressive presolving.
|
|
113
|
+
readparams string 9 "" 1 8 read COPT parameter file
|
|
114
|
+
RelGap double 0 0.0001 0 maxdouble 1 1 The relative gap for MIP
|
|
115
|
+
ReqFarkasRay boolean 0 1 1 3 Whether to return a Farkas or Ray when an LP is infeasible or unbounded
|
|
116
|
+
RootCutLevel enumint 0 -1 1 4 Level of root cutting planes generation
|
|
117
|
+
-1 1 Automatic.
|
|
118
|
+
0 1 Off.
|
|
119
|
+
1 1 Fast.
|
|
120
|
+
2 1 Normal.
|
|
121
|
+
3 1 Aggressive.
|
|
122
|
+
RootCutRounds integer 0 -1 -1 maxint 1 4 Maximum cut rounds in the root (-1: unlimited)
|
|
123
|
+
RoundingHeurLevel enumint 0 -1 1 4 Level of rounding heuristics
|
|
124
|
+
-1 1 Automatic.
|
|
125
|
+
0 1 Off.
|
|
126
|
+
1 1 Fast.
|
|
127
|
+
2 1 Normal.
|
|
128
|
+
3 1 Aggressive.
|
|
129
|
+
Scaling enumint 0 -1 1 2 Whether to perform scaling before solving a problem
|
|
130
|
+
-1 1 Choose automatically.
|
|
131
|
+
0 1 No scaling.
|
|
132
|
+
1 1 Apply scaling.
|
|
133
|
+
SimplexThreads integer 0 -1 -1 128 1 5 Number of threads to use in the simplex solver
|
|
134
|
+
solnpool string 1 "" 1 8 Solution pool file name
|
|
135
|
+
solnpoolmerge string 2 "" 1 8 Solution pool file name for merged solutions
|
|
136
|
+
SolTimeLimit double 0 1e+20 0 1e+20 1 1 Time limit that is only effictive after a primal feasible solution has been found
|
|
137
|
+
solvefinal boolean 3 1 1 8 whether to solve the LP obtained from fixing discrete variables and variables in SOS after a MIP solve
|
|
138
|
+
solvetrace string 15 "" 1 8 name of file for writing solving progress information during solve
|
|
139
|
+
solvetracenodefreq integer 16 100 0 maxint 1 8 frequency in number of nodes for writing to solve trace file
|
|
140
|
+
solvetracetimefreq double 17 5 0 maxdouble 1 8 frequency in seconds for writing to solve trace file
|
|
141
|
+
StrongBranching enumint 0 -1 1 4 Level of strong branching
|
|
142
|
+
-1 1 Automatic.
|
|
143
|
+
0 1 Off.
|
|
144
|
+
1 1 Fast.
|
|
145
|
+
2 1 Normal.
|
|
146
|
+
3 1 Aggressive.
|
|
147
|
+
SubMipHeurLevel enumint 0 -1 1 4 Level of sub-MIP heuristics
|
|
148
|
+
-1 1 Automatic.
|
|
149
|
+
0 1 Off.
|
|
150
|
+
1 1 Fast.
|
|
151
|
+
2 1 Normal.
|
|
152
|
+
3 1 Aggressive.
|
|
153
|
+
Threads integer 0 0 -1 128 1 5 Number of threads to use (-1: automatic, 0: 1 thread)
|
|
154
|
+
TimeLimit double 0 1e+10 0 1e+20 1 1 Time limit of the optimization
|
|
155
|
+
TreeCutLevel enumint 0 -1 1 4 Level of tree cutting planes generation
|
|
156
|
+
-1 1 Automatic.
|
|
157
|
+
0 1 Off.
|
|
158
|
+
1 1 Fast.
|
|
159
|
+
2 1 Normal.
|
|
160
|
+
3 1 Aggressive.
|
|
161
|
+
TuneMeasure enumint 0 -1 1 7 Method to aggregate multiple permutation solves into a single measure for tuner
|
|
162
|
+
-1 1 Choose automatically.
|
|
163
|
+
0 1 Average value.
|
|
164
|
+
1 1 Maximum value.
|
|
165
|
+
TuneMethod enumint 0 -1 1 7 Tuning method
|
|
166
|
+
-1 1 Choose automatically.
|
|
167
|
+
0 1 Greedy search strategy.
|
|
168
|
+
1 1 Broader search strategy.
|
|
169
|
+
TuneMode enumint 0 -1 1 7 Specifies tuning mode for tuner
|
|
170
|
+
-1 1 Choose automatically.
|
|
171
|
+
0 1 Solving time.
|
|
172
|
+
1 1 Relative optimality gap.
|
|
173
|
+
2 1 Primal bound (objective function value of incumbent).
|
|
174
|
+
3 1 Dual bound (bound on optimal value).
|
|
175
|
+
TuneOutputLevel enumint 0 2 1 7 Output level for tuner
|
|
176
|
+
0 1 No tuning log.
|
|
177
|
+
1 1 Summary of the improved parameters only.
|
|
178
|
+
2 1 Summary of each tuning attempt.
|
|
179
|
+
3 1 Detailed log of each tuning attempt.
|
|
180
|
+
TuneParams string 14 "" 1 7 COPT parameter file with options to be tuned
|
|
181
|
+
TunePermutes integer 0 0 0 maxint 1 7 Number of permuted solves for each parameter set by tuner (0: auto)
|
|
182
|
+
TuneTargetRelGap double 0 0.0001 0 maxdouble 1 7 Target relative gap for tuning
|
|
183
|
+
TuneTargetTime double 0 0.01 0 maxdouble 1 7 Target elapsed time for tuning
|
|
184
|
+
TuneTimeLimit double 0 0 0 1e+20 1 7 Time limit of tuning (0: auto)
|
|
185
|
+
Tuning string 13 "" 1 7 If set, enables tuning tool. The option value should be the prefix for names of tuned option files that are written.
|
|
186
|
+
writebas string 7 "" 1 8 name of file to which to write advanced starting basis in basis format
|
|
187
|
+
writebin string 6 "" 1 8 name of file to which to write problem in COPT binary format
|
|
188
|
+
writelp string 4 "" 1 8 name of file to which to write problem in LP file format
|
|
189
|
+
writemps string 5 "" 1 8 name of file to which to write problem in MPS file format
|
|
190
|
+
writemst string 8 "" 1 8 name of file to which to write MIP starting point
|
|
191
|
+
*
|
|
192
|
+
* synonym section
|
|
193
|
+
*
|
|
194
|
+
feasopt synonym FeasRelax
|
|
195
|
+
feasoptmode synonym FeasRelaxMode
|
|
196
|
+
*
|
|
197
|
+
* indicator section
|
|
198
|
+
*
|
|
199
|
+
indicator SEPARATOR " "
|
|
200
|
+
indicator STRINGQUOTE
|
|
201
|
+
indic indicator
|
|
202
|
+
*
|
|
203
|
+
* Groups
|
|
204
|
+
*
|
|
205
|
+
gr_Limits_and_Tolerances group 1 1 Limits and Tolerances
|
|
206
|
+
gr_Presolving_and_Scaling group 2 1 Presolving and Scaling
|
|
207
|
+
gr_LP_solving group 3 1 LP solving
|
|
208
|
+
gr_MIP_solving group 4 1 MIP solving
|
|
209
|
+
gr_Multithreading group 5 1 Multithreading
|
|
210
|
+
gr_Infeasibility_Analysis group 6 1 Infeasibility Analysis
|
|
211
|
+
gr_Parameter_Tuning group 7 1 Parameter Tuning
|
|
212
|
+
gr_GAMS_COPT_link group 8 1 GAMS/COPT link
|
gamspy_copt/version.py
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
__version__ = '49.0.0'
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
gamspy_copt/__init__.py,sha256=iVgCwGH4ldGSn9JiNRSKSYXWJuxc10OayLI3C7o9ABU,364
|
|
2
|
+
gamspy_copt/libcopt.dylib,sha256=YccDWkyOwSvuZm7P5ru5UCnlDU_rwPSGMEPCKOBig90,21074252
|
|
3
|
+
gamspy_copt/libcptcclib64.dylib,sha256=I3U5KWs0IrsptRAtBbhbjavfiYNRqQfuIDlyJg5p2pk,413848
|
|
4
|
+
gamspy_copt/optcopt.def,sha256=wP5jGsezJuZgtH1jmynNC1NKILzi66lq5qiatIyHVVo,9164
|
|
5
|
+
gamspy_copt/version.py,sha256=nfP8G8Meutq0UM4inllSV31YldlwZ35zvdXYNB-c_so,22
|
|
6
|
+
gamspy_copt-49.0.0.dist-info/METADATA,sha256=KRNW2e3_4s7aNMtmajaEkood_ZuqHco97GdrTkG04os,56
|
|
7
|
+
gamspy_copt-49.0.0.dist-info/WHEEL,sha256=dUeK-AfbPOozIsGZlj06zkyatQR_dJ98CsgWniWFUMM,112
|
|
8
|
+
gamspy_copt-49.0.0.dist-info/top_level.txt,sha256=o5QBGmjwM9C5RbXo-DaXXSQ3pp7mqHaWj3aCHrz-lXY,12
|
|
9
|
+
gamspy_copt-49.0.0.dist-info/RECORD,,
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
gamspy_copt
|