gamspy-base 51.0.0rc1__py3-none-manylinux_2_28_x86_64.whl

gamspy_base/optcplex.def

@@ -0,0 +1,880 @@
+*
+* optcplex.def
+*
+
+usebasis boolean 0 0 0 1 GMO usebasis
+cutoff double 0 0.0 mindouble maxdouble 0 1 GMO cutoff
+tryint double 0 0.0 0 1 0 1 GMO tryint
+.benderspartition integer 0 0 0 maxint 1 7 Benders partition
+benderspartitioninstage boolean 0 0 1 7 Benders partition through stage variable suffix
+bndrng strlist 0 1 1 do lower / upper bound ranging
+cardls enumint 2235 -1 1 7 decides how often to apply the cardinality local search heuristic (CLSH)
+ -1 1 Do not apply CLSH
+ 0 1 Automatic
+ 1 1 Apply the CLSH only at the root node
+ 2 1 Apply the CLSH at the nodes of the branch and bound tree
+cuts enumstr 0 "0" 1 7 default cut generation
+ "-1" 1 Do not generate cuts
+ "0" 1 Determined automatically
+ "1" 1 Generate cuts moderately
+ "2" 1 Generate cuts aggressively
+ "3" 1 Generate cuts very aggressively
+ "4" 1 Generate cuts highly aggressively
+ "5" 1 Generate cuts extremely aggressively
+ "yes" 0 Determined automatically. This is a deprecated setting. Please use 1 to 5.
+ "no" 0 Do not generate cuts. This is a deprecated setting. Please use 0.
+.divflt double 0 0 mindouble maxdouble 1 9 solution pool range filter coefficients
+divfltlo double 0 mindouble mindouble maxdouble 1 9 lower bound on diversity
+divfltup double 0 maxdouble mindouble maxdouble 1 9 upper bound on diversity
+exactkappa boolean 0 0 1 11 report exact condition number in quality report
+feasopt boolean 0 0 1 1 computes a minimum-cost relaxation to make an infeasible model feasible
+ 0 Turns Feasible Relaxation off
+ 1 Turns Feasible Relaxation on
+.feaspref double 0 1 0 1e+020 1 1 feasibility preference
+fixoptfile string 0 "" 1 1 name of option file which is read just before solving the fixed problem
+freegamsmodel boolean 0 0 1 1 preserves memory by dumping the GAMS model instance representation temporarily to disk
+iafile string 0 "" 1 1 secondary option file to be read in interactive mode triggered by iatriggerfile
+iatriggerfile string 0 "" 1 1 file that triggers the reading of a secondary option file in interactive mode
+iatriggertime double 0 60 1 maxdouble 1 1 time interval in seconds the link looks for the trigger file in interactive mode
+iis enumint 0 0 1 2 run the conflict refiner also known as IIS finder if the problem is infeasible
+ 0 1 No conflict analysis
+ 1 1 Conflict analysis after solve if infeasible
+ 2 1 Conflict analysis without previous solve
+indicoptstrict boolean 0 1 1 1 abort in case of an error in indicator constraint in solver option file
+interactive boolean 0 0 1 1 allow interactive option setting after a Control-C
+.lazy boolean 0 0 1 7 Lazy constraints activation
+lazyconstraints boolean 0 0 1 7 Indicator to use lazy constraints
+ltol double 0 0 0 maxdouble 1 4 basis identification primal tolerance
+mipstart integer 0 0 0 6 1 7 use mip starting values
+ 0 do not use the values
+ 1 set discrete variable values and use auto mipstart level
+ 2 set all variable values and use check feasibility mipstart level
+ 3 set discrete variable values and use solve fixed mipstart level
+ 4 set discrete variable values and use solve sub-MIP mipstart level
+ 5 set discrete variable values and use solve repair-MIP mipstart level
+ 6 set discrete variable values and use no checks at all. Warning: CPLEX may accept infeasible points as solutions!
+mipstopexpr strlist 0 1 7 stopping expression for branch and bound
+miptrace string 0 "" 1 11 filename of MIP trace file
+miptracenode integer 0 100 0 maxint 0 11 node interval when a trace record is written
+miptracetime double 0 1 0 maxdouble 0 11 time interval when a trace record is written
+mtol double 0 0 0 maxdouble 1 4 basis identification dual tolerance
+multimipstart strlist 0 1 7 use multiple mipstarts provided via gdx files
+multobj boolean 0 0 1 1 controls the hierarchical optimization of multiple objectives
+multobjmethod integer 0 0 0 6 1 1 method used for multi-objective solves
+multobjoptfiles strlist 0 1 1 List of option files used for individual solves within multi-objective optimization
+multobjtolmip boolean 0 1 1 1 enables hard constraints for hierarchical optimization objectives based on degradation tolerances
+names boolean 0 1 1 1 load GAMS names into Cplex
+nobounds immediate nobounds 0 1 ignores bounds on options
+objnabstol strlist 0 1 1 allowable absolute degradation for objective
+objnreltol strlist 0 1 1 allowable relative degradation for objective
+objrng strlist 0 1 1 do objective ranging
+printoptions boolean 0 0 1 1 list values of all options to GAMS listing file
+probread string 0 "" 0 1 reads a problem from a Cplex file
+qextractalg enumint 0 0 1 1 quadratic extraction algorithm in GAMS interface
+ 0 1 Automatic
+ 1 1 ThreePass: Uses a three-pass forward / backward / forward AD technique to compute function / gradient / Hessian values and a hybrid scheme for storage.
+ 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.
+ 3 1 Concurrent: Uses ThreePass and DoubleForward in parallel. As soon as one finishes, the other one stops.
+qextractdenseswitchfactor double 0 0.008 0 maxdouble 1 1 Sparse/dense factor for quadratic extraction algorithm in GAMS interface
+qextractdenseswitchlog boolean 0 0 1 1 Enables additional information about sparse/dense factor choice in quadratic extraction algorithm in GAMS interface
+quality boolean 0 0 1 11 write solution quality statistics
+readfile immediate readfile 0 1 read secondary option file
+readflt string 0 "" 1 9 reads Cplex solution pool filter file
+readparams string 0 "" 1 1 read Cplex parameter file
+relaxfixedinfeas boolean 0 0 1 7 accept small infeasibilties in the solve of the fixed problem
+ 0 Off
+ 1 On
+rerun enumstr 0 "nono" 1 1 rerun problem if presolve infeasible or unbounded
+ "auto" 1 Automatic
+ "yes" 1 Rerun infeasible models with presolve turned off
+ "no" 1 Do not rerun infeasible models
+ "nono" 1 Do not rerun infeasible fixed MIP models
+rhsrng strlist 0 1 1 do right-hand-side ranging
+rngrestart string 0 "" 1 1 write GAMS readable ranging information file
+secret strlist 0 0 1 pass on secret CPLEX options
+solnpool string 0 "" 1 9 solution pool file name
+solnpoolmerge string 0 "" 1 9 solution pool file name for merged solutions
+solnpoolnumsym integer 0 10 1 maxint 1 9 maximum number of variable symbols when writing merged solutions
+solnpoolpop enumint 0 1 1 9 methods to populate the solution pool
+ 1 1 Just collect the incumbents found during regular optimization
+ 2 1 Calls the populate procedure
+solnpoolpopdel string 0 "" 1 9 file with solution numbers to delete from the solution pool
+solnpoolpoprepeat string 0 "" 1 9 method to decide if populating the solution should be repeated
+solnpoolprefix string 0 "soln" 1 9 file name prefix for GDX solution files
+solvefinal boolean 0 1 1 7 switch to solve the problem with fixed discrete variables
+ 0 Do not solve the fixed problem
+ 1 Solve the fixed problem and return duals
+tuning strlist 0 1 1 invokes parameter tuning tool
+usercallparmfile string 0 "" 1 12 Command-line parameter include file used in GAMS command-line calls triggered by BCH
+usercgadvind integer 0 1 0 2 0 12 advanced basis use for column generation
+usercgdumplp string 0 "bchcgdump.lp" 0 12 dumps final model in CPLEX LP file
+usercgmaxcols integer 0 maxint 0 maxint 0 12 bound on number of columns add during column generation
+usercgsolopt boolean 0 0 0 12 decides if solution of extra columns is written packed or not i.e. just nonzeros solution value
+.usercut boolean 0 0 1 7 User cut activation
+usercutcall string 0 "" 1 12 the GAMS command line to call the cut generator
+usercutfirst integer 0 10 0 maxint 1 12 calls the cut generator for the first n nodes
+usercutfreq integer 0 10 0 maxint 1 12 determines the frequency of the cut generator model calls
+usercutinterval integer 0 100 0 maxint 1 12 determines the interval when to apply the multiplier for the frequency of the cut generator model calls
+usercutmult integer 0 2 0 maxint 1 12 determines the multiplier for the frequency of the cut generator model calls
+usercutnewint boolean 0 1 1 12 calls the cut generator if the solver found a new integer feasible solution
+usercutpool boolean 0 0 1 7 Indicator to use user cuts
+usergdxin string 0 "bchin.gdx" 1 12 the name of the GDX file read back into Cplex
+usergdxname string 0 "bchout.gdx" 1 12 the name of the GDX file exported from the solver with the solution at the node
+usergdxnameinc string 0 "bchout_i.gdx" 1 12 the name of the GDX file exported from the solver with the incumbent solution
+usergdxprefix string 0 "" 1 12 prefixes usergdxin, usergdxname, and usergdxnameinc
+usergdxsol string 0 "bchsol.gdx" 1 12 the name of the GDX file exported by Cplex to store the solution of extra columns
+userheurcall string 0 "" 1 12 the GAMS command line to call the heuristic
+userheurfirst integer 0 10 0 maxint 1 12 calls the heuristic for the first n nodes
+userheurfreq integer 0 10 0 maxint 1 12 determines the frequency of the heuristic model calls
+userheurinterval integer 0 100 0 maxint 1 12 determines the interval when to apply the multiplier for the frequency of the heuristic model calls
+userheurmult integer 0 2 0 maxint 1 12 determines the multiplier for the frequency of the heuristic model calls
+userheurnewint boolean 0 1 1 12 calls the heuristic if the solver found a new integer feasible solution
+userheurobjfirst integer 0 0 0 maxint 1 12 Similar to UserHeurFirst but only calls the heuristic if the relaxed objective promises an improvement
+userincbcall string 0 "" 1 12 the GAMS command line to call the incumbent checking program
+userincbicall string 0 "" 1 12 the GAMS command line to call the incumbent reporting program
+userjobid string 0 "" 1 12 postfixes lf, o on call adds --userjobid to the call. Postfixes gdxname, gdxnameinc and gdxin
+userkeep boolean 0 0 1 12 calls gamskeep instead of gams
+userlazyconcall string 0 "" 1 12 the GAMS command line to call the lazy constraint generator
+userpricingcall string 0 "" 0 12 the GAMS command line to call the pricing model
+usersolvenodelp string 0 "" 0 12 use the user solve node lp callback that dumps the bounds for infeasible nodes
+writeannotation string 0 "" 1 11 produce a Cplex annotation file
+writebas string 0 "" 1 11 produce a Cplex basis file
+writeflt string 0 "" 1 11 produce a Cplex solution pool filter file
+writelp string 0 "" 1 11 produce a Cplex LP file
+writemps string 0 "" 1 11 produce a Cplex MPS file
+writemst string 0 "" 1 11 produce a Cplex mst file
+writeord string 0 "" 1 11 produce a Cplex ord file
+writeparam string 0 "" 1 11 produce a Cplex parameter file with all active options
+writepre string 0 "" 1 11 produce a Cplex LP/MPS/SAV file of the presolved problem
+writeprob string 0 "" 1 11 produce a Cplex problem file and inferrs the type from the extension
+writesav string 0 "" 1 11 produce a Cplex binary problem file
+lowerobjstop double 2233 -1e75 mindouble maxdouble 1 7 in a minimization MILP or MIQP, the solver will abort the optimization process as soon as it finds a solution of value lower than or equal to the specified value
+upperobjstop double 2234 1e75 mindouble maxdouble 1 7 in a maximization MILP or MIQP, the solver will abort the optimization process as soon as it finds a solution of value greater than or equal to the specified value
+advind enumint 1001 1 1 1 advanced basis use
+ 0 1 Do not use advanced basis
+ 1 1 Use advanced basis if available
+ 2 1 Crash an advanced basis if available (use basis with presolve)
+aggcutlim integer 2054 3 0 2100000000 1 8 aggregation limit for cut generation
+aggfill integer 1002 10 0 2147483647 1 1 aggregator fill parameter
+aggind integer 1003 -1 -1 2100000000 1 1 aggregator on/off
+ -1 Once for LP, unlimited for MIP
+ 0 Do not use
+ >0 Aggregator will be applied the specified number of times
+auxrootthreads integer 2139 0 -1 2100000000 1 8 number of threads for auxiliary tasks at the root node
+ -1 Off: do not use additional threads for auxiliary tasks
+ 0 Automatic: let CPLEX choose the number of threads to use
+ N>n>0 Use n threads for auxiliary root tasks
+baralg enumint 3007 0 1 5 algorithm selection
+ 0 1 Same as 1 for LPs and MIP subproblems, 3 otherwise
+ 1 1 Infeasibility-estimate start
+ 2 1 Infeasibility-constant start
+ 3 1 standard barrier algorithm
+barcolnz integer 3009 0 0 2100000000 1 5 dense column handling
+barcrossalg enumint 3018 0 1 5 barrier crossover method
+ -1 0 No crossover
+ 0 1 Automatic
+ 1 1 Primal crossover
+ 2 1 Dual crossover
+bardisplay enumint 3010 1 1 11 progress display level
+ 0 1 No progress information
+ 1 1 Display normal information
+ 2 1 Display diagnostic information
+barepcomp double 3002 1.0e-08 1.0e-12 1.0e+75 1 5 convergence tolerance
+bargrowth double 3003 1.0e+12 1.0 1.0e+75 1 5 unbounded face detection
+baritlim integer 3012 2147483647 0 2147483647 1 5 iteration limit
+barmaxcor integer 3013 -1 -1 2147483647 1 5 maximum correction limit
+barobjrng double 3004 1.0e+20 0.0 1.0e+75 1 5 maximum objective function
+barorder enumint 3014 0 1 5 row ordering algorithm selection
+ 0 1 Automatic
+ 1 1 Approximate Minimum Degree (AMD)
+ 2 1 Approximate Minimum Fill (AMF)
+ 3 1 Nested Dissection (ND)
+barqcpepcomp double 3020 1.0e-07 1.0e-12 1.0e+75 1 5 convergence tolerance for the barrier optimizer for QCPs
+barstartalg enumint 3017 1 1 5 barrier starting point algorithm
+ 1 1 default primal, dual is 0
+ 2 1 default primal, estimate dual
+ 3 1 primal average, dual is 0
+ 4 1 primal average, estimate dual
+bbinterval integer 2039 7 0 2147483647 1 7 best bound interval
+bendersfeascuttol double 1509 1.0e-06 1.0e-09 0.1 1 10 Tolerance for whether a feasibility cut has been violated in Benders decomposition
+bendersoptcuttol double 1510 1.0e-06 1.0e-09 0.1 1 10 Tolerance for optimality cuts in Benders decomposition
+bendersstrategy enumint 1501 0 1 7 Benders decomposition algorithm as a strategy
+ -1 1 Off
+ 0 1 Automatic
+ 1 1 Apply user annotations
+ 2 1 Apply user annotations with automatic support for subproblems
+ 3 1 Apply automatic decomposition
+bndstrenind enumint 2029 -1 1 7 bound strengthening
+ -1 1 Determine automatically
+ 0 1 Don't use bound strengthening
+ 1 1 Use bound strengthening
+bqpcuts enumint 2195 0 1 7 boolean quadric polytope cuts for nonconvex QP or MIQP solved to global optimality
+ -1 1 Do not generate BQP cuts
+ 0 1 Determined automatically
+ 1 1 Generate BQP cuts moderately
+ 2 1 Generate BQP cuts aggressively
+ 3 1 Generate BQP cuts very aggressively
+brdir enumint 2001 0 1 7 set branching direction
+ -1 1 Down branch selected first
+ 0 1 Algorithm decides
+ 1 1 Up branch selected first
+bttol double 2002 1.0 0.0 1.0 1 7 backtracking limit
+calcqcpduals enumint 4003 1 1 1 calculate the dual values of a quadratically constrained problem
+ 0 1 Do not calculate dual values
+ 1 1 Calculate dual values as long as it does not interfere with presolve reductions
+ 2 1 Calculate dual values and disable any presolve reductions that would interfere
+cliques enumint 2003 0 1 7 clique cut generation
+ -1 1 Do not generate clique cuts
+ 0 1 Determined automatically
+ 1 1 Generate clique cuts moderately
+ 2 1 Generate clique cuts aggressively
+ 3 1 Generate clique cuts very aggressively
+clocktype enumint 1006 2 1 1 clock type for computation time
+ 0 1 Automatic
+ 1 1 CPU time
+ 2 1 Wall clock time
+clonelog enumint 1132 0 1 11 enable clone logs
+ -1 1 Clone log files off
+ 0 1 Automatic
+ 1 1 Clone log files on
+coeredind enumint 2004 -1 1 1 coefficient reduction on/off
+ -1 1 Automatic
+ 0 1 Do not use coefficient reduction
+ 1 1 Reduce only to integral coefficients
+ 2 1 Reduce all potential coefficients
+ 3 1 Reduce aggressively with tilting
+conflictalg integer 1073 0 0 6 1 2 algorithm CPLEX uses in the conflict refiner to discover a minimal set of conflicting constraints in an infeasible model
+conflictdisplay enumint 1074 1 1 2 decides how much information CPLEX reports when the conflict refiner is working
+ 0 1 No output
+ 1 1 Summary display
+ 2 1 Detailed display
+covers enumint 2005 0 1 7 cover cut generation
+ -1 1 Do not generate cover cuts
+ 0 1 Determined automatically
+ 1 1 Generate cover cuts moderately
+ 2 1 Generate cover cuts aggressively
+ 3 1 Generate cover cuts very aggressively
+cpumask string 1144 "auto" 1 1 switch and mask to bind threads to processors (Linux only)
+craind enumint 1007 1 1 2 crash strategy (used to obtain starting basis)
+ -1 1 Primal: alternate ways of using objective coefficients. Dual: aggressive starting basis
+ 0 1 Primal: ignore objective coefficients during crash.     Dual: aggressive starting basis
+ 1 1 Primal: alternate ways of using objective coefficients. Dual: default starting basis
+cutlo double 2006 -1.0e+75 mindouble maxdouble 1 7 lower cutoff for tree search
+cutpass integer 2056 0 -1 2147483647 1 8 maximum number of cutting plane passes
+ -1 None
+ 0 Automatically determined
+ >0 Maximum passes to perform
+cutsfactor double 2033 -1.0 -1.0 1.0e+75 1 7 cut limit
+cutup double 2007 1.0e+75 mindouble maxdouble 1 7 upper cutoff for tree search
+datacheck enumint 1056 0 1 1 controls data consistency checking and modeling assistance
+ 0 1 Data checking off
+ 1 1 Data checking on
+ 2 1 Data checking and model assistance on
+depind enumint 1008 -1 1 1 dependency checker on/off
+ -1 1 Automatic
+ 0 1 Turn off dependency checking
+ 1 1 Turn on only at the beginning of preprocessing
+ 2 1 Turn on only at the end of preprocessing
+ 3 1 Turn on at the beginning and at the end of preprocessing
+dettilim double 1127 1.0e+75 0.0 1.0e+75 1 1 deterministic time limit
+disjcuts enumint 2053 0 1 7 disjunctive cuts generation
+ -1 1 Do not generate disjunctive cuts
+ 0 1 Determined automatically
+ 1 1 Generate disjunctive cuts moderately
+ 2 1 Generate disjunctive cuts aggressively
+ 3 1 Generate disjunctive cuts very aggressively
+divetype enumint 2060 0 1 7 MIP dive strategy
+ 0 1 Automatic
+ 1 1 Traditional dive
+ 2 1 Probing dive
+ 3 1 Guided dive
+dpriind enumint 1009 0 1 2 dual simplex pricing
+ 0 1 Determined automatically
+ 1 1 Standard dual pricing
+ 2 1 Steepest-edge pricing
+ 3 1 Steepest-edge pricing in slack space
+ 4 1 Steepest-edge pricing, unit initial norms
+ 5 1 Devex pricing
+dynamicrows enumint 1161 -1 1 2 switch for dynamic management of rows
+ -1 1 Automatic
+ 0 1 Keep all rows
+ 1 1 Manage rows
+eachcutlim integer 2102 2100000000 0 2100000000 1 7 sets a limit for each type of cut
+epagap double 2008 1.0e-06 0.0 1.0e+20 1 10 absolute stopping tolerance
+epgap double 2009 1.0e-04 0.0 1.0 1 10 relative stopping tolerance
+epint double 2010 1.0e-05 0.0 0.5 1 10 integrality tolerance
+eplin double 2068 0.001 0.0 1.0e+75 1 10 degree of tolerance used in linearization
+epmrk double 1013 0.01 1.0e-04 1.0 1 4 Markowitz pivot tolerance
+epopt double 1014 1.0e-06 1.0e-09 0.1 1 4 optimality tolerance
+epper double 1015 1.0e-06 1.0e-08 1.0e+75 1 2 perturbation constant
+eprelax double 2073 1.0e-06 0.0 1.0e+20 0 1 relaxation for feasOpt
+eprhs double 1016 1.0e-06 1.0e-09 0.1 1 4 feasibility tolerance
+feasoptmode enumint 1084 0 1 1 mode of FeasOpt
+ 0 1 Minimize sum of relaxations
+ 1 1 Minimize sum of relaxations and optimize
+ 2 1 Minimize number of relaxations
+ 3 1 Minimize number of relaxations and optimize
+ 4 1 Minimize sum of squares of relaxations
+ 5 1 Minimize sum of squares of relaxations and optimize
+flowcovers enumint 2040 0 1 7 flow cover cut generation
+ -1 1 Do not generate flow cover cuts
+ 0 1 Determined automatically
+ 1 1 Generate flow cover cuts moderately
+ 2 1 Generate flow cover cuts aggressively
+flowpaths enumint 2051 0 1 7 flow path cut generation
+ -1 1 Do not generate flow path cuts
+ 0 1 Determined automatically
+ 1 1 Generate flow path cuts moderately
+ 2 1 Generate flow path cuts aggressively
+folding enumint 1164 -1 1 1 LP folding will be attempted during the preprocessing phase
+ -1 1 Automatic
+ 0 1 Turn off folder
+ 1 1 Moderate level of folding
+ 2 1 Aggressive level of folding
+ 3 1 Very aggressive level of folding
+ 4 1 Highly aggressive level of folding
+ 5 1 Extremely aggressive level of folding
+fpheur enumint 2098 0 1 7 feasibility pump heuristic
+ -1 1 Turns Feasible Pump heuristic off
+ 0 1 Automatic
+ 1 1 Apply the feasibility pump heuristic with an emphasis on finding a feasible solution
+ 2 1 Apply the feasibility pump heuristic with an emphasis on finding a feasible solution with a good objective value
+fraccand integer 2048 200 1 2100000000 1 8 candidate limit for generating Gomory fractional cuts
+fraccuts enumint 2049 0 1 7 Gomory fractional cut generation
+ -1 1 Do not generate Gomory fractional cuts
+ 0 1 Determined automatically
+ 1 1 Generate Gomory fractional cuts moderately
+ 2 1 Generate Gomory fractional cuts aggressively
+fracpass integer 2050 0 0 2147483647 1 8 maximum number of passes for generating Gomory fractional cuts
+ 0 0 Automatically determined
+ >0 Maximum passes to perform
+gubcovers enumint 2044 0 1 7 GUB cover cut generation
+ -1 1 Do not generate GUB cover cuts
+ 0 1 Determined automatically
+ 1 1 Generate GUB cover cuts moderately
+ 2 1 Generate GUB cover cuts aggressively
+heurfreq integer 2031 0 -1 2147483647 1 7 heuristic frequency
+ -1 Do not use the node heuristic
+ 0 Determined automatically
+ >0 Call heuristic at the requested node interval
+heuristiceffort double 2120 1.0 0.0 1.0e+75 1 7 the effort that CPLEX spends on heuristics during a MIP solve
+implbd enumint 2041 0 1 7 implied bound cut generation
+ -1 1 Do not generate implied bound cuts
+ 0 1 Determined automatically
+ 1 1 Generate implied bound cuts moderately
+ 2 1 Generate implied bound cuts aggressively
+intsollim integer 2015 2147483647 1 2147483647 1 8 maximum number of integer solutions
+itlim integer 1020 2147483647 0 2147483647 1 3 iteration limit
+lbheur boolean 2063 0 1 7 local branching heuristic
+ 0 Off
+ 1 Apply local branching heuristic to new incumbent
+liftprojcuts enumint 2152 0 1 7 lift-and-project cuts
+ -1 1 Do not generate lift-and-project cuts
+ 0 1 Determined automatically
+ 1 1 Generate lift-and-project cuts moderately
+ 2 1 Generate lift-and-project cuts aggressively
+ 3 1 Generate lift-and-project cuts very aggressively
+localimplied enumint 2181 0 1 7 generation of locally valid implied bound cuts
+ -1 1 Do not generate  locally valid implied bound cuts
+ 0 1 Determined automatically
+ 1 1 Generate locally valid implied bound cuts moderately
+ 2 1 Generate locally valid implied bound cuts aggressively
+ 3 1 Generate locally valid implied bound cuts very aggressively
+lpmethod enumint 1062 0 1 1 algorithm to be used for LP problems
+ 0 1 Automatic
+ 1 1 Primal Simplex
+ 2 1 Dual Simplex
+ 3 1 Network Simplex
+ 4 1 Barrier
+ 5 1 Sifting
+ 6 1 Concurrent
+mcfcuts enumint 2134 0 1 7 multi-commodity flow cut generation
+ -1 1 Do not generate MCF cuts
+ 0 1 Determined automatically
+ 1 1 Generate MCF cuts moderately
+ 2 1 Generate MCF cuts aggressively
+memoryemphasis boolean 1082 0 1 1 reduces use of memory
+ 0 Do not conserve memory
+ 1 Conserve memory where possible
+mipdisplay enumint 2012 4 1 11 progress display level
+ 0 1 No display
+ 1 1 Display integer feasible solutions
+ 2 1 Displays nodes under mipinterval control
+ 3 1 Same as 2 but adds information on cuts
+ 4 1 Same as 3 but adds LP display for the root node
+ 5 1 Same as 3 but adds LP display for all nodes
+mipemphasis enumint 2058 0 1 7 MIP solution tactics
+ 0 1 Balance optimality and feasibility
+ 1 1 Emphasize feasibility over optimality
+ 2 1 Emphasize optimality over feasibility
+ 3 1 Emphasize moving the best bound
+ 4 1 Emphasize hidden feasible solutions
+ 5 1 Find high quality feasible solutions as early as possible
+mipinterval integer 2013 0 -2147483648 2147483647 1 11 progress display interval
+mipkappastats enumint 2137 0 1 7 MIP kappa computation
+ -1 1 No MIP kappa statistics; default
+ 0 1 Automatic: let CPLEX decide
+ 1 1 Compute MIP kappa for a sample of subproblems
+ 2 1 Compute MIP kappa for all subproblems
+mipordind boolean 2020 1 1 7 priority list on/off
+ 0 Do not use priorities for branching
+ 1 Priority orders are utilized
+mipordtype enumint 2032 0 1 7 priority order generation
+ 0 1 None
+ 1 1 decreasing cost magnitude
+ 2 1 increasing bound range
+ 3 1 increasing cost per coefficient count
+mipsearch enumint 2109 0 1 7 search strategy for mixed integer programs
+ 0 1 Automatic
+ 1 1 Apply traditional branch and cut strategy
+ 2 1 Apply dynamic search
+miqcpstrat enumint 2110 0 1 7 MIQCP relaxation choice
+ 0 1 Automatic
+ 1 1 QCP relaxation
+ 2 1 LP relaxation
+mircuts enumint 2052 0 1 7 mixed integer rounding cut generation
+ -1 1 Do not generate MIR cuts
+ 0 1 Determined automatically
+ 1 1 Generate MIR cuts moderately
+ 2 1 Generate MIR cuts aggressively
+mpslongnum boolean 1081 1 1 11 MPS file format precision of numeric output
+ 0 Use limited MPS precision
+ 1 Use full-precision
+multobjdisplay enumint 1600 1 1 1 level of display during multiobjective optimization
+ 0 1 No display
+ 1 1 Summary display after each subproblem
+ 2 1 Summary display after each subproblem, as well as subproblem logs
+netdisplay enumint 5005 2 1 11 network display level
+ 0 1 No network log.
+ 1 1 Displays true objective values
+ 2 1 Displays penalized objective values
+netepopt double 5002 1.0e-06 1.0e-11 0.1 1 4 optimality tolerance for the network simplex method
+neteprhs double 5003 1.0e-06 1.0e-11 0.1 1 4 feasibility tolerance for the network simplex method
+netfind enumint 1022 2 1 2 attempt network extraction
+ 1 1 Extract pure network only
+ 2 1 Try reflection scaling
+ 3 1 Try general scaling
+netitlim integer 5001 2147483647 0 2147483647 1 3 iteration limit for network simplex
+netppriind enumint 5004 0 1 2 network simplex pricing
+ 0 1 Automatic
+ 1 1 Partial pricing
+ 2 1 Multiple partial pricing
+ 3 1 Multiple partial pricing with sorting
+nodecuts integer 2157 0 -1 3 1 7 decide whether or not cutting planes are separated at the nodes of the branch-and-bound tree
+nodefileind enumint 2016 1 1 7 node storage file indicator
+ 0 1 No node files
+ 1 1 Node files in memory and compressed
+ 2 1 Node files on disk
+ 3 1 Node files on disk and compressed
+nodelim integer 2017 2147483647 0 2147483647 1 8 maximum number of nodes to solve
+nodesel enumint 2018 1 1 7 node selection strategy
+ 0 1 Depth-first search
+ 1 1 Best-bound search
+ 2 1 Best-estimate search
+ 3 1 Alternate best-estimate search
+numericalemphasis boolean 1083 0 1 1 emphasizes precision in numerically unstable or difficult problems
+ 0 Off
+ 1 Exercise extreme caution in computation
+objdif double 2019 0.0 mindouble maxdouble 1 10 overrides GAMS Cheat parameter
+objllim double 1025 -1.0e+75 mindouble maxdouble 1 3 objective function lower limit
+objulim double 1026 1.0e+75 mindouble maxdouble 1 3 objective function upper limit
+optimalitytarget enumint 1131 0 1 1 type of optimality that Cplex targets
+ 0 1 Automatic
+ 1 1 Search for a globally optimal solution to a convex model
+ 2 1 Search for a solution that satisfies first-order optimality conditions no optimality guarantee
+ 3 1 Search for a globally optimal solution regardless of convexity
+parallelmode enumint 1109 1 1 1 parallel optimization mode
+ -1 1 Enable opportunistic parallel search mode
+ 0 1 Automatic
+ 1 1 Enable deterministic parallel search mode
+paramdisplay boolean 1163 1 0 1 display the nondefault parameters before optimization
+perind boolean 1027 0 1 2 force initial perturbation
+ 0 not automatically perturbed
+ 1 automatically perturbed
+perlim integer 1028 0 0 2100000000 1 2 number of stalled iterations before perturbation
+polishafterdettime double 2151 1.0e+75 0.0 1.0e+75 1 8 deterministic time before starting to polish a feasible solution
+polishafterepagap double 2126 0.0 0.0 1.0e+20 1 8 absolute MIP gap before starting to polish a feasible solution
+polishafterepgap double 2127 0.0 0.0 1.0 1 8 relative MIP gap before starting to polish a solution
+polishafterintsol integer 2129 2147483647 1 2147483647 1 8 MIP integer solutions to find before starting to polish a feasible solution
+polishafternode integer 2128 2147483647 0 2147483647 1 8 nodes to process before starting to polish a feasible solution
+polishaftertime double 2130 1.0e+75 0.0 1.0e+75 1 8 time before starting to polish a feasible solution
+populatelim integer 2108 20 1 2100000000 1 9 limit of solutions generated for the solution pool by populate method
+ppriind enumint 1029 0 1 2 primal simplex pricing
+ -1 1 Reduced-cost pricing
+ 0 1 Hybrid reduced-cost and Devex pricing
+ 1 1 Devex pricing
+ 2 1 Steepest edge pricing
+ 3 1 Steepest edge pricing with slack initial norms
+ 4 1 Full pricing
+predual enumint 1044 0 1 1 give dual problem to the optimizer
+ -1 1 do not give dual to optimizer
+ 0 1 automatic
+ 1 1 give dual to optimizer
+preind boolean 1030 1 1 1 turn presolver on/off
+prelinear boolean 1058 1 0 1 linear reduction indicator
+prepass integer 1052 -1 -1 2100000000 1 1 number of presolve applications to perform
+ -1 Determined automatically
+ 0 No presolve
+ >0 Number of MIP presolve applications to perform
+prereform integer 1167 3 0 3 1 1 set presolve reformulations
+preslvnd enumint 2037 0 1 7 node presolve selector
+ -1 1 No node presolve
+ 0 1 Automatic
+ 1 1 Force node presolve
+ 2 1 Perform probing on integer-infeasible variables
+ 3 1 Perform aggressive node probing
+pricelim integer 1010 0 0 2100000000 1 2 pricing candidate list
+probe enumint 2042 0 1 7 perform probing before solving a MIP
+ -1 1 No probing
+ 0 1 Automatic
+ 1 1 Limited probing
+ 2 1 More probing
+ 3 1 Full probing
+probedettime double 2150 1.0e+75 0.0 1.0e+75 1 8 deterministic time spent probing
+probetime double 2065 1.0e+75 0.0 1.0e+75 1 8 time spent probing
+qpmakepsdind boolean 4010 1 1 7 adjust MIQP formulation to make the quadratic matrix positive-semi-definite
+ 0 Off
+ 1 On
+qpmethod enumint 1063 0 1 1 algorithm to be used for QP problems
+ 0 1 Automatic
+ 1 1 Primal Simplex
+ 2 1 Dual Simplex
+ 3 1 Network Simplex
+ 4 1 Barrier
+ 5 1 Sifting
+ 6 1 Concurrent dual, barrier, and primal
+qtolin enumint 4012 -1 1 1 linearization of the quadratic terms in the objective function of a QP or MIQP model
+ -1 1 Automatic
+ 0 1 Off, Cplex does not linearize quadratic terms in the objective
+ 1 1 On, Cplex linearizes quadratic terms in the objective
+randomseed integer 1124 202009243 0 2100000000 1 1 sets the random seed differently for diversity of solutions
+record boolean 1162 0 0 1 Records invocations of Callable Library routines
+reduce enumint 1057 3 1 1 primal and dual reduction type
+ 0 1 No primal or dual reductions
+ 1 1 Only primal reductions
+ 2 1 Only dual reductions
+ 3 1 Both primal and dual reductions
+reinv integer 1031 0 0 10000 1 2 refactorization frequency
+relaxpreind enumint 2034 -1 1 1 presolve for initial relaxation on/off
+ -1 1 Automatic
+ 0 1 do not presolve initial relaxation
+ 1 1 use presolve on initial relaxation
+relobjdif double 2022 0.0 0.0 1.0 1 10 relative cheat parameter
+repairtries integer 2067 0 -1 2147483647 1 8 try to repair infeasible MIP start
+ -1 None: do not try to repair
+ 0 Automatic
+ >0 Maximum tries to perform
+repeatpresolve enumint 2064 -1 1 7 reapply presolve at root after preprocessing
+ -1 1 Automatic
+ 0 1 Turn off represolve
+ 1 1 Represolve without cuts
+ 2 1 Represolve with cuts
+ 3 1 Represolve with cuts and allow new root cuts
+rinsheur integer 2061 0 -1 2147483647 1 7 relaxation induced neighborhood search frequency
+ -1 Disable RINS
+ 0 Automatic
+ >0 Call RINS at the requested node interval
+rltcuts enumint 2196 0 1 7 Reformulation Linearization Technique (RLT) cuts
+ -1 1 Do not generate RLT cuts
+ 0 1 Determined automatically
+ 1 1 Generate RLT cuts moderately
+ 2 1 Generate RLT cuts aggressively
+ 3 1 Generate RLT cuts very aggressively
+scaind enumint 1034 0 1 1 matrix scaling on/off
+ -1 1 No scaling
+ 0 1 Standard scaling
+ 1 1 Modified, more aggressive scaling method
+siftalg enumint 1077 0 1 6 sifting subproblem algorithm
+ 0 1 Automatic
+ 1 1 Primal simplex
+ 2 1 Dual simplex
+ 3 1 Network simplex
+ 4 1 Barrier
+siftdisplay enumint 1076 1 1 11 sifting display level
+ 0 1 No display
+ 1 1 Display major iterations
+ 2 1 Display LP subproblem information
+sifting boolean 1158 1 1 2 switch for sifting from simplex optimization
+siftitlim integer 1078 2147483647 0 2147483647 1 6 limit on sifting iterations
+simdisplay enumint 1019 1 1 11 simplex display level
+ 0 1 No iteration messages are issued until the optimal solution is reported
+ 1 1 An iteration log message will be issued after each refactorization
+ 2 1 An iteration log message will be issued after each iteration
+singlim integer 1037 10 0 2100000000 1 3 limit on singularity repairs
+solnpoolagap double 2106 1.0e+75 0.0 1.0e+75 1 9 absolute tolerance for the solutions in the solution pool
+solnpoolcapacity integer 2103 2100000000 0 2100000000 1 9 limits of solutions kept in the solution pool
+solnpoolgap double 2105 1.0e+75 0.0 1.0e+75 1 9 relative tolerance for the solutions in the solution pool
+solnpoolintensity enumint 2107 0 1 9 solution pool intensity for ability to produce multiple solutions
+ 0 1 Automatic
+ 1 1 Mild: generate few solutions quickly
+ 2 1 Moderate: generate a larger number of solutions
+ 3 1 Aggressive: generate many solutions and expect performance penalty
+ 4 1 Very aggressive: enumerate all practical solutions
+solnpoolreplace enumint 2104 0 1 9 strategy for replacing a solution in the solution pool
+ 0 1 Replace the first solution (oldest) by the most recent solution; first in, first out
+ 1 1 Replace the solution which has the worst objective
+ 2 1 Replace solutions in order to build a set of diverse solutions
+solutiontype enumint 1147 0 1 1 type of solution (basic or non basic) for an LP or QP
+ 0 1 Automatic
+ 1 1 Basic solution
+ 2 1 primal-dual pair
+sos1reform integer 2230 0 -1 1 1 7 automatic logarithmic reformulation of special ordered sets of type 1 (SOS1)
+sos2reform integer 2231 0 -1 1 1 7 automatic logarithmic reformulation of special ordered sets of type 2 (SOS2)
+startalg enumint 2025 0 1 7 MIP starting algorithm
+ 0 1 Automatic
+ 1 1 Primal simplex
+ 2 1 Dual simplex
+ 3 1 Network simplex
+ 4 1 Barrier
+ 5 1 Sifting
+ 6 1 Concurrent
+strongcandlim integer 2045 10 1 2100000000 1 7 size of the candidates list for strong branching
+strongitlim integer 2046 0 0 2147483647 1 7 limit on iterations per branch for strong branching
+subalg enumint 2026 0 1 7 algorithm for subproblems
+ 0 1 Automatic
+ 1 1 Primal simplex
+ 2 1 Dual simplex
+ 3 1 Network optimizer followed by dual simplex
+ 4 1 Barrier with crossover
+ 5 1 Sifting
+submipnodelim integer 2212 500 1 2147483647 1 7 limit on number of nodes in an RINS subMIP
+submipscale enumint 2207 0 1 7 scale the problem matrix when CPLEX solves a subMIP during MIP optimization
+ -1 1 No scaling
+ 0 1 Standard scaling
+ 1 1 Modified, more aggressive scaling method
+submipstartalg enumint 2205 0 1 7 starting algorithm for a subMIP of a MIP
+ 0 1 Automatic
+ 1 1 Primal simplex
+ 2 1 Dual simplex
+ 3 1 Network simplex
+ 4 1 Barrier
+ 5 1 Sifting
+submipsubalg enumint 2206 0 1 7 algorithm for subproblems of a subMIP of a MIP
+ 0 1 Automatic
+ 1 1 Primal simplex
+ 2 1 Dual simplex
+ 3 1 Network optimizer followed by dual simplex
+ 4 1 Barrier with crossover
+ 5 1 Sifting
+symmetry enumint 2059 -1 1 7 symmetry breaking cuts
+ -1 1 Automatic
+ 0 1 Turn off symmetry breaking
+ 1 1 Moderate level of symmetry breaking
+ 2 1 Aggressive level of symmetry breaking
+ 3 1 Very aggressive level of symmetry breaking
+ 4 1 Highly aggressive level of symmetry breaking
+ 5 1 Extremely aggressive level of symmetry breaking
+threads integer 1067 0 minint maxint 1 1 global default thread count
+tilim double 1039 1.0e+75 0.0 1.0e+75 1 1 overrides the GAMS ResLim option
+trelim double 2027 1.0e+75 0.0 1.0e+75 1 8 maximum space in memory for tree
+tuningdettilim double 1139 1.0e+75 0.0 1.0e+75 1 1 tuning deterministic time limit per model or suite
+tuningdisplay enumint 1113 1 1 1 level of information reported by the tuning tool
+ 0 1 Turn off display
+ 1 1 Display standard minimal reporting
+ 2 1 Display standard report plus parameter settings being tried
+ 3 1 Display exhaustive report and log
+tuningmeasure enumint 1110 1 1 1 measure for evaluating progress for a suite of models
+ 1 1 mean average
+ 2 1 minmax
+tuningrepeat integer 1111 1 1 2100000000 1 1 number of times tuning is to be repeated on perturbed versions
+tuningtilim double 1112 1.0e+75 0.0 1.0e+75 1 1 tuning time limit per model or suite
+varsel enumint 2028 0 1 7 variable selection strategy at each node
+ -1 1 Branch on variable with minimum infeasibility
+ 0 1 Branch variable automatically selected
+ 1 1 Branch on variable with maximum infeasibility
+ 2 1 Branch based on pseudo costs
+ 3 1 Strong Branching
+ 4 1 Branch based on pseudo reduced costs
+warninglimit integer 1157 10 0 2147483647 1 1 determines how many times warnings of a specific type (datacheck=2) will be displayed
+workdir string 1064 "." 1 1 directory for working files
+workeralgorithm enumint 1500 0 1 7 set method for optimizing benders subproblems
+ 0 1 Automatic
+ 1 1 Primal Simplex
+ 2 1 Dual Simplex
+ 3 1 Network Simplex
+ 4 1 Barrier
+ 5 1 Sifting
+workmem double 1065 2048.0 0.0 1.0e+75 1 1 memory available for working storage
+zerohalfcuts enumint 2111 0 1 7 zero-half cuts
+ -1 1 Off
+ 0 1 Automatic
+ 1 1 Generate zero-half cuts moderately
+ 2 1 Generate zero-half cuts aggressively
+*
+* synonym section
+*
+writepremps synonym writepre
+advbasis synonym advind
+setadvind synonym advind
+aggregate synonym aggind
+setaggind synonym aggind
+branch synonym brdir
+backtracking synonym bttol
+clonelogs synonym clonelog
+crash synonym craind
+setcraind synonym craind
+setcutlo synonym cutlo
+setcutup synonym cutup
+dgradient synonym dpriind
+mipgap synonym epgap
+setepgap synonym epgap
+integraltol synonym epint
+markowitz synonym epmrk
+setepmrk synonym epmrk
+opttol synonym epopt
+setepopt synonym epopt
+perturbpar synonym epper
+setepper synonym epper
+feasibtol synonym eprhs
+seteprhs synonym eprhs
+intsolutionlim synonym intsollim
+setmslim synonym intsollim
+iterationlim synonym itlim
+setitlim synonym itlim
+setmifo synonym mipdisplay
+mipdisplayint synonym mipinterval
+setmint synonym mipinterval
+priorities synonym mipordind
+setordind synonym mipordind
+ndfilind synonym nodefileind
+ndlim synonym nodelim
+setndlim synonym nodelim
+ndsel synonym nodesel
+nodeselect synonym nodesel
+objectivedif synonym objdif
+setobjdif synonym objdif
+objectivelo synonym objllim
+setobjllim synonym objllim
+objectivehi synonym objulim
+setobjulim synonym objulim
+solutiontarget synonym optimalitytarget
+doperturb synonym perind
+setperind synonym perind
+pgradient synonym ppriind
+pricing synonym ppriind
+setpriind synonym ppriind
+setppriind synonym ppriind
+presolve synonym preind
+pricelist synonym pricelim
+setedlimu synonym pricelim
+refactor synonym reinv
+setreinv synonym reinv
+rtlcuts synonym rltcuts
+scale synonym scaind
+setscaind synonym scaind
+lpdisplaylev synonym simdisplay
+setitfoind synonym simdisplay
+setsinglim synonym singlim
+singularity synonym singlim
+subprobalg synonym subalg
+settilim synonym tilim
+timelimit synonym tilim
+treememory synonym trelim
+setvarsel synonym varsel
+variableselect synonym varsel
+optca synonym epagap
+optcr synonym epgap
+iterlim synonym itlim
+prioropt synonym mipordind
+nodlim synonym nodelim
+cheat synonym objdif
+gthreads synonym threads
+reslim synonym tilim
+*
+* indicator section
+*
+indic  indicator
+myeolchar EOLCOMM !
+*
+* deprecated section
+*
+cplex11 deprecated
+ writepremps Use option writepre to specify file name. File extension determines problem format
+cplex20_1 deprecated
+ prelinear Use option prereform
+synon deprecated
+ advbasis
+ setadvind
+ aggregate
+ setaggind
+ branch
+ backtracking
+ clonelogs
+ crash
+ setcraind
+ setcutlo
+ setcutup
+ dgradient
+ mipgap
+ setepgap
+ integraltol
+ markowitz
+ setepmrk
+ opttol
+ setepopt
+ perturbpar
+ setepper
+ feasibtol
+ seteprhs
+ intsolutionlim
+ setmslim
+ iterationlim
+ setitlim
+ setmifo
+ mipdisplayint
+ setmint
+ priorities
+ setordind
+ ndfilind
+ ndlim
+ setndlim
+ ndsel
+ nodeselect
+ objectivedif
+ setobjdif
+ objectivelo
+ setobjllim
+ objectivehi
+ setobjulim
+ solutiontarget
+ doperturb
+ setperind
+ pgradient
+ pricing
+ setpriind
+ setppriind
+ presolve
+ pricelist
+ setedlimu
+ refactor
+ setreinv
+ rtlcuts
+ scale
+ setscaind
+ lpdisplaylev
+ setitfoind
+ setsinglim
+ singularity
+ subprobalg
+ settilim
+ timelimit
+ treememory
+ setvarsel
+ variableselect
+*
+* Groups
+* <group-ident> group <group-number <help-context> <help-text>
+*
+general group 1 1 Preprocessing and General Options
+simplexalg group 2 1 Simplex Algorithmic Options
+simplexlim group 3 1 Simplex Limit Options
+simplextol group 4 1 Simplex Tolerance Options
+barrier group 5 1 Barrier Specific Options
+siftopt group 6 1 Sifting Specific Options
+mipalg group 7 1 MIP Algorithmic Options
+miplim group 8 1 MIP Limit Options
+solpool group 9 1 MIP Solution Pool Options
+miptol group 10 1 MIP Tolerance Options
+output group 11 1 Output Options
+bch group 12 1 BCH Facility Options
+*** End of file