gamspy-highs 51.0.0rc1__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_highs/__init__.py +9 -0
- gamspy_highs/libhiscclib64.so +0 -0
- gamspy_highs/opthighs.def +138 -0
- gamspy_highs/version.py +1 -0
- gamspy_highs-51.0.0rc1.dist-info/METADATA +3 -0
- gamspy_highs-51.0.0rc1.dist-info/RECORD +8 -0
- gamspy_highs-51.0.0rc1.dist-info/WHEEL +5 -0
- gamspy_highs-51.0.0rc1.dist-info/top_level.txt +1 -0
gamspy_highs/__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 = ['opthighs.def', 'libhiscclib64.so']
|
|
7
|
+
|
|
8
|
+
file_paths = [directory + os.sep + file for file in files]
|
|
9
|
+
verbatim = 'HIGHS 11 5 HI 1 0 2 LP MIP RMIP\ngmsgenus.run\ngmsgenux.out\nlibhiscclib64.so his 1 1'
|
|
Binary file
|
|
@@ -0,0 +1,138 @@
|
|
|
1
|
+
* This file is autogenerated by opthighs.
|
|
2
|
+
allow_unbounded_or_infeasible boolean 0 0 1 1 whether to spend extra effort to distinguish unboundedness and infeasibility if necessary
|
|
3
|
+
allowed_cost_scale_factor integer 0 0 0 20 1 1 Largest power-of-two factor permitted when scaling the costs
|
|
4
|
+
allowed_matrix_scale_factor integer 0 20 0 30 1 1 Largest power-of-two factor permitted when scaling the constraint matrix
|
|
5
|
+
centring_ratio_tolerance double 0 100 0 maxdouble 1 1 Centring stops when the ratio max(x_j*s_j) / min(x_j*s_j) is below this tolerance (default = 100)
|
|
6
|
+
cost_scale_factor integer 0 0 -20 20 1 1 Scaling factor for costs
|
|
7
|
+
dual_feasibility_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Dual feasibility tolerance
|
|
8
|
+
dual_residual_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Dual residual tolerance
|
|
9
|
+
dual_simplex_cost_perturbation_multiplier double 0 1 0 maxdouble 1 1 Dual simplex cost perturbation multiplier: 0 => no perturbation
|
|
10
|
+
dual_simplex_pivot_growth_tolerance double 0 1e-09 1e-12 maxdouble 1 1 Dual simplex pivot growth tolerance
|
|
11
|
+
dual_steepest_edge_weight_error_tolerance double 0 maxdouble 0 maxdouble 1 1 Tolerance on dual steepest edge weight errors
|
|
12
|
+
dual_steepest_edge_weight_log_error_threshold double 0 10 1 maxdouble 1 1 Threshold on dual steepest edge weight errors for Devex switch
|
|
13
|
+
factor_pivot_threshold double 0 0.1 0.0008 0.5 1 1 Matrix factorization pivot threshold
|
|
14
|
+
factor_pivot_tolerance double 0 1e-10 0 1 1 1 Matrix factorization pivot tolerance
|
|
15
|
+
highs_analysis_level integer 0 0 0 255 1 1 Analysis level in HiGHS
|
|
16
|
+
highs_debug_level integer 0 0 0 3 1 1 Debugging level in HiGHS
|
|
17
|
+
icrash boolean 0 0 1 1 Run iCrash
|
|
18
|
+
icrash_approx_iter integer 0 50 0 100 1 1 iCrash approximate minimization iterations
|
|
19
|
+
icrash_breakpoints boolean 0 0 1 1 Exact subproblem solution for iCrash
|
|
20
|
+
icrash_dualize boolean 0 0 1 1 Dualize strategy for iCrash
|
|
21
|
+
icrash_exact boolean 0 0 1 1 Exact subproblem solution for iCrash
|
|
22
|
+
icrash_iterations integer 0 30 0 200 1 1 iCrash iterations
|
|
23
|
+
icrash_starting_weight double 0 0.001 1e-10 1e+50 1 1 iCrash starting weight
|
|
24
|
+
icrash_strategy string 0 "ICA" 1 1 Strategy for iCrash
|
|
25
|
+
iis integer 0 0 0 2 1 1 whether to compute an irreducible infeasible subset of an LP
|
|
26
|
+
iis_strategy integer 0 0 0 1 1 1 Strategy for IIS calculation: Prioritise rows (default) / Prioritise columns (0/1)
|
|
27
|
+
illconditioning boolean 0 0 0 1 Whether to run ill conditioning analysis after solving an LP with a simplex method
|
|
28
|
+
illconditioning_bound double 0 0.0001 0 maxdouble 0 1 Bound on ill conditioning when using ill conditioning analysis method 1
|
|
29
|
+
illconditioning_constraint boolean 0 0 0 1 Whether to run ill conditioning on constraint view (alternative is variable view)
|
|
30
|
+
illconditioning_method integer 0 0 0 1 0 1 Method to use for ill conditioning analysis, i.e., auxiliary problem to be solved
|
|
31
|
+
infinite_bound double 0 1e+20 1e+15 maxdouble 1 1 Limit on |constraint bound|: values greater than or equal to this will be treated as infinite
|
|
32
|
+
infinite_cost double 0 1e+20 1e+15 maxdouble 1 1 Limit on |cost coefficient|: values greater than or equal to this will be treated as infinite
|
|
33
|
+
ipm_iteration_limit integer 0 maxint 0 maxint 1 1 Iteration limit for IPM solver
|
|
34
|
+
ipm_optimality_tolerance double 0 1e-08 1e-12 maxdouble 1 1 IPM optimality tolerance
|
|
35
|
+
ipx_dualize_strategy integer 0 2 -1 3 1 1 Strategy for dualizing before IPX
|
|
36
|
+
kkt_tolerance double 0 1e-07 1e-10 maxdouble 1 1 If changed from its default value, this tolerance is used for all feasibility and optimality (KKT) measures
|
|
37
|
+
large_matrix_value double 0 1e+15 1 maxdouble 1 1 Upper limit on |matrix entries|: values greater than or equal to this will be treated as infinite
|
|
38
|
+
less_infeasible_DSE_check boolean 0 1 1 1 Check whether LP is candidate for LiDSE
|
|
39
|
+
less_infeasible_DSE_choose_row boolean 0 1 1 1 Use LiDSE if LP has right properties
|
|
40
|
+
log_dev_level integer 0 0 0 3 1 1 Output development messages: 0 => none; 1 => info; 2 => detailed; 3 => verbose
|
|
41
|
+
lp_presolve_requires_basis_postsolve boolean 0 1 1 1 Prevents LP presolve steps for which postsolve cannot maintain a basis
|
|
42
|
+
max_centring_steps integer 0 5 0 maxint 1 1 Maximum number of steps to use (default = 5) when computing the analytic centre
|
|
43
|
+
max_dual_simplex_cleanup_level integer 0 1 0 maxint 1 1 Max level of dual simplex cleanup
|
|
44
|
+
max_dual_simplex_phase1_cleanup_level integer 0 2 0 maxint 1 1 Max level of dual simplex phase 1 cleanup
|
|
45
|
+
mip_abs_gap double 0 0 0 maxdouble 1 1 Tolerance on absolute gap of MIP, |ub-lb|, to determine whether optimality has been reached for a MIP instance
|
|
46
|
+
mip_allow_restart boolean 0 1 1 1 Whether MIP restart is permitted
|
|
47
|
+
mip_detect_symmetry boolean 0 1 1 1 Whether MIP symmetry should be detected
|
|
48
|
+
mip_feasibility_tolerance double 0 1e-06 1e-10 maxdouble 1 1 MIP integrality tolerance
|
|
49
|
+
mip_heuristic_effort double 0 0.05 0 1 1 1 Effort spent for MIP heuristics
|
|
50
|
+
mip_heuristic_run_feasibility_jump boolean 0 1 1 1 Use the feasibility jump heuristic
|
|
51
|
+
mip_heuristic_run_rens boolean 0 1 1 1 Use the RENS heuristic
|
|
52
|
+
mip_heuristic_run_rins boolean 0 1 1 1 Use the RINS heuristic
|
|
53
|
+
mip_heuristic_run_root_reduced_cost boolean 0 1 1 1 Use the rootReducedCost heuristic
|
|
54
|
+
mip_heuristic_run_shifting boolean 0 0 1 1 Use the Shifting heuristic
|
|
55
|
+
mip_heuristic_run_zi_round boolean 0 0 1 1 Use the ZI Round heuristic
|
|
56
|
+
mip_lifting_for_probing integer 0 -1 -1 maxint 1 1 Level of lifting for probing that is used
|
|
57
|
+
mip_lp_age_limit integer 0 10 0 32767 1 1 Maximal age of dynamic LP rows before they are removed from the LP relaxation in the MIP solver
|
|
58
|
+
mip_max_improving_sols integer 0 maxint 1 maxint 1 1 Limit on the number of improving solutions found to stop the MIP solver prematurely
|
|
59
|
+
mip_max_leaves integer 0 maxint 0 maxint 1 1 MIP solver max number of leaf nodes
|
|
60
|
+
mip_max_nodes integer 0 maxint 0 maxint 1 1 MIP solver max number of nodes
|
|
61
|
+
mip_max_stall_nodes integer 0 maxint 0 maxint 1 1 MIP solver max number of nodes where estimate is above cutoff bound
|
|
62
|
+
mip_max_start_nodes integer 0 500 0 maxint 1 1 MIP solver max number of nodes when completing a partial MIP start
|
|
63
|
+
mip_min_cliquetable_entries_for_parallelism integer 0 100000 0 maxint 1 1 Minimal number of entries in the MIP solver cliquetable before neighbourhood queries of the conflict graph use parallel processing
|
|
64
|
+
mip_min_logging_interval double 0 5 0 maxdouble 1 1 MIP minimum logging interval
|
|
65
|
+
mip_pool_age_limit integer 0 30 0 1000 1 1 Maximal age of rows in the MIP solver cutpool before they are deleted
|
|
66
|
+
mip_pool_soft_limit integer 0 10000 1 maxint 1 1 Soft limit on the number of rows in the MIP solver cutpool for dynamic age adjustment
|
|
67
|
+
mip_pscost_minreliable integer 0 8 0 maxint 1 1 Minimal number of observations before MIP solver pseudo costs are considered reliable
|
|
68
|
+
mip_rel_gap double 0 0.0001 0 maxdouble 1 1 Tolerance on relative gap, |ub-lb|/|ub|, to determine whether optimality has been reached for a MIP instance
|
|
69
|
+
mip_report_level integer 0 1 0 2 1 1 MIP solver reporting level
|
|
70
|
+
mip_root_presolve_only boolean 0 0 1 1 Whether MIP presolve is only applied at the root node
|
|
71
|
+
mipstart integer 0 2 0 4 1 1 Whether and how to pass initial level values as starting point to MIP solver
|
|
72
|
+
no_unnecessary_rebuild_refactor boolean 0 1 1 1 No unnecessary refactorization on simplex rebuild
|
|
73
|
+
objective_bound double 0 0.0001 mindouble maxdouble 1 1 Objective bound for termination of the dual simplex solver
|
|
74
|
+
objective_target double 0 mindouble mindouble maxdouble 1 1 Objective target for termination of the MIP solver
|
|
75
|
+
optimality_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Optimality tolerance
|
|
76
|
+
output_flag boolean 0 1 1 1 Enables or disables solver output
|
|
77
|
+
parallel string 0 "choose" 1 1 Parallel option: "off", "choose" or "on"
|
|
78
|
+
pdlp_e_restart_method integer 0 0 0 1 1 1 Restart method for PDLP solver: 0 => none; 1 => GPU
|
|
79
|
+
pdlp_gpu boolean 0 0 1 1 Whether to attempt using an NVIDIA GPU when solver=pdlp.
|
|
80
|
+
pdlp_iteration_limit integer 0 maxint 0 maxint 1 1 Iteration limit for PDLP solver
|
|
81
|
+
pdlp_optimality_tolerance double 0 1e-07 1e-12 maxdouble 1 1 PDLP optimality tolerance
|
|
82
|
+
pdlp_scaling boolean 0 1 1 1 Scaling option for PDLP solver: Default = true
|
|
83
|
+
presolve string 0 "choose" 1 1 Presolve option: "off", "choose" or "on"
|
|
84
|
+
presolve_pivot_threshold double 0 0.01 0.0008 0.5 1 1 Matrix factorization pivot threshold for substitutions in presolve
|
|
85
|
+
presolve_reduction_limit integer 0 -1 -1 maxint 1 1 Limit on number of presolve reductions -1 => no limit
|
|
86
|
+
presolve_remove_slacks boolean 0 0 1 1 Remove slacks after presolve
|
|
87
|
+
presolve_rule_logging boolean 0 0 1 1 Log effectiveness of presolve rules for LP
|
|
88
|
+
presolve_rule_off integer 0 0 0 maxint 1 1 Bit mask of presolve rules that are not allowed
|
|
89
|
+
presolve_substitution_maxfillin integer 0 10 0 maxint 1 1 Maximal fillin allowed for substitutions in presolve
|
|
90
|
+
primal_feasibility_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Primal feasibility tolerance
|
|
91
|
+
primal_residual_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Primal residual tolerance
|
|
92
|
+
primal_simplex_bound_perturbation_multiplier double 0 1 0 maxdouble 1 1 Primal simplex bound perturbation multiplier: 0 => no perturbation
|
|
93
|
+
random_seed integer 0 0 0 maxint 1 1 Random seed used in HiGHS
|
|
94
|
+
rebuild_refactor_solution_error_tolerance double 0 1e-08 mindouble maxdouble 1 1 Tolerance on solution error when considering refactorization on simplex rebuild
|
|
95
|
+
restart_presolve_reduction_limit integer 0 -1 -1 maxint 1 1 Limit on number of further presolve reductions on restart in MIP solver -1 => no limit, otherwise, must be positive
|
|
96
|
+
run_centring boolean 0 0 1 1 Perform centring steps or not
|
|
97
|
+
run_crossover string 0 "on" 1 1 Run IPM crossover: "off", "choose" or "on"
|
|
98
|
+
sensitivity boolean 0 0 1 1 Whether to run sensitivity analysis after solving an LP with a simplex method
|
|
99
|
+
simplex_crash_strategy integer 0 0 0 9 1 1 Strategy for simplex crash: off / LTSSF / Bixby (0/1/2)
|
|
100
|
+
simplex_dual_edge_weight_strategy integer 0 -1 -1 2 1 1 Strategy for simplex dual edge weights: Choose / Dantzig / Devex / Steepest Edge (-1/0/1/2)
|
|
101
|
+
simplex_dualize_strategy integer 0 -1 -1 1 1 1 Strategy for dualizing before simplex
|
|
102
|
+
simplex_initial_condition_check boolean 0 1 1 1 Perform initial basis condition check in simplex
|
|
103
|
+
simplex_initial_condition_tolerance double 0 1e+14 1 maxdouble 1 1 Tolerance on initial basis condition in simplex
|
|
104
|
+
simplex_iteration_limit integer 0 maxint 0 maxint 1 1 Iteration limit for simplex solver when solving LPs, but not subproblems in the MIP solver
|
|
105
|
+
simplex_max_concurrency integer 0 8 1 8 1 1 Maximum level of concurrency in parallel simplex
|
|
106
|
+
simplex_min_concurrency integer 0 1 1 8 1 1 Minimum level of concurrency in parallel simplex
|
|
107
|
+
simplex_permute_strategy integer 0 -1 -1 1 1 1 Strategy for permuting before simplex
|
|
108
|
+
simplex_price_strategy integer 0 3 0 3 1 1 Strategy for PRICE in simplex
|
|
109
|
+
simplex_primal_edge_weight_strategy integer 0 -1 -1 2 1 1 Strategy for simplex primal edge weights: Choose / Dantzig / Devex / Steepest Edge (-1/0/1/2)
|
|
110
|
+
simplex_scale_strategy integer 0 2 0 4 1 1 Simplex scaling strategy: off / choose / equilibration (default) / forced equilibration / max value (0/1/2/3/4)
|
|
111
|
+
simplex_strategy integer 0 1 0 4 1 1 Strategy for simplex solver 0 => Choose; 1 => Dual (serial); 2 => Dual (SIP); 3 => Dual (PAMI); 4 => Primal
|
|
112
|
+
simplex_unscaled_solution_strategy integer 0 1 0 2 1 1 Strategy for solving unscaled LP in simplex
|
|
113
|
+
simplex_update_limit integer 0 5000 0 maxint 1 1 Limit on the number of simplex UPDATE operations
|
|
114
|
+
small_matrix_value double 0 1e-09 1e-12 maxdouble 1 1 Lower limit on |matrix entries|: values less than or equal to this will be treated as zero
|
|
115
|
+
solution_file string 0 "" 1 1 Write solution file
|
|
116
|
+
solver string 0 "choose" 1 1 LP algorithm to run: "simplex", "choose", "ipm", or "pdlp"; ignored for MIP
|
|
117
|
+
solvetrace string 0 "" 1 1 Name of file for writing solving progress information during MIP solve
|
|
118
|
+
solvetracenodefreq integer 0 100 0 maxint 1 1 Frequency in number of nodes for writing to solve trace file
|
|
119
|
+
solvetracetimefreq double 0 5 0 maxdouble 1 1 Frequency in seconds for writing to solve trace file
|
|
120
|
+
start_crossover_tolerance double 0 1e-08 1e-12 maxdouble 1 1 Tolerance to be satisfied before IPM crossover will start
|
|
121
|
+
threads integer 0 0 0 maxint 1 1 Number of threads used by HiGHS (0: automatic)
|
|
122
|
+
time_limit double 0 10000 0 maxdouble 1 1 Time limit (seconds)
|
|
123
|
+
timeless_log boolean 0 0 1 1 Suppression of time-based data in logging
|
|
124
|
+
use_implied_bounds_from_presolve boolean 0 0 1 1 Use relaxed implied bounds from presolve
|
|
125
|
+
use_original_HFactor_logic boolean 0 1 1 1 Use original HFactor logic for sparse vs hyper-sparse TRANs
|
|
126
|
+
write_basis_file string 0 "" 1 1 Write basis file
|
|
127
|
+
write_model_file string 0 "" 1 1 Write model file
|
|
128
|
+
write_solution_style integer 0 0 -1 4 1 1 Style of solution file (raw = computer-readable, pretty = human-readable): -1 => HiGHS old raw (deprecated); 0 => HiGHS raw; 1 => HiGHS pretty; 2 => Glpsol raw; 3 => Glpsol pretty; 4 => HiGHS sparse raw
|
|
129
|
+
*
|
|
130
|
+
* indicator section
|
|
131
|
+
*
|
|
132
|
+
myeolchar EOLCOMM #
|
|
133
|
+
indicator SEPARATOR "="
|
|
134
|
+
indicator STRINGQUOTE
|
|
135
|
+
*
|
|
136
|
+
* Groups
|
|
137
|
+
*
|
|
138
|
+
gr_highs group 1 1 highs
|
gamspy_highs/version.py
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
__version__ = '51.0.0rc1'
|
|
@@ -0,0 +1,8 @@
|
|
|
1
|
+
gamspy_highs/__init__.py,sha256=2o_e9NIHyvbLqz4id0lMNGHNjcdXhehPwtdb-hnyWr4,322
|
|
2
|
+
gamspy_highs/libhiscclib64.so,sha256=YHrW8WlLxs9z7h283z9-Zky64xyr2ItWcVSSEkmNMU0,3747776
|
|
3
|
+
gamspy_highs/opthighs.def,sha256=g5gTPYmOkGyt6igg-eMoBljRC-fUlKmvMpiIDgsI0sg,12938
|
|
4
|
+
gamspy_highs/version.py,sha256=e7dMxWWwwFHKgGBBUm_HJ6d7Cv0vcrHfD8iMjvg1XSM,25
|
|
5
|
+
gamspy_highs-51.0.0rc1.dist-info/METADATA,sha256=0QdrpyyAq0KaojyYuAbQjG-Y63DyafdAAVbin_EdZjI,60
|
|
6
|
+
gamspy_highs-51.0.0rc1.dist-info/WHEEL,sha256=y8u8XMRMhRO4WIzZsJlf1QLnkoycGOkSMhsygOvn-QU,115
|
|
7
|
+
gamspy_highs-51.0.0rc1.dist-info/top_level.txt,sha256=t-Xx6EkaD4Hc2BEfgzl7oAbnr2-Aot5_4MdAMgoV1xY,13
|
|
8
|
+
gamspy_highs-51.0.0rc1.dist-info/RECORD,,
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
gamspy_highs
|