gamspy-base 52.0.0rc1__py3-none-macosx_13_0_x86_64.whl

gamspy_base/optnlpec.def

@@ -0,0 +1,69 @@
+*
+* optnlpec.def
+*
+
+allSolves boolean.nv 0 0 1 2 do all solves in a loop regardless of previous failure
+dumpValid boolean.nv 0 0 1 2 dump valid reformulation options to a GDX file and exit
+noCheck boolean.nv 0 0 1 2 do not check consistency of reformulation options
+finalMu double.two 0 0 0 maxdouble 1 2 final value of parameter mu
+initMu double.two 0 0 0 maxdouble 1 2 initial value of parameter mu
+initSLo double 0 0 mindouble maxdouble 1 2 lower bound for artificials added to the problem
+initSUp double 0 maxdouble mindouble maxdouble 1 2 upper bound for artificials added to the problem
+dotGams string 0 "" 1 2 name of gams source file for scalar model
+parmFile string 0 "" 1 2 extra GAMS options for running scalar model
+subSolver string 0 "" 1 2 controls what subsolver to run
+subSolverOpt integer 0 0 0 maxint 1 2 optfile value to pass to the subsolver
+numSolves integer 0 0 0 maxint 1 2 number of looped solves
+equReform integer 0 0 0 33 1 2 outdated and deprecated
+testTol double 0 1e-005 0 maxdouble 1 2 tolerance for complementarity check in MPEC/MCP
+terminate boolean.nv 0 0 1 2 terminate after generating scalar GAMS source code
+updateFac double.two 0 1e-1 1e-280 1.0 1 2 update factor for mu
+refType enumstr.two 0 "mult" 1 1 reformulation type
+ "mult" 1 inner product <x,f> = 0
+ "min" 1 NCP function min(x,f)
+ "CMxf" 1 Chen-Mangasarian NCP function, explicit
+ "CMfx" 1 Chen-Mangasarian NCP function, explicit
+ "fCMxf" 1 Chen-Mangasarian NCP function, intrinsic
+ "fCMfx" 1 Chen-Mangasarian NCP function, intrinsic
+ "FB" 1 Fischer-Burmeister NCP function, explicit
+ "fFB" 1 Fischer-Burmeister NCP function, intrinsic
+ "FB_neg" 1 Fischer-Burmeister NCP function negated, explicit
+ "fFB_neg" 1 Fischer-Burmeister NCP function negated, intrinsic
+ "Bill" 1 Billups function for doubly-bounded variables, explicit
+ "fBill" 1 Billups function for doubly-bounded variables, intrinsic
+ "penalty" 1 weighted penalization of non-complementarity in objective
+ "median" 1 median function for doubly-bounded variables, explicit
+ "fVUsin" 1 Veelken-Ulbrich NCP function (smoothed min), intrinsic
+ "fVUpow" 1 Veelken-Ulbrich NCP function (smoothed min), intrinsic
+slack enumstr.two 0 "positive" 1 1 control use of slacks for function values
+ "none" 1 no slacks will be used
+ "free" 1 free slacks will be used
+ "positive" 1 non-negative slacks will be used
+ "one" 1 one free slack will be used for each h_i in the doubly bounded case
+constraint enumstr.two 0 "equality" 1 1 controls use of equality/inequality
+ "equality" 1 use =E= constraints
+ "inequality" 1 use =L= constraints
+aggregate enumstr.two 0 "none" 1 1 controls constraint aggregation
+ "none" 1 use no aggregation
+ "partial" 1 aggregate doubly-bounded variables separately from others
+ "full" 1 use maximum aggregation possible
+NCPBounds enumstr.two 0 "none" 1 1 sets explicit bounds on arguments of NCP functions
+ "none" 1 no explicit bounds
+ "function" 1 explicit bound on function/slack argument
+ "variable" 1 explicit bound on variable argument
+ "all" 1 explicit bound on both function and variable arguments
+*
+* synonym section
+*
+fileName synonym dotGams
+*
+* indicator section
+*
+myeolchar EOLCOMM #
+*
+* Groups
+* <group-ident> group <group-number <help-context> <help-text>
+*
+reform group 1 1 Reformulation Options
+general group 2 1 General Options
+*** End of file

gamspy_base/optpath.def

@@ -0,0 +1,231 @@
+*
+* optpath.def
+*
+path lookup
+output boolean 0 1 1 2 turns all output off or on
+output_model_statistics boolean 0 0 0 2 *** hidden
+cumulative_iteration_limit integer 0 10000 0 maxint 1 1 maximum minor iterations allowed
+adaptive_delta_break double 0 0 mindouble maxdouble 0 1 *** hidden
+adaptive_delta_current double 0 0 mindouble maxdouble 0 1 *** hidden
+adaptive_delta_high double 0 0 mindouble maxdouble 0 1 *** hidden
+adaptive_delta_low double 0 0 mindouble maxdouble 0 1 *** hidden
+adaptive_iteration integer 0 0 minint maxint 0 1 *** hidden
+adaptive_iterations_high integer 0 0 minint maxint 0 1 *** hidden
+adaptive_iterations_low integer 0 0 minint maxint 0 1 *** hidden
+adaptive_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+adaptive_tau_high double 0 0 mindouble maxdouble 0 1 *** hidden
+adaptive_tau_low double 0 0 mindouble maxdouble 0 1 *** hidden
+check_skew_symmetry boolean 0 0 0 1 *** hidden
+chen_lambda double 0 0.8 0 1 1 1 lambda parameter for Chen-Chen-Kanzow residual
+convergence_tolerance double 0 1e-6 0 maxdouble 1 1 stopping criterion
+crash_convergence_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_iteration_limit integer 0 50 0 maxint 1 1 maximum iterations allowed in basis crash
+crash_merit_function enumstr 0 "fischer" 1 1 merit function used in crash method
+ "normal" 1 Use the normal map
+ "fischer" 1 Use the Fischer function
+crash_method enumstr 0 "pnewton" 1 1 pnewton or none
+ "pnewton" 1 Use projected Newton method
+ "none" 1
+crash_minimum_dimension integer 0 1 0 maxint 1 1 minimum problem dimension to perform crash
+crash_minor_iteration_limit integer 0 0 minint maxint 0 1 *** hidden
+crash_nbchange_limit integer 0 1 0 maxint 1 1 limit on crash iterations without basis change
+crash_perturb boolean 0 1 1 1 perturb the problem using pnewton crash
+crash_proximal_increase_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_proximal_initial_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_proximal_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_proximal_merit_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_proximal_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_proximal_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_refine_frequency integer 0 0 minint maxint 0 1 *** hidden
+crash_searchtype enumstr 0 "line" 1 1 search type to use in the crash method
+ "line" 1 Use a linesearch
+ "arc" 1 Use an arcsearch
+crash_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_sigma double 0 0 mindouble maxdouble 0 1 *** hidden
+crash_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+decomposition_size_limit double 0 0 mindouble maxdouble 0 1 *** hidden
+detect_sign_flip boolean 0 0 0 1 *** hidden
+devex_delta double 0 0 mindouble maxdouble 0 1 *** hidden
+devex_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+expand_delta double 0 0 mindouble maxdouble 0 1 *** hidden
+expand_delta_current double 0 0 mindouble maxdouble 0 1 *** hidden
+expand_delta_end double 0 0 mindouble maxdouble 0 1 *** hidden
+expand_delta_start double 0 0 mindouble maxdouble 0 1 *** hidden
+expand_iteration integer 0 0 minint maxint 0 1 *** hidden
+expand_maximum_iterations integer 0 0 minint maxint 0 1 *** hidden
+expand_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+expand_tau double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_elbowroom double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_library_name string 0 "" 1 1 name of factorization library
+factorization_luroom double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_method enumstr 0 "lusol" 1 1 basis package to use
+ "lusol" 1
+ "blu_lusol" 1
+ "umfpack" 1
+ "umfpack64" 1
+ "highs" 1
+ "conopt" 1
+factorization_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_pivot_type integer 0 0 minint maxint 0 1 *** hidden
+factorization_small_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_update_limit integer 0 0 minint maxint 0 1 *** hidden
+factorization_update_ratio double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_update_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_vectorroom double 0 0 mindouble maxdouble 0 1 *** hidden
+factorization_zero_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+gmres_update_frequency integer 0 0 minint maxint 0 1 *** hidden
+gradient_refine_frequency integer 0 0 minint maxint 0 1 *** hidden
+gradient_searchtype enumstr 0 "arc" 1 1 search type to use on a gradient step
+ "line" 1 Use a linesearch
+ "arc" 1 Use an arcsearch
+gradient_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+gradient_sigma double 0 0 mindouble maxdouble 0 1 *** hidden
+gradient_step_limit integer 0 5 0 maxint 1 1 gradient steps allowed before restarting
+gradient_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+ilu_drop_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+ilu_perturbation double 0 0 mindouble maxdouble 0 1 *** hidden
+ilu_perturbation_decrease_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+ilu_perturbation_increase_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+ilu_perturbation_initial_value double 0 0 mindouble maxdouble 0 1 *** hidden
+ilu_perturbation_small_value double 0 0 mindouble maxdouble 0 1 *** hidden
+infinity double 0 0 mindouble maxdouble 0 1 *** hidden
+interrupt_limit integer 0 5 1 maxint 1 1 ctrl-C's required before a hard kill of the solver
+jacobian_smoothing double 0 0 mindouble maxdouble 0 1 *** hidden
+lemke_artificial_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
+lemke_artificial_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+lemke_cycle_limit integer 0 0 minint maxint 0 1 *** hidden
+lemke_maximum_iteration_limit integer 0 0 minint maxint 0 1 *** hidden
+lemke_pivot_type enumstr 0 "expand" 0 1 *** hidden
+ "textbook" 1
+ "devex" 1
+ "expand" 1
+ "adaptive" 1
+lemke_rank_deficiency_iterations integer 0 10 0 maxint 1 1 number of attempts made to fix rank-deficient basis during Lemke start
+lemke_rayterm_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+lemke_return_best_point boolean 0 0 0 1 *** hidden
+lemke_scale_residual boolean 0 0 0 1 *** hidden
+lemke_size_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+lemke_start enumstr 0 "automatic" 1 1 frequency of lemke starts
+ "always" 1 Use a Lemke start for each LCP subproblem
+ "automatic" 1 Determined by algorithm
+ "first" 1 Use a Lemke start for the first LCP subproblem
+lemke_start_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+lemke_start_type enumstr 0 "slack" 1 1 type of lemke start
+ "advanced" 1 Start Lemke method using an advanced basis
+ "slack" 1 Start Lemke method using an all-slack basis
+linear_model_perturb boolean 0 0 0 1 *** hidden
+linear_model_presolve boolean 0 0 0 1 *** hidden
+linear_model_scale boolean 0 0 0 1 *** hidden
+linear_scale_method enumstr 0 "diagonal" 0 1 *** hidden
+ "Todd" 1
+ "Chen" 1
+ "diagonal" 1
+ "row" 1
+ "col" 1
+ "both" 1
+ "symmetric" 1
+ "ro1" 1
+ "ro2" 1
+ "ro3" 1
+ "ro4" 1
+major_iteration_limit integer 0 500 0 maxint 1 1 maximum major iterations allowed
+merit_function enumstr 0 "fischer" 1 1 merit function to use (normal or fischer)
+ "normal" 1 Use the normal map
+ "fischer" 1 Use the Fischer function
+minor_iteration_limit integer 0 1000 0 maxint 1 1 minor iterations allowed in each major iteration: default MIN(2n,iterlim)
+nms boolean 0 1 1 1 allow line searching, watch-dogging, and nonmonotone descent
+nms_delta_min double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_delta_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_initial_monotone_steps integer 0 0 minint maxint 0 1 *** hidden
+nms_initial_reference_factor double 0 20 0 maxdouble 1 1 controls size of initial reference value
+nms_initial_reference_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_initial_stepsize_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_initial_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_large_reference_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_maximum_watchdogs integer 0 5 0 maxint 1 1 maximum number of watchdog steps allowed
+nms_memory_size integer 0 10 0 maxint 1 1 number of reference values kept
+nms_mstep_frequency integer 0 10 0 maxint 1 1 frequency at which m-steps are performed
+nms_pathsearch_interpolate boolean 0 0 0 1 *** hidden
+nms_refine_frequency integer 0 0 minint maxint 0 1 *** hidden
+nms_searchtype enumstr 0 "line" 1 1 search type to use
+ "line" 1 Use a linesearch
+ "arc" 1 Use an arcsearch
+nms_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_sigma double 0 0 mindouble maxdouble 0 1 *** hidden
+nms_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+nonlinear_model_perturb boolean 0 0 0 1 *** hidden
+nonlinear_model_presolve boolean 0 0 0 1 *** hidden
+nonlinear_model_scale boolean 0 0 0 1 *** hidden
+nonlinear_model_use_start boolean 0 0 0 1 *** hidden
+output_crash_iterations boolean 0 1 1 2 output information on crash iterations
+output_crash_iterations_frequency integer 0 1 1 maxint 1 2 frequency at which crash iteration log is printed
+output_errors boolean 0 1 1 2 output error messages
+output_factorization_singularities boolean 0 0 0 2 *** hidden
+output_factorization_updates boolean 0 0 0 2 *** hidden
+output_factorization_updates_frequency integer 0 0 minint maxint 0 2 *** hidden
+output_final_degeneracy_statistics boolean 0 0 1 2 print information regarding degeneracy at the solution
+output_final_point boolean 0 0 1 2 output final point returned from PATH
+output_final_point_statistics boolean 0 1 1 2 output information about the point, function, and Jacobian at the final point
+output_final_scaling_statistics boolean 0 0 1 2 display matrix norms on the Jacobian at the final point
+output_final_statistics boolean 0 1 1 2 output evaluation of available merit functions at the final point
+output_final_summary boolean 0 1 1 2 output summary information
+output_hidden_options boolean 0 0 0 2 *** hidden
+output_initial_point boolean 0 0 1 2 output initial point given to PATH
+output_initial_point_statistics boolean 0 1 1 2 output information about the point, function, and Jacobian at the initial point
+output_initial_scaling_statistics boolean 0 1 1 2 display matrix norms on the Jacobian at the initial point
+output_initial_statistics boolean 0 0 1 2 output evaluation of available merit functions at the initial point
+output_license boolean 0 0 0 2 *** hidden
+output_linear_model boolean 0 0 1 2 output linear model at each major iteration
+output_major_iterations boolean 0 1 1 2 output information on major iterations
+output_major_iterations_frequency integer 0 1 1 maxint 1 2 frequency at which major iteration log is printed
+output_maximum_zero_log integer 0 10 0 maxint 1 2 limits zero columns reported to log file
+output_maximum_zero_listing integer 0 1000 0 maxint 1 2 limits zero columns reported to listing file
+output_minor_iterations boolean 0 1 1 2 output information on minor iterations
+output_minor_iterations_frequency integer 0 500 1 maxint 1 2 frequency at which minor iteration log is printed
+output_nms_iterations boolean 0 0 0 2 *** hidden
+output_nms_iterations_frequency integer 0 0 minint maxint 0 2 *** hidden
+option_direct strlist 1 0 1 pass options directly to PATH library
+option_file string 1 "" 1 1 name of option file for PATHLIB to read
+output_options boolean 0 0 1 2 output all options and their values
+output_preprocess_level integer 0 1 -1 maxint 1 2 control output of preprocessing information
+output_restart_log boolean 0 1 1 2 output options during restarts
+output_time boolean 1 0 1 2 output breakdown of where time is spent
+output_warnings boolean 0 0 1 2 output warning messages
+path_basis_modify_tol double 0 0 mindouble maxdouble 0 1 *** hidden
+path_basis_modify_verbose boolean 0 0 0 1 *** hidden
+preprocess boolean 0 1 1 1 turns preprocessing on/off
+preprocess_implied boolean 0 0 0 1 *** hidden
+preprocess_jacobian_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+preprocess_recursive boolean 0 0 0 1 *** hidden
+preprocess_tighten boolean 0 0 0 1 *** hidden
+preprocess_zero_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+project_start boolean 0 0 0 1 *** hidden
+proximal_dual boolean 0 0 0 1 *** hidden
+proximal_increase_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+proximal_initial double 0 0 mindouble maxdouble 0 1 *** hidden
+proximal_initial_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
+proximal_merit_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+proximal_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
+proximal_perturbation double 0 0 0 maxdouble 1 1 initial perturbation
+proximal_primal boolean 0 0 0 1 *** hidden
+proximal_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+recovery_method enumstr 0 "none" 0 1 *** hidden
+ "none" 1
+residual_factor double 0 0 mindouble maxdouble 0 1 *** hidden
+residual_size double 0 0 mindouble maxdouble 0 1 *** hidden
+restart_limit integer 0 0 minint maxint 0 1 *** hidden: maximum number of restarts attempted
+restart_stationary_limit integer 0 0 minint maxint 0 1 *** hidden
+restart_stationary_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+return_best_point boolean 0 0 0 1 *** hidden: return the best point encountered, not the absolute last iterate
+textbook_delta double 0 0 mindouble maxdouble 0 1 *** hidden
+textbook_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
+time_limit double 0 0 0 maxdouble 1 1 number of seconds algorithm is allowed to run
+myeolchar EOLCOMM ;#!
+*
+* Groups
+* <group-ident> group <group-number <help-context> <help-text>
+*
+general group 1 1 General options
+output group 2 1 Output options
+*** End of file

gamspy_base/optsbb.def

@@ -0,0 +1,94 @@
+*
+* optsbb.def
+*
+
+reslim double 0 1000 0 maxdouble 0 1 resource limit
+iterlim integer 0 10000 0 maxint 0 1 iteration limit
+domlim integer 0 0 0 maxint 0 1 domain violation limit
+nodlim integer 0 100 0 maxint 0 1 node limit
+tryint double 0 0 0 maxdouble 0 1 tryint tolerance
+optca double 0 0 0 maxdouble 0 1 absolute stopping tolerance
+optcr double 0 0.1 0 maxdouble 0 1 relative stopping tolerance
+cheat double 0 0 0 maxdouble 0 1 overrides GAMS Cheat parameter
+cutoff double 0 0 0 maxdouble 0 1 cutoff for tree search
+sysout boolean 0 0 0 1 system output
+rootsolver string 0 "" 1 1 solver for the root node
+subsolver string 0 "" 1 1 solver for the subproblems
+loginterval integer 0 1 0 maxint 1 1 progress display interval
+loglevel enumint 0 1 1 1 level of solver display
+ 0 1 only SBB log lines with one line every loginterval nodes
+ 1 1 NLP solver log for the root node plus SBB loglines as 0
+ 2 1 NLP solver log for all nodes plus SBB log lines as 0
+subres double 0 0.0 0.0 maxdouble 1 1 resource limit for the subsolve
+subiter integer 0 0 0 maxint 1 1 iteration limit for the subsolve
+failseq string 0 "" 1 1 solver sequence for failed nodes
+infeasseq string 0 "" 1 1 solver sequence for infeasible nodes
+acceptnonopt boolean 0 0 1 1 accepts feasible solution from subsolver
+avgresmult integer 0 5 -1 maxint 1 1 average resource multiplicator
+nodesel enumint 0 0 1 1 node selection strategy
+ 0 1 automatic
+ 1 1 Depth First Search (DFS)
+ 2 1 Best Bound (BB)
+ 3 1 Best Estimate (BE)
+ 4 1 DFS/BB mix
+ 5 1 DFS/BE mix
+ 6 1 DFS/BB/BE mix
+dfsstay integer 0 0 0 maxint 1 1 keeps DFS node selection after solution has been found
+varsel enumint 0 0 1 1 variable selection strategy at each node
+ 0 1 automatic
+ 1 1 maximum integer infeasibility
+ 2 1 minimum integer infeasibility
+ 3 1 pseudo costs
+epint double 0 1.0e-5 1e-9 1 1 1 integer feasibility tolerance
+memnodes integer 0 10000 0 maxint 1 1 maximum number of nodes in memory
+printbbinfo enumint 0 0 1 1 prints additional node info
+ 0 1 print no additional info
+ 1 1 print variable selection letter
+ 2 1 print best estimate
+intsollim integer 0 2100000000 1 2100000000 1 1 maximum number of integer solutions
+usercallparmfile string 0 "" 1 1 Command-line parameter include file used in GAMS command-line calls triggered by BCH
+userheurcall string 0 "" 1 1 the GAMS command line to call the heuristic
+usergdxname string 0 "bchout.gdx" 1 1 the name of the GDX file exported from the solver with the solution at the node
+usergdxnameinc string 0 "bchout_i.gdx" 1 1 the name of the GDX file exported from the solver with the incumbent solution
+userheurfreq integer 0 10 0 maxint 1 1 determines the frequency of the cut generator model calls
+userheurinterval integer 0 100 0 maxint 1 1 determines the interval when to apply the multiplier for the frequency of the cut generator model calls
+userheurmult integer 0 2 0 maxint 1 1 determines the multiplier for the frequency of the cut generator model calls
+userheurfirst integer 0 10 0 maxint 1 1 calls the cut generator for the first n nodes
+userheurobjfirst integer 0 50 0 maxint 1 1 Similar to UserHeurFirst but only calls the heuristic if the relaxed objective promises an improvement
+userheurnewint boolean 0 0 1 1 calls the heuristic if the solver found a new integer feasible solution
+miptrace string 0 "" 1 1 filename of MIP trace file
+miptracenode integer 0 100 1 maxint 1 1 node interval when a trace record is written
+miptracetime double 0 5.0 1e-5 maxdouble 1 1 time interval when a trace record is written
+bbdfsmult double 0 3.0 1e-5 maxdouble 0 1 best-bound to dfs switch option
+ninfmult double 0 3.0 1e-5 maxdouble 0 1 best-bound to dfs switch option
+rgapmult double 0 0.9 1e-5 maxdouble 0 1 best-bound to dfs switch option
+debuglevel integer 0 0 0 maxint 0 1 level of debug information printed
+finalsolver string 0 "" 0 1 solver for the final solve
+solvelink enumint 0 5 1 1 Solvelink for GAMS NLP solver
+ 1 1 Call GAMS NLP solver via script
+ 2 1 Call GAMS NLP solver via module
+ 4 0 Call NLP and MIP solver via grid script (simulate)
+ 5 1 Call GAMS NLP solver in memory
+stopnode integer 0 0 0 maxint 0 1 node number where SBB will stop with solving node
+stopexclnode integer 0 0 0 maxint 0 1 node number where SBB will stop without solving node
+printrootiter boolean 0 0 0 1 prints the iterations at node 0
+bemult double 0 1.0 1e-5 maxdouble 0 1 best estimate stuff
+beover double 0 0.5 1e-5 maxdouble 0 1 best estimate stuff
+beunder double 0 0.5 1e-5 maxdouble 0 1 best estimate stuff
+lowbbcnt integer 0 10 0 maxint 0 1 best estimate stuff
+medbecnt integer 0 1 0 maxint 0 1 best estimate stuff
+highbecnt integer 0 10 0 maxint 0 1 best estimate stuff
+printvar boolean 0 0 0 1 prints branching variable number
+strict boolean 0 0 0 1 with strict enabled SBB terminates on minor problems
+gdxout string 0 "" 0 1 name stem of solution GDX files
+nobounds immediate nobounds 0 1 ignores bounds on options
+readfile immediate readfile 0 1 read secondary option file
+*
+* indicator section
+*
+*
+* Groups
+* <group-ident> group <group-number <help-context> <help-text>
+*
+general group 1 1 General Options
+*** End of file

gamspy_base/version.py

@@ -0,0 +1 @@
+__version__ = '52.0.0rc1'

gamspy_base-52.0.0rc1.dist-info/METADATA

@@ -0,0 +1,65 @@
+Metadata-Version: 2.4
+Name: gamspy_base
+Version: 52.0.0rc1
+Description-Content-Type: text/markdown
+Dynamic: description
+Dynamic: description-content-type
+
+# GAMSPy Base
+
+GAMSPy Base is a subset of full GAMS installation which can be found at: https://gams.com/download/.
+
+## How to use it in other GAMS APIs
+
+[Control](https://www.gams.com/latest/docs/API_PY_CONTROL.html):
+
+```
+from gams import GamsWorkspace
+from gamspy_base import directory
+ws = GamsWorkspace(system_directory=directory)
+```
+
+[Magic](https://www.gams.com/latest/docs/API_PY_MAGIC.html):
+
+```
+%reload_ext gams.magic
+from gamspy_base import directory
+gams.reset(directory)
+```
+
+[GamsInteractive](https://www.gams.com/latest/docs/API_PY_MAGIC.html#PY_MAGIC_INTERACTIVE):
+
+```
+from gamspy_base import directory
+from gams.magic import GamsInteractive
+gams = GamsInteractive()
+gams.reset(directory)
+```
+
+[Transfer](https://www.gams.com/latest/docs/API_PY_GAMSTRANSFER.html):
+
+```
+import gams.transfer as gt
+from gamspy_base import directory
+m = gt.Container(system_directory=directory)
+```
+
+[Connect](https://www.gams.com/latest/docs/UG_GAMSCONNECT.html#UG_GAMSCONNECT_CUSTOM_PYTHON_CODE):
+
+```
+from gams.connect import ConnectDatabase
+from gamspy_base import directory
+cdb = ConnectDatabase(directory)
+```
+
+[GDX Expert-Level](https://www.gams.com/latest/docs/apis/expert-level/gdxqdrep.html):
+
+```
+import gams.core.gdx as gdx
+from gamspy_base import directory
+rc = gdx.gdxGetReadyD(directory, 255)
+```
+
+## License Agreement
+
+By downloading this software, you agree to the [GAMS license agreement](https://www.gams.com/GAMS_EULA.pdf).

gamspy_base-52.0.0rc1.dist-info/RECORD

@@ -0,0 +1,60 @@
+gamspy_base/__init__.py,sha256=THrfACW-2lyVhv-wBELqNSOAev6FzPmkRQ1iLhiU2Bo,5047
+gamspy_base/eula.pdf,sha256=2Q9rczcNINsmZIc3110QKenVtrivaUzzvOe6wzi1q4M,134031
+gamspy_base/gams,sha256=s8cqiuxITZ0gQj60x4rm68GGQ2EB9uZLnvgUzz_eNkc,1857984
+gamspy_base/gamscmex.out,sha256=eeyJZHomd9rWHA8NgnGS-7Y_5BQuCF1BE5IbH2Y1USc,4582768
+gamspy_base/gamserrs.txt,sha256=RG0juiQ79uff8nmjNxyKElTX0huOaNkrt-jpTKr27vU,64691
+gamspy_base/gamsgetkey,sha256=qncqPBxQkd6erhZhe9Nt14T9XLYD1oKsWsn8KRBqWrM,6339696
+gamspy_base/gamslice.txt,sha256=du5s0CgaE0vZpaGcvu_D9z5e4Jm5oh-wAaA2wCrxW8s,528
+gamspy_base/gamsprobe,sha256=SFI_lcZH6aUkHylAfajPVgipAV8BXuGTusKmdsJm_Cg,295072
+gamspy_base/gamsstmp.txt,sha256=okaCboPfWk70h7FqXcu8zPbu4UsS3TMgFzkfZ9be1Dg,59
+gamspy_base/gdxdiff,sha256=LTpNdWN4Yl0pgxjXOwDjNZyX-3SsCUtbCQkaL-xI_oc,345072
+gamspy_base/gdxdump,sha256=WQWGHJihAjUud5gM0yfKIHtTuDhm_c00h-WAZ8psmMo,333536
+gamspy_base/gevopt.def,sha256=dsn2Gj3F3-HoysGgC-G1ljcQUkXfk6q9ZT5ff1jkz1Y,5590
+gamspy_base/gmscmpun.txt,sha256=vFofayw68RIAZDFpyB8O6AsXOiLnDDIwcAi8n2yLOlc,1212
+gamspy_base/gmscvnus.run,sha256=7Vs7Qt_g9lWDbXyRtNdRBlAskSjGw3uRQHD3oVvjP28,103
+gamspy_base/gmscvnux.out,sha256=sUQoP9qKRj4MZnvCK8krV5tVzezJdQmEi9IGN1x80gA,1685936
+gamspy_base/gmsgenus.run,sha256=CWkGIbZ8GHkWqwIn8mYSwwH3FG7jotf4-TkhMtU5iLs,125
+gamspy_base/gmsgenux.out,sha256=aIWtNu2PG3ZhGwO-TtiOVEjDb7p2928hmb_1DOFSs38,863104
+gamspy_base/gmske_us.run,sha256=NiEZ_Zt9JSyGHN9C0a5ovU36RaHU9GU-HPdsCReUZQ8,316
+gamspy_base/gmske_ux.out,sha256=xsffBtVb6Pc2YZ-RNbUCUIrZ82DG27C6B8hLyG0U_pI,30061
+gamspy_base/gmsprmun.txt,sha256=pAY11XcRhHAq0wKQ4a2iujFIJQL4Pm6YylFQHNjSDK0,430
+gamspy_base/gmssb_us.run,sha256=Qp0FGZmIYlIJrl9abXlFHn7VtW4xOSRrjyXXjbWyfXQ,103
+gamspy_base/gmssb_ux.out,sha256=nJiSDJspa8WD0mpNopDP-Q9jb1P2rNJKTVufjYr6Wxk,532544
+gamspy_base/libco4cclib64.dylib,sha256=2QXis4Be030yakS6n93BJi14_ztjehGRUWkkNvVpTKM,362032
+gamspy_base/libconopt464.dylib,sha256=5yreMGOhrRIFNzTxa_IF2YS2zcXgdllzc0_YpdSLtWs,3025856
+gamspy_base/libconoptlu.dylib,sha256=JQ1pxcZG6HBg6V7ZTII3Y0wE7nPsYsxtA1u-hqoBl44,1176000
+gamspy_base/libcplex2212.dylib,sha256=kKG5e_ZkpqYigqrhc7C_0y_dWcHyldxB0zwbe9bD8fo,29681472
+gamspy_base/libcpxcclib64.dylib,sha256=9-Y3LJbH2QFG7hpYcARw4svTTo0O0PgdDF2yLWjC-Zg,648352
+gamspy_base/libcrypto.3.dylib,sha256=V3u6vDwzRMkI6etuYtSorvCsAV7N-TuzFJVXaxTQ30s,5047056
+gamspy_base/libcvdcclib64.dylib,sha256=fQQ3vgPDkvfsui5C0m5gQPK6XWdV0zJ54wyu16kej5A,680096
+gamspy_base/libdctmdclib64.dylib,sha256=oKkLzqgjilzphv_BZmDrGrcU4R5ClqwQpCkvjAD0BNc,581200
+gamspy_base/libgcc_s.1.1.dylib,sha256=QLqFttuoq83fz3H0RP_cEbcQi9Xdq5WPVC2qpxJ-53s,233200
+gamspy_base/libgdxcclib64.dylib,sha256=PIcoN7-YQYWo-efrz9YI-Wx-TgqiKep6YJ5vSOu-jFo,586624
+gamspy_base/libgdxdclib64.dylib,sha256=DRbKMc7XuZU1VcIPkhZdTFHAjNbE0Cu_1Emb8_DKyrQ,803216
+gamspy_base/libgfortran.5.dylib,sha256=23KWg7HBBaTInVMeWdPsvQfM9pAg5JVxCI9geyJGuVE,3957120
+gamspy_base/libgmdcclib64.dylib,sha256=fOzsvtUS1qLDgVTyAkaurcDS-OPjloQ584OCNH4hV0A,1415488
+gamspy_base/libgmszlib164.dylib,sha256=QuphnHXXUrREhwA9C7niPuNzFWnc-V2NZ2MpempePCA,116704
+gamspy_base/libgomp.1.dylib,sha256=Ol9TnLCVkAQJyY1IM2XQdr1El1xOMctqt1oKFQd6Y-g,441872
+gamspy_base/libgsscclib64.dylib,sha256=8e7g_BzFyIvL_25D9zXWzzztcAwWLcLxVtzwKs-Qx54,462656
+gamspy_base/libguccclib64.dylib,sha256=ZpjRYvJgQ4O0ZNZC-bheG66Wflt6X3tIDyH8MpeSt4g,163216
+gamspy_base/libjoatdclib64.dylib,sha256=ZJNN2AoFqB3Tt26yJre4n5xwABtJBW40vGX82IF9YBc,3690912
+gamspy_base/liboptdclib64.dylib,sha256=O53Y7wke8UFBT-dhKAgKZdq2vtQwE0IFC81aU7mX5Ro,796976
+gamspy_base/libpath52.dylib,sha256=ZcbXeqhvUfgxEavvNuBw3D2S7H1kqjeYVob-Mz-Mw0o,946912
+gamspy_base/libptccclib64.dylib,sha256=KU0jHz6dN6FKna79s1GRDKx9Pp2R3Esm0o_R99rKPW4,441792
+gamspy_base/libquadmath.0.dylib,sha256=5P_4DICMCampd8gT8urkCx4P8IyGUS8BXAUiDgajSw0,356192
+gamspy_base/libssl.3.dylib,sha256=BpwsponL1MaIEiCcod4ds8NDvIq-_WIGBP2T6ph5Dko,785744
+gamspy_base/libstdc++.6.dylib,sha256=EMUi9sFNoWAWGxeJuVnF69RZMvxFPwCcVDi67iwwvak,3648240
+gamspy_base/mps2gms,sha256=FvxJR0Qj1kBw-BWPEE_4EIMHbwwoXspmwetjMAnhiLM,5368784
+gamspy_base/optconopt.def,sha256=UpjQzSbvopdD1djYS7VdjF4u0RCMdDqicFGGE74xuCo,15645
+gamspy_base/optconvert.def,sha256=DcKtF5AYGB4DLTWmN-huAsi2Jbw9jaW6Km1pkj8_zNY,6497
+gamspy_base/optcplex.def,sha256=NaPXB9xsYoQ1IpSh91rg0HYJOOquLaF8VKKmN-YfhNs,40606
+gamspy_base/optgams.def,sha256=hO6GxPlqLLercwMr8fKVoZ4CGTvm4FB-Vh6CsS8BmTc,38467
+gamspy_base/optnlpec.def,sha256=4Y212OrT1Xl2GN3Jlfo8ZuFiSSo0NfUw_yw8uMWtgmg,3329
+gamspy_base/optpath.def,sha256=y52dSnVrSFZO9e0tomn_jPUjMUOzZsJfOkJN1X3qocA,13755
+gamspy_base/optsbb.def,sha256=hema6yiNepZvQV6UCBcBqTDxacAxVHu6mvu7UBfc50M,5115
+gamspy_base/version.py,sha256=xEmi9aNSuCk1FB4wuU1dnHDcnFovh89ZPfIiCZCjNrA,25
+minigams-env-3.129d2d53b5/lib/python3.12/site-packages/minigams/GAMSPY_BASE_README.md,sha256=x8ggw1-3ByQsnXtckbsru-ZEVAAfLZsXTjNXbjbqil8,1444
+gamspy_base-52.0.0rc1.dist-info/METADATA,sha256=ZNym371HzYK72zI9wF71ZfujNIgwfbS2QdsWjbkuIyA,1599
+gamspy_base-52.0.0rc1.dist-info/WHEEL,sha256=SFDFti0ktJEDbNgnSkwKMLyZhusCvEO6pqHMXousbqU,112
+gamspy_base-52.0.0rc1.dist-info/top_level.txt,sha256=fHPPNkvwG72CqYg3ST58kZ324kKtxZxZEzxSp_mM_EE,12
+gamspy_base-52.0.0rc1.dist-info/RECORD,,

gamspy_base-52.0.0rc1.dist-info/WHEEL

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

gamspy_base-52.0.0rc1.dist-info/top_level.txt

@@ -0,0 +1 @@
+gamspy_base

minigams-env-3.129d2d53b5/lib/python3.12/site-packages/minigams/GAMSPY_BASE_README.md

@@ -0,0 +1,58 @@
+# GAMSPy Base
+
+GAMSPy Base is a subset of full GAMS installation which can be found at: https://gams.com/download/.
+
+## How to use it in other GAMS APIs
+
+[Control](https://www.gams.com/latest/docs/API_PY_CONTROL.html):
+
+```
+from gams import GamsWorkspace
+from gamspy_base import directory
+ws = GamsWorkspace(system_directory=directory)
+```
+
+[Magic](https://www.gams.com/latest/docs/API_PY_MAGIC.html):
+
+```
+%reload_ext gams.magic
+from gamspy_base import directory
+gams.reset(directory)
+```
+
+[GamsInteractive](https://www.gams.com/latest/docs/API_PY_MAGIC.html#PY_MAGIC_INTERACTIVE):
+
+```
+from gamspy_base import directory
+from gams.magic import GamsInteractive
+gams = GamsInteractive()
+gams.reset(directory)
+```
+
+[Transfer](https://www.gams.com/latest/docs/API_PY_GAMSTRANSFER.html):
+
+```
+import gams.transfer as gt
+from gamspy_base import directory
+m = gt.Container(system_directory=directory)
+```
+
+[Connect](https://www.gams.com/latest/docs/UG_GAMSCONNECT.html#UG_GAMSCONNECT_CUSTOM_PYTHON_CODE):
+
+```
+from gams.connect import ConnectDatabase
+from gamspy_base import directory
+cdb = ConnectDatabase(directory)
+```
+
+[GDX Expert-Level](https://www.gams.com/latest/docs/apis/expert-level/gdxqdrep.html):
+
+```
+import gams.core.gdx as gdx
+from gamspy_base import directory
+rc = gdx.gdxGetReadyD(directory, 255)
+```
+
+## License Agreement
+
+By downloading this software, you agree to the [GAMS license agreement](https://www.gams.com/GAMS_EULA.pdf).