gamspy-copt 49.7.0__py3-none-manylinux_2_28_aarch64.whl → 50.5.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.

Potentially problematic release.


This version of gamspy-copt might be problematic. Click here for more details.

gamspy_copt/libcopt.so CHANGED
Binary file
Binary file
gamspy_copt/optcopt.def CHANGED
@@ -1,5 +1,5 @@
1
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
2
+ .feaspref double 12 1 0 maxdouble 1 7 preference to include variable bound or equation side into feasibility relaxation
3
3
  AbsGap double 0 0 0 maxdouble 1 1 The absolute gap for MIP
4
4
  BarHomogeneous enumint 0 -1 1 3 Whether to use homogeneous self-dual form in barrier
5
5
  -1 1 Choose automatically.
@@ -15,7 +15,7 @@ BarStart enumint 0 -1 1 3 Starting Point method for barrier
15
15
  0 1 Simple.
16
16
  1 1 Mehrotra.
17
17
  2 1 Modified Mehrotra.
18
- BarThreads integer 0 -1 -1 128 1 5 Number of threads to use in the barrier solver
18
+ BarThreads integer 0 -1 -1 128 1 6 Number of threads to use in the barrier solver
19
19
  ConflictAnalysis enumint 0 -1 1 4 Whether to perform conflict analysis
20
20
  -1 1 Automatic.
21
21
  0 1 No.
@@ -24,7 +24,7 @@ Crossover enumint 0 1 1 3 Whether to run crossover after barrier
24
24
  -1 1 Choose automatically. Only run crossover when the LP solution is not primal-dual feasible.
25
25
  0 1 No.
26
26
  1 1 Yes.
27
- CrossoverThreads integer 0 -1 -1 128 1 5 Number of threads to use in the crossover
27
+ CrossoverThreads integer 0 -1 -1 128 1 6 Number of threads to use in the crossover
28
28
  CutLevel enumint 0 -1 1 4 Level of cutting planes generation
29
29
  -1 1 Automatic.
30
30
  0 1 Off.
@@ -56,8 +56,8 @@ FAPHeurLevel enumint 0 -1 1 4 Level of fix-and-propagate heuristics
56
56
  1 1 Fast.
57
57
  2 1 Normal.
58
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
59
+ FeasRelax boolean 11 0 1 7 whether to compute a feasible relaxation instead of solving the problem
60
+ FeasRelaxMode enumint 0 0 1 7 Specifies the feasibility relaxation mode
61
61
  0 1 Minimize sum of violations.
62
62
  1 1 Optimize original objective function under minimal sum of violations.
63
63
  2 1 Minimize number of violations.
@@ -76,15 +76,23 @@ HeurLevel enumint 0 -1 1 4 Level of heuristics
76
76
  1 1 Fast.
77
77
  2 1 Normal.
78
78
  3 1 Aggressive.
79
- iis enumint 10 0 1 6 whether to compute an Irreducible Inconsistent Subsystem (IIS) if the problem is infeasible
79
+ iis enumint 10 0 1 7 whether to compute an Irreducible Inconsistent Subsystem (IIS) if the problem is infeasible
80
80
  0 1 no
81
81
  1 1 compute IIS after solve if infeasible
82
82
  2 1 compute IIS without solving original problem
83
- IISMethod enumint 0 -1 1 6 Specifies the IIS method
83
+ IISMethod enumint 0 -1 1 7 Specifies the IIS method
84
84
  -1 1 Automatic.
85
85
  0 1 Find smaller IIS.
86
86
  1 1 Find IIS quickly.
87
87
  IntTol double 0 1e-06 1e-09 0.1 1 1 The integer feasibility tolerance
88
+ LinearizeIndicators enumint 0 -1 1 4 Controls whether to force the linearization of Indicator constraints.
89
+ -1 1 Choose automatically. COPT attempts to linearize indicator constraints when the model is numerically well-conditioned.
90
+ 0 1 Do not force linearization of indicator constraints.
91
+ 1 1 Force linearization of all indicator constraints. All indicator constraints will be transformed into equivalent linear constraints if enabled.
92
+ LinearizeSos enumint 0 -1 1 4 Controls whether to force the linearization of SOS constraints.
93
+ -1 1 Choose automatically. COPT attempts to linearize SOS constraints when the model is numerically well-conditioned.
94
+ 0 1 Do not force linearization of SOS constraints.
95
+ 1 1 Force linearization of all SOS constraints. All SOS constraints will be transformed into equivalent linear constraints if enabled.
88
96
  LpMethod enumint 0 -1 1 3 Specifies the LP method
89
97
  -1 1 Dual Simplex for LP. Automatic choice between Dual Simplex and Barrier for MIP.
90
98
  1 1 Dual simplex.
@@ -100,9 +108,23 @@ MipStartMode enumint 0 -1 1 4 Specifies MIP start mode
100
108
  1 1 Only use full and feasible MIP starts.
101
109
  2 1 Try to complete partial feasible MIP starts by solving subMIPs.
102
110
  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)
111
+ MipTasks integer 0 -1 -1 256 1 6 Number of parallel tasks in MIP solving (-1: automatic)
112
+ NLPIterLimit integer 0 maxint 0 maxint 1 5 Iteration limit for the nonlinear solver
113
+ NLPLinScale enumint 0 -1 1 5 Linear system scaling strategy of the nonlinear solver
114
+ -1 1 Choose automatically.
115
+ 0 1 No scaling.
116
+ 1 1 Always scale.
117
+ NLPMuUpdate enumint 0 -1 1 5 Barrier parameter update strategy of the nonlinear solver
118
+ -1 1 Choose automatically.
119
+ 0 1 Monotonically decreasing.
120
+ 1 1 Adaptive adjustment.
121
+ NLPTol double 0 1e-08 1e-13 0.001 1 5 Optimal relative tolerance for nonlinear programming
104
122
  NodeCutRounds integer 0 -1 -1 maxint 1 4 Maximum cut rounds in a local node
105
123
  NodeLimit integer 0 maxint -1 maxint 1 1 Limit of nodes for MIP
124
+ NonConvex enumint 0 -1 1 5 Handling strategy for nonconvex models
125
+ -1 1 Choose automatically.
126
+ 0 1 Report nonconvexity and terminate.
127
+ 1 1 Search for a local optimal solution.
106
128
  PDLPTol double 0 1e-06 1e-12 0.0001 1 1 Convergence tolerance for the first-order method (PDLP)
107
129
  Presolve enumint 0 -1 1 2 Level of presolving performed before solving a problem
108
130
  -1 1 Choose automatically.
@@ -110,7 +132,14 @@ Presolve enumint 0 -1 1 2 Level of presolving performed before solving a problem
110
132
  1 1 Fast presolving.
111
133
  2 1 Normal presolving.
112
134
  3 1 Aggressive presolving.
113
- readparams string 9 "" 1 8 read COPT parameter file
135
+ qextractalg enumint 18 0 1 9 extraction algorithm for quadratic equations
136
+ 0 1 choose automatically
137
+ 1 1 threepass: uses a three-pass forward / backward / forward AD technique to compute function / gradient / Hessian values and a hybrid scheme for storage
138
+ 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
139
+ 3 1 concurrent: uses threepass and doubleforward in parallel; as soon as one finishes, the other one stops
140
+ qextractdenseswitchfactor double 19 0.008 0 maxdouble 1 9 sparse/dense factor for quadratic extraction algorithm
141
+ qextractdenseswitchlog boolean 20 0 1 9 whether to print additional information about sparse/dense factor choice in quadratic extraction algorithm
142
+ readparams string 9 "" 1 9 read COPT parameter file
114
143
  RelGap double 0 0.0001 0 maxdouble 1 1 The relative gap for MIP
115
144
  ReqFarkasRay boolean 0 1 1 3 Whether to return a Farkas or Ray when an LP is infeasible or unbounded
116
145
  RootCutLevel enumint 0 -1 1 4 Level of root cutting planes generation
@@ -130,14 +159,14 @@ Scaling enumint 0 -1 1 2 Whether to perform scaling before solving a problem
130
159
  -1 1 Choose automatically.
131
160
  0 1 No scaling.
132
161
  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
162
+ SimplexThreads integer 0 -1 -1 128 1 6 Number of threads to use in the simplex solver
163
+ solnpool string 1 "" 1 9 Solution pool file name
164
+ solnpoolmerge string 2 "" 1 9 Solution pool file name for merged solutions
136
165
  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
166
+ solvefinal boolean 3 1 1 9 whether to solve the LP obtained from fixing discrete variables and variables in SOS after a MIP solve
167
+ solvetrace string 15 "" 1 9 name of file for writing solving progress information during solve
168
+ solvetracenodefreq integer 16 100 0 maxint 1 9 frequency in number of nodes for writing to solve trace file
169
+ solvetracetimefreq double 17 5 0 maxdouble 1 9 frequency in seconds for writing to solve trace file
141
170
  StrongBranching enumint 0 -1 1 4 Level of strong branching
142
171
  -1 1 Automatic.
143
172
  0 1 Off.
@@ -150,7 +179,7 @@ SubMipHeurLevel enumint 0 -1 1 4 Level of sub-MIP heuristics
150
179
  1 1 Fast.
151
180
  2 1 Normal.
152
181
  3 1 Aggressive.
153
- Threads integer 0 0 -1 128 1 5 Number of threads to use (-1: automatic, 0: 1 thread)
182
+ Threads integer 0 0 -1 128 1 6 Number of threads to use (-1: automatic, 0: 1 thread)
154
183
  TimeLimit double 0 1e+10 0 1e+20 1 1 Time limit of the optimization
155
184
  TreeCutLevel enumint 0 -1 1 4 Level of tree cutting planes generation
156
185
  -1 1 Automatic.
@@ -158,36 +187,37 @@ TreeCutLevel enumint 0 -1 1 4 Level of tree cutting planes generation
158
187
  1 1 Fast.
159
188
  2 1 Normal.
160
189
  3 1 Aggressive.
161
- TuneMeasure enumint 0 -1 1 7 Method to aggregate multiple permutation solves into a single measure for tuner
190
+ TuneMeasure enumint 0 -1 1 8 Method to aggregate multiple permutation solves into a single measure for tuner
162
191
  -1 1 Choose automatically.
163
192
  0 1 Average value.
164
193
  1 1 Maximum value.
165
- TuneMethod enumint 0 -1 1 7 Tuning method
194
+ TuneMethod enumint 0 -1 1 8 Tuning method
166
195
  -1 1 Choose automatically.
167
196
  0 1 Greedy search strategy.
168
197
  1 1 Broader search strategy.
169
- TuneMode enumint 0 -1 1 7 Specifies tuning mode for tuner
198
+ TuneMode enumint 0 -1 1 8 Specifies tuning mode for tuner
170
199
  -1 1 Choose automatically.
171
200
  0 1 Solving time.
172
201
  1 1 Relative optimality gap.
173
202
  2 1 Primal bound (objective function value of incumbent).
174
203
  3 1 Dual bound (bound on optimal value).
175
- TuneOutputLevel enumint 0 2 1 7 Output level for tuner
204
+ TuneOutputLevel enumint 0 2 1 8 Output level for tuner
176
205
  0 1 No tuning log.
177
206
  1 1 Summary of the improved parameters only.
178
207
  2 1 Summary of each tuning attempt.
179
208
  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
209
+ TuneParams string 14 "" 1 8 COPT parameter file with options to be tuned
210
+ TunePermutes integer 0 0 0 maxint 1 8 Number of permuted solves for each parameter set by tuner (0: auto)
211
+ TuneTargetRelGap double 0 0.0001 0 maxdouble 1 8 Target relative gap for tuning
212
+ TuneTargetTime double 0 0.01 0 maxdouble 1 8 Target elapsed time for tuning
213
+ TuneTimeLimit double 0 0 0 1e+20 1 8 Time limit of tuning (0: auto)
214
+ 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.
215
+ writebas string 7 "" 1 9 name of file to which to write advanced starting basis in basis format
216
+ writebin string 6 "" 1 9 name of file to which to write problem in COPT binary format
217
+ writelp string 4 "" 1 9 name of file to which to write problem in LP file format
218
+ writemps string 5 "" 1 9 name of file to which to write problem in MPS file format
219
+ writemst string 8 "" 1 9 name of file to which to write MIP starting point
220
+ writenl string 21 "" 1 9 name of file to which to write problem in NL file format
191
221
  *
192
222
  * synonym section
193
223
  *
@@ -206,7 +236,8 @@ gr_Limits_and_Tolerances group 1 1 Limits and Tolerances
206
236
  gr_Presolving_and_Scaling group 2 1 Presolving and Scaling
207
237
  gr_LP_solving group 3 1 LP solving
208
238
  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
239
+ gr_NLP_solving group 5 1 NLP solving
240
+ gr_Multithreading group 6 1 Multithreading
241
+ gr_Infeasibility_Analysis group 7 1 Infeasibility Analysis
242
+ gr_Parameter_Tuning group 8 1 Parameter Tuning
243
+ gr_GAMS_COPT_link group 9 1 GAMS/COPT link
gamspy_copt/version.py CHANGED
@@ -1 +1 @@
1
- __version__ = '49.7.0'
1
+ __version__ = '50.5.0'
@@ -1,3 +1,3 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: gamspy_copt
3
- Version: 49.7.0
3
+ Version: 50.5.0
@@ -0,0 +1,9 @@
1
+ gamspy_copt/__init__.py,sha256=-YjqqmEtat0Add0WYpa0i71cnSTUZkIZacfn1OK4eYc,353
2
+ gamspy_copt/libcopt.so,sha256=Cv4_iK473akdTtIR6M6UNe8nC5dhgKfK1Tw4s3sSWlg,30477304
3
+ gamspy_copt/libcptcclib64.so,sha256=-_IzAvQI5B082egr0rSJlZo01wQR4J5H7JOvK1YTpqs,396480
4
+ gamspy_copt/optcopt.def,sha256=38-q4pTyrNsa_pbXkCwBPNDCM1Gj_RSD5BksZWg_VsY,11613
5
+ gamspy_copt/version.py,sha256=NyYlC34aRr2xLovGh3H1W0QoGC1ye2K8uRKKPfo8GqM,22
6
+ gamspy_copt-50.5.0.dist-info/METADATA,sha256=buFw2Na0Yw3LoCT3juRsfmiJ1kwzkeNQb_rsGzCM5gw,56
7
+ gamspy_copt-50.5.0.dist-info/WHEEL,sha256=t5_TVo5EoIcKNBhWzfot9g64ilMSG_CsDKeV6kLKeBo,116
8
+ gamspy_copt-50.5.0.dist-info/top_level.txt,sha256=o5QBGmjwM9C5RbXo-DaXXSQ3pp7mqHaWj3aCHrz-lXY,12
9
+ gamspy_copt-50.5.0.dist-info/RECORD,,
@@ -1,9 +0,0 @@
1
- gamspy_copt/__init__.py,sha256=-YjqqmEtat0Add0WYpa0i71cnSTUZkIZacfn1OK4eYc,353
2
- gamspy_copt/libcopt.so,sha256=3NgSST_5KZ-g7uwZwTYr0mFc8GplLvfNVSZNmVxgUB0,11759056
3
- gamspy_copt/libcptcclib64.so,sha256=LPvp_0RLTOxIjI5Kk7MDgjPWwSfJ0K1VmF6pjedoPFM,396432
4
- gamspy_copt/optcopt.def,sha256=wP5jGsezJuZgtH1jmynNC1NKILzi66lq5qiatIyHVVo,9164
5
- gamspy_copt/version.py,sha256=UsATtH8H35cUKz_5YgGCC4BOnDoemmYVZxz0XW_gosg,22
6
- gamspy_copt-49.7.0.dist-info/METADATA,sha256=qfpHKwnWblWpw9yWyCFRAd1OwXwvZv6d4HBg9SQXnis,56
7
- gamspy_copt-49.7.0.dist-info/WHEEL,sha256=t5_TVo5EoIcKNBhWzfot9g64ilMSG_CsDKeV6kLKeBo,116
8
- gamspy_copt-49.7.0.dist-info/top_level.txt,sha256=o5QBGmjwM9C5RbXo-DaXXSQ3pp7mqHaWj3aCHrz-lXY,12
9
- gamspy_copt-49.7.0.dist-info/RECORD,,