gamspy-highs 50.4.1__py3-none-win_amd64.whl → 51.1.0__py3-none-win_amd64.whl

gamspy_highs/opthighs.def

@@ -33,6 +33,7 @@ infinite_cost double 0 1e+20 1e+15 maxdouble 1 1 Limit on |cost coefficient|: va
 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
@@ -44,8 +45,14 @@ max_dual_simplex_phase1_cleanup_level integer 0 2 0 maxint 1 1 Max level of dual
 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 feasibility tolerance
+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_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_max_improving_sols integer 0 maxint 1 maxint 1 1 Limit on the number of improving solutions found to stop the MIP solver prematurely
@@ -65,13 +72,13 @@ mipstart integer 0 2 0 4 1 1 Whether and how to pass initial level values as sta
 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_d_gap_tol double 0 0.0001 1e-12 maxdouble 1 1 Duality gap tolerance for PDLP solver: Default = 1e-4
 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_native_termination boolean 0 0 1 1 Use native termination for PDLP solver: Default = false
+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
@@ -100,12 +107,12 @@ simplex_min_concurrency integer 0 1 1 8 1 1 Minimum level of concurrency in para
 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 1 0 5 1 1 Simplex scaling strategy: off / choose / equilibration / forced equilibration / max value 0 / max value 1 (0/1/2/3/4/5)
+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 Solution file
+solution_file string 0 "" 1 1 Write solution file
 solver string 0 "choose" 1 1 LP algorithm to run: "simplex", "choose", "ipm", or "pdlp"; ignored for MIP
 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
@@ -116,10 +123,9 @@ 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_model_file string 0 "" 1 1 Write model file
-write_model_to_file boolean 0 0 1 1 Write the model to a 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
-write_solution_to_file boolean 0 0 1 1 Write the primal and dual solution to a file
 *
 * indicator section
 *

gamspy_highs/version.py

@@ -1 +1 @@
-__version__ = '50.4.1'
+__version__ = '51.1.0'

{gamspy_highs-50.4.1.dist-info → gamspy_highs-51.1.0.dist-info}/METADATA

@@ -1,3 +1,3 @@
 Metadata-Version: 2.4
 Name: gamspy_highs
-Version: 50.4.1
+Version: 51.1.0

gamspy_highs-51.1.0.dist-info/RECORD

@@ -0,0 +1,8 @@
+gamspy_highs/__init__.py,sha256=84IIihrK-Pr6OZs2QMa2Ielhp5_tRW9WtUJcNY4OqzQ,327
+gamspy_highs/hiscclib64.dll,sha256=75zrk1vTTdndSeZs-aKafcITI6mfWTzvMo7izMD73XQ,6989312
+gamspy_highs/opthighs.def,sha256=wZPt8BxWtxSlaHV_HDsXu6wCifZ05SHYsAcWK5746TQ,13076
+gamspy_highs/version.py,sha256=1SqOxVzp7c6oVlmeBx3nYBng_AzA6N1peyV1-cK2ieg,22
+gamspy_highs-51.1.0.dist-info/METADATA,sha256=YdulXsC2isQt-caTJs_HuaJ1ezYHcvGaTkAba13lT18,60
+gamspy_highs-51.1.0.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
+gamspy_highs-51.1.0.dist-info/top_level.txt,sha256=t-Xx6EkaD4Hc2BEfgzl7oAbnr2-Aot5_4MdAMgoV1xY,13
+gamspy_highs-51.1.0.dist-info/RECORD,,

gamspy_highs-50.4.1.dist-info/RECORD

@@ -1,8 +0,0 @@
-gamspy_highs/__init__.py,sha256=84IIihrK-Pr6OZs2QMa2Ielhp5_tRW9WtUJcNY4OqzQ,327
-gamspy_highs/hiscclib64.dll,sha256=K9nYvYaX53nQf5WjAgcY8EfevA93ezJIJOjGtdrIlG0,6829568
-gamspy_highs/opthighs.def,sha256=apdaCH8lXkf_IqiWNEW70lBe3jcfNAIldgEjtCNkxww,12612
-gamspy_highs/version.py,sha256=_UnYMAmFysWZeJBkS4Oqt0927rCvXiasvhlTcqClSM0,22
-gamspy_highs-50.4.1.dist-info/METADATA,sha256=aSacEe1OhrGF6Y1tWezmLfDXLHQHb42eLojdIItyjuU,60
-gamspy_highs-50.4.1.dist-info/WHEEL,sha256=gHXjDjheZ9WDOEDfpaapOWZ_0adXVgYLABxOJwvOCv4,103
-gamspy_highs-50.4.1.dist-info/top_level.txt,sha256=t-Xx6EkaD4Hc2BEfgzl7oAbnr2-Aot5_4MdAMgoV1xY,13
-gamspy_highs-50.4.1.dist-info/RECORD,,