gamspy-highs 52.4.0__py3-none-win_amd64.whl

gamspy_highs/__init__.py

@@ -0,0 +1,9 @@
+import os
+from pathlib import Path
+from .version import __version__
+directory = str(Path(__file__).resolve().parent)
+
+files = ['mkl_gams.dll', 'opthighs.def', 'hiscclib64.dll']
+
+file_paths = [directory + os.sep + file for file in files]
+verbatim = 'HIGHS 11 5 HI 1 0 2 LP MIP RMIP\ngmsgennt.cmd\ngmsgennx.exe\nhiscclib64.dll his 1 0'

gamspy_highs/opthighs.def

@@ -0,0 +1,144 @@
+* This file is autogenerated by opthighs.
+allow_unbounded_or_infeasible boolean 0 0 1 1 whether to spend extra effort to distinguish unboundedness and infeasibility if necessary
+allowed_cost_scale_factor integer 0 0 0 20 1 1 Largest power-of-two factor permitted when scaling the costs
+allowed_matrix_scale_factor integer 0 20 0 30 1 1 Largest power-of-two factor permitted when scaling the constraint matrix
+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)
+cost_scale_factor integer 0 0 -20 20 1 1 Scaling factor for costs
+dual_feasibility_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Dual feasibility tolerance
+dual_residual_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Dual residual tolerance
+dual_simplex_cost_perturbation_multiplier double 0 1 0 maxdouble 1 1 Dual simplex cost perturbation multiplier: 0 => no perturbation
+dual_simplex_pivot_growth_tolerance double 0 1e-09 1e-12 maxdouble 1 1 Dual simplex pivot growth tolerance
+dual_steepest_edge_weight_error_tolerance double 0 maxdouble 0 maxdouble 1 1 Tolerance on dual steepest edge weight errors
+dual_steepest_edge_weight_log_error_threshold double 0 10 1 maxdouble 1 1 Threshold on dual steepest edge weight errors for Devex switch
+factor_pivot_threshold double 0 0.1 0.0008 0.5 1 1 Matrix factorization pivot threshold
+factor_pivot_tolerance double 0 1e-10 0 1 1 1 Matrix factorization pivot tolerance
+highs_analysis_level integer 0 0 0 255 1 1 Analysis level in HiGHS
+highs_debug_level integer 0 0 0 3 1 1 Debugging level in HiGHS
+hipo_block_size integer 0 128 0 maxint 1 1 Block size for dense linear algebra within HiPO
+hipo_parallel_type string 0 "both" 1 1 HiPO parallel option: "tree", "node" or "both".
+hipo_system string 0 "choose" 1 1 HiPO Newton system option: "augmented", "normaleq" or "choose".
+icrash boolean 0 0 1 1 Run iCrash
+icrash_approx_iter integer 0 50 0 100 1 1 iCrash approximate minimization iterations
+icrash_breakpoints boolean 0 0 1 1 Exact subproblem solution for iCrash
+icrash_dualize boolean 0 0 1 1 Dualize strategy for iCrash
+icrash_exact boolean 0 0 1 1 Exact subproblem solution for iCrash
+icrash_iterations integer 0 30 0 200 1 1 iCrash iterations
+icrash_starting_weight double 0 0.001 1e-10 1e+50 1 1 iCrash starting weight
+icrash_strategy string 0 "ICA" 1 1 Strategy for iCrash
+iis integer 0 0 0 2 1 1 whether to compute an irreducible infeasible subset of an LP
+iis_strategy integer 0 0 0 2 1 1 Strategy for IIS calculation: Light test / Full and prioritise rows / Full and prioritise columns (0/1/2)
+illconditioning boolean 0 0 0 1 Whether to run ill conditioning analysis after solving an LP with a simplex method
+illconditioning_bound double 0 0.0001 0 maxdouble 0 1 Bound on ill conditioning when using ill conditioning analysis method 1
+illconditioning_constraint boolean 0 0 0 1 Whether to run ill conditioning on constraint view (alternative is variable view)
+illconditioning_method integer 0 0 0 1 0 1 Method to use for ill conditioning analysis, i.e., auxiliary problem to be solved
+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
+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
+ipm_iteration_limit integer 0 maxint 0 maxint 1 1 Iteration limit for IPM solver
+ipm_optimality_tolerance double 0 1e-08 1e-12 maxdouble 1 1 IPM optimality tolerance
+ipx_dualize_strategy integer 0 2 -1 3 1 1 Strategy for dualizing before IPX
+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
+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
+less_infeasible_DSE_check boolean 0 1 1 1 Check whether LP is candidate for LiDSE
+less_infeasible_DSE_choose_row boolean 0 1 1 1 Use LiDSE if LP has right properties
+log_dev_level integer 0 0 0 3 1 1 Output development messages: 0 => none; 1 => info; 2 => detailed; 3 => verbose
+lp_presolve_requires_basis_postsolve boolean 0 1 1 1 Prevents LP presolve steps for which postsolve cannot maintain a basis
+max_centring_steps integer 0 5 0 maxint 1 1 Maximum number of steps to use (default = 5) when computing the analytic centre
+max_dual_simplex_cleanup_level integer 0 1 0 maxint 1 1 Max level of dual simplex cleanup
+max_dual_simplex_phase1_cleanup_level integer 0 2 0 maxint 1 1 Max level of dual simplex phase 1 cleanup
+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
+mip_allow_restart boolean 0 1 1 1 Whether MIP restart is permitted
+mip_detect_symmetry boolean 0 1 1 1 Whether MIP symmetry should be detected
+mip_feasibility_tolerance double 0 1e-06 1e-10 maxdouble 1 1 MIP integrality tolerance
+mip_heuristic_effort double 0 0.05 0 1 1 1 Effort spent for MIP heuristics
+mip_heuristic_run_feasibility_jump boolean 0 1 1 1 Use the feasibility jump heuristic
+mip_heuristic_run_rens boolean 0 1 1 1 Use the RENS heuristic
+mip_heuristic_run_rins boolean 0 1 1 1 Use the RINS heuristic
+mip_heuristic_run_root_reduced_cost boolean 0 1 1 1 Use the rootReducedCost heuristic
+mip_heuristic_run_shifting boolean 0 0 1 1 Use the Shifting heuristic
+mip_heuristic_run_zi_round boolean 0 0 1 1 Use the ZI Round heuristic
+mip_ipm_solver string 0 "choose" 1 1 MIP IPM solver option: "choose", "ipx" or "hipo"
+mip_lifting_for_probing integer 0 -1 -1 maxint 1 1 Level of lifting for probing that is used
+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
+mip_lp_solver string 0 "choose" 1 1 MIP LP solver option: "choose", "simplex", "ipm", "ipx" or "hipo"
+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
+mip_max_leaves integer 0 maxint 0 maxint 1 1 MIP solver max number of leaf nodes
+mip_max_nodes integer 0 maxint 0 maxint 1 1 MIP solver max number of nodes
+mip_max_stall_nodes integer 0 maxint 0 maxint 1 1 MIP solver max number of nodes where estimate is above cutoff bound
+mip_max_start_nodes integer 0 500 0 maxint 1 1 MIP solver max number of nodes when completing a partial MIP start
+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
+mip_min_logging_interval double 0 5 0 maxdouble 1 1 MIP minimum logging interval
+mip_pool_age_limit integer 0 30 0 1000 1 1 Maximal age of rows in the MIP solver cutpool before they are deleted
+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
+mip_pscost_minreliable integer 0 8 0 maxint 1 1 Minimal number of observations before MIP solver pseudo costs are considered reliable
+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
+mip_report_level integer 0 1 0 2 1 1 MIP solver reporting level
+mip_root_presolve_only boolean 0 0 1 1 Whether MIP presolve is only applied at the root node
+mipstart integer 0 2 0 4 1 1 Whether and how to pass initial level values as starting point to MIP solver
+no_unnecessary_rebuild_refactor boolean 0 1 1 1 No unnecessary refactorization on simplex rebuild
+objective_bound double 0 0.0001 mindouble maxdouble 1 1 Objective bound for termination of the dual simplex solver
+objective_target double 0 mindouble mindouble maxdouble 1 1 Objective target for termination of the MIP solver
+optimality_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Optimality tolerance
+output_flag boolean 0 1 1 1 Enables or disables solver output
+parallel string 0 "choose" 1 1 Parallel option: "off", "choose" or "on"
+pdlp_e_restart_method integer 0 0 0 1 1 1 Restart method for PDLP solver: 0 => none; 1 => GPU
+pdlp_gpu boolean 0 0 1 1 Whether to attempt using an NVIDIA GPU when solver=pdlp.
+pdlp_iteration_limit integer 0 maxint 0 maxint 1 1 Iteration limit for PDLP solver
+pdlp_optimality_tolerance double 0 1e-07 1e-12 maxdouble 1 1 PDLP optimality tolerance
+pdlp_scaling boolean 0 1 1 1 Scaling option for PDLP solver: Default = true
+presolve string 0 "choose" 1 1 Presolve option: "off", "choose" or "on"
+presolve_pivot_threshold double 0 0.01 0.0008 0.5 1 1 Matrix factorization pivot threshold for substitutions in presolve
+presolve_reduction_limit integer 0 -1 -1 maxint 1 1 Limit on number of presolve reductions -1 => no limit
+presolve_remove_slacks boolean 0 0 1 1 Remove slacks after presolve
+presolve_rule_logging boolean 0 0 1 1 Log effectiveness of presolve rules for LP
+presolve_rule_off integer 0 0 0 maxint 1 1 Bit mask of presolve rules that are not allowed
+presolve_substitution_maxfillin integer 0 10 0 maxint 1 1 Maximal fillin allowed for substitutions in presolve
+primal_feasibility_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Primal feasibility tolerance
+primal_residual_tolerance double 0 1e-07 1e-10 maxdouble 1 1 Primal residual tolerance
+primal_simplex_bound_perturbation_multiplier double 0 1 0 maxdouble 1 1 Primal simplex bound perturbation multiplier: 0 => no perturbation
+random_seed integer 0 0 0 maxint 1 1 Random seed used in HiGHS
+rebuild_refactor_solution_error_tolerance double 0 1e-08 mindouble maxdouble 1 1 Tolerance on solution error when considering refactorization on simplex rebuild
+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
+run_centring boolean 0 0 1 1 Perform centring steps or not
+run_crossover string 0 "on" 1 1 Run IPM crossover: "off", "choose" or "on"
+sensitivity boolean 0 0 1 1 Whether to run sensitivity analysis after solving an LP with a simplex method
+simplex_crash_strategy integer 0 0 0 9 1 1 Strategy for simplex crash: off / LTSSF / Bixby (0/1/2)
+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)
+simplex_dualize_strategy integer 0 -1 -1 1 1 1 Strategy for dualizing before simplex
+simplex_initial_condition_check boolean 0 1 1 1 Perform initial basis condition check in simplex
+simplex_initial_condition_tolerance double 0 1e+14 1 maxdouble 1 1 Tolerance on initial basis condition in simplex
+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
+simplex_max_concurrency integer 0 8 1 8 1 1 Maximum level of concurrency in parallel simplex
+simplex_min_concurrency integer 0 1 1 8 1 1 Minimum level of concurrency in parallel simplex
+simplex_permute_strategy integer 0 -1 -1 1 1 1 Strategy for permuting before simplex
+simplex_price_strategy integer 0 3 0 3 1 1 Strategy for PRICE in simplex
+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)
+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)
+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
+simplex_unscaled_solution_strategy integer 0 1 0 2 1 1 Strategy for solving unscaled LP in simplex
+simplex_update_limit integer 0 5000 0 maxint 1 1 Limit on the number of simplex UPDATE operations
+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
+solution_file string 0 "" 1 1 Write solution file
+solver string 0 "choose" 1 1 LP solver option: "choose", "simplex", "ipm", "ipx", "hipo" or "pdlp"
+solvetrace string 0 "" 1 1 Name of file for writing solving progress information during MIP solve
+solvetracenodefreq integer 0 100 0 maxint 1 1 Frequency in number of nodes for writing to solve trace file
+solvetracetimefreq double 0 5 0 maxdouble 1 1 Frequency in seconds for writing to solve trace file
+start_crossover_tolerance double 0 1e-08 1e-12 maxdouble 1 1 Tolerance to be satisfied before IPM crossover will start
+threads integer 0 0 0 maxint 1 1 Number of threads used by HiGHS (0: automatic)
+time_limit double 0 10000 0 maxdouble 1 1 Time limit (seconds)
+timeless_log boolean 0 0 1 1 Suppression of time-based data in logging
+use_implied_bounds_from_presolve boolean 0 0 1 1 Use relaxed implied bounds from presolve
+use_original_HFactor_logic boolean 0 1 1 1 Use original HFactor logic for sparse vs hyper-sparse TRANs
+write_basis_file string 0 "" 1 1 Write basis file
+write_iis_model_file string 0 "" 1 1 Write IIS model file
+write_model_file string 0 "" 1 1 Write model file
+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
+*
+* indicator section
+*
+myeolchar EOLCOMM #
+indicator SEPARATOR "="
+indicator STRINGQUOTE 
+*
+* Groups
+*
+gr_highs group 1 1 highs

gamspy_highs/version.py

@@ -0,0 +1 @@
+__version__ = '52.4.0'

gamspy_highs-52.4.0.dist-info/METADATA

@@ -0,0 +1,3 @@
+Metadata-Version: 2.4
+Name: gamspy_highs
+Version: 52.4.0

gamspy_highs-52.4.0.dist-info/RECORD

@@ -0,0 +1,9 @@
+gamspy_highs/__init__.py,sha256=PurB8Z-F-aZyTpIUlHRTx2wALZUylyy1j0vY6Xxf8yI,343
+gamspy_highs/hiscclib64.dll,sha256=oCmXdbSID3B8a-jSrCWQQqe156z6eRQ_bGB3sT0_Nhk,8368640
+gamspy_highs/mkl_gams.dll,sha256=vA0y29THdppYW7JjAX38XNzUD4aMJR00ASzTUakUOh4,85689344
+gamspy_highs/opthighs.def,sha256=kCqwYOwmqfIaPC7xxoOzC2_TXWuPVYbzw3YVztbRDr0,13621
+gamspy_highs/version.py,sha256=hf72yY6YhNVjBoE9ggtblNa-Q9LJl0gx4MexiK-cAq4,22
+gamspy_highs-52.4.0.dist-info/METADATA,sha256=gSYUPLLFAMuHMUBny31ARc3DRdSGjXebYGzcO6T8ssM,60
+gamspy_highs-52.4.0.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
+gamspy_highs-52.4.0.dist-info/top_level.txt,sha256=t-Xx6EkaD4Hc2BEfgzl7oAbnr2-Aot5_4MdAMgoV1xY,13
+gamspy_highs-52.4.0.dist-info/RECORD,,

gamspy_highs-52.4.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (80.9.0)
+Root-Is-Purelib: false
+
+Tag: py3-none-win_amd64

gamspy_highs-52.4.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+gamspy_highs