Parameters with prefix constraints/linear. More...
Namespaces | |
namespace | UPGRADE |
Parameters with prefix constraints/linear/upgrade. | |
Variables | |
constexpr Param< bool > | AGGREGATEVARIABLES { "constraints/linear/aggregatevariables" } |
should presolving search for aggregations in equations | |
constexpr Param< bool > | CHECKRELMAXABS { "constraints/linear/checkrelmaxabs" } |
should the violation for a constraint with side 0.0 be checked relative to 1.0 (FALSE) or to the maximum absolute value in the activity (TRUE)? | |
constexpr Param< bool > | DELAYPROP { "constraints/linear/delayprop" } |
should propagation method be delayed, if other propagators found reductions? | |
constexpr Param< bool > | DELAYSEPA { "constraints/linear/delaysepa" } |
should separation method be delayed, if other separators found cuts? | |
constexpr Param< bool > | DETECTCUTOFFBOUND { "constraints/linear/detectcutoffbound" } |
should presolving try to detect constraints parallel to the objective function defining an upper bound and prevent these constraints from entering the LP? | |
constexpr Param< bool > | DETECTLOWERBOUND { "constraints/linear/detectlowerbound" } |
should presolving try to detect constraints parallel to the objective function defining a lower bound and prevent these constraints from entering the LP? | |
constexpr Param< bool > | DETECTPARTIALOBJECTIVE { "constraints/linear/detectpartialobjective" } |
should presolving try to detect subsets of constraints parallel to the objective function? | |
constexpr Param< bool > | DUALPRESOLVING { "constraints/linear/dualpresolving" } |
should dual presolving steps be performed? | |
constexpr Param< int > | EAGERFREQ { "constraints/linear/eagerfreq" } |
frequency for using all instead of only the useful constraints in separation, propagation and enforcement (-1: never, 0: only in first evaluation) | |
constexpr Param< bool > | EXTRACTCLIQUES { "constraints/linear/extractcliques" } |
should Cliques be extracted? | |
constexpr Param< double > | MAXAGGRNORMSCALE { "constraints/linear/maxaggrnormscale" } |
maximal allowed relative gain in maximum norm for constraint aggregation (0.0: disable constraint aggregation) | |
constexpr Param< double > | MAXCARDBOUNDDIST { "constraints/linear/maxcardbounddist" } |
maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for separating knapsack cardinality cuts | |
constexpr Param< double > | MAXDUALMULTAGGRQUOT { "constraints/linear/maxdualmultaggrquot" } |
maximum coefficient dynamism (ie. maxabsval / minabsval) for dual multiaggregation | |
constexpr Param< double > | MAXEASYACTIVITYDELTA { "constraints/linear/maxeasyactivitydelta" } |
maximum activity delta to run easy propagation on linear constraint (faster, but numerically less stable) | |
constexpr Param< double > | MAXMULTAGGRQUOT { "constraints/linear/maxmultaggrquot" } |
maximum coefficient dynamism (ie. maxabsval / minabsval) for primal multiaggregation | |
constexpr Param< int > | MAXPREROUNDS { "constraints/linear/maxprerounds" } |
maximal number of presolving rounds the constraint handler participates in (-1: no limit) | |
constexpr Param< int > | MAXROUNDS { "constraints/linear/maxrounds" } |
maximal number of separation rounds per node (-1: unlimited) | |
constexpr Param< int > | MAXROUNDSROOT { "constraints/linear/maxroundsroot" } |
maximal number of separation rounds per node in the root node (-1: unlimited) | |
constexpr Param< int > | MAXSEPACUTS { "constraints/linear/maxsepacuts" } |
maximal number of cuts separated per separation round | |
constexpr Param< int > | MAXSEPACUTSROOT { "constraints/linear/maxsepacutsroot" } |
maximal number of cuts separated per separation round in the root node | |
constexpr Param< double > | MINGAINPERNMINCOMPARISONS { "constraints/linear/mingainpernmincomparisons" } |
minimal gain per minimal pairwise presolve comparisons to repeat pairwise comparison round | |
constexpr Param< bool > | MULTAGGRREMOVE { "constraints/linear/multaggrremove" } |
should multi-aggregations only be performed if the constraint can be removed afterwards? | |
constexpr Param< int > | NMINCOMPARISONS { "constraints/linear/nmincomparisons" } |
number for minimal pairwise presolve comparisons | |
constexpr Param< bool > | PRESOLPAIRWISE { "constraints/linear/presolpairwise" } |
should pairwise constraint comparison be performed in presolving? | |
constexpr Param< int > | PRESOLTIMING { "constraints/linear/presoltiming" } |
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL) | |
constexpr Param< bool > | PRESOLUSEHASHING { "constraints/linear/presolusehashing" } |
should hash table be used for detecting redundant constraints in advance | |
constexpr Param< int > | PROPFREQ { "constraints/linear/propfreq" } |
frequency for propagating domains (-1: never, 0: only in root node) | |
constexpr Param< int > | PROPTIMING { "constraints/linear/proptiming" } |
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS) | |
constexpr Param< bool > | RANGEDROWARTCONS { "constraints/linear/rangedrowartcons" } |
should presolving and propagation extract sub-constraints from ranged rows and equations? | |
constexpr Param< int > | RANGEDROWFREQ { "constraints/linear/rangedrowfreq" } |
frequency for applying ranged row propagation | |
constexpr Param< int > | RANGEDROWMAXDEPTH { "constraints/linear/rangedrowmaxdepth" } |
maximum depth to apply ranged row propagation | |
constexpr Param< bool > | RANGEDROWPROPAGATION { "constraints/linear/rangedrowpropagation" } |
should presolving and propagation try to improve bounds, detect infeasibility, and extract sub-constraints from ranged rows and equations? | |
constexpr Param< int > | SEPAFREQ { "constraints/linear/sepafreq" } |
frequency for separating cuts (-1: never, 0: only in root node) | |
constexpr Param< bool > | SEPARATEALL { "constraints/linear/separateall" } |
should all constraints be subject to cardinality cut generation instead of only the ones with non-zero dual value? | |
constexpr Param< bool > | SIMPLIFYINEQUALITIES { "constraints/linear/simplifyinequalities" } |
should presolving try to simplify inequalities | |
constexpr Param< bool > | SINGLETONSTUFFING { "constraints/linear/singletonstuffing" } |
should stuffing of singleton continuous variables be performed? | |
constexpr Param< bool > | SINGLEVARSTUFFING { "constraints/linear/singlevarstuffing" } |
should single variable stuffing be performed, which tries to fulfill constraints using the cheapest variable? | |
constexpr Param< bool > | SORTVARS { "constraints/linear/sortvars" } |
apply binaries sorting in decr. order of coeff abs value? | |
constexpr Param< int > | TIGHTENBOUNDSFREQ { "constraints/linear/tightenboundsfreq" } |
multiplier on propagation frequency, how often the bounds are tightened (-1: never, 0: only at root) | |
Parameters with prefix constraints/linear.
|
constexpr |
should presolving search for aggregations in equations
Definition at line 1298 of file parameters.hpp.
|
constexpr |
should the violation for a constraint with side 0.0 be checked relative to 1.0 (FALSE) or to the maximum absolute value in the activity (TRUE)?
Definition at line 1311 of file parameters.hpp.
|
constexpr |
should propagation method be delayed, if other propagators found reductions?
Definition at line 1266 of file parameters.hpp.
|
constexpr |
should separation method be delayed, if other separators found cuts?
Definition at line 1264 of file parameters.hpp.
|
constexpr |
should presolving try to detect constraints parallel to the objective function defining an upper bound and prevent these constraints from entering the LP?
Definition at line 1314 of file parameters.hpp.
|
constexpr |
should presolving try to detect constraints parallel to the objective function defining a lower bound and prevent these constraints from entering the LP?
Definition at line 1317 of file parameters.hpp.
|
constexpr |
should presolving try to detect subsets of constraints parallel to the objective function?
Definition at line 1319 of file parameters.hpp.
|
constexpr |
should dual presolving steps be performed?
Definition at line 1302 of file parameters.hpp.
|
constexpr |
frequency for using all instead of only the useful constraints in separation, propagation and enforcement (-1: never, 0: only in first evaluation)
Definition at line 1260 of file parameters.hpp.
|
constexpr |
should Cliques be extracted?
Definition at line 1336 of file parameters.hpp.
|
constexpr |
maximal allowed relative gain in maximum norm for constraint aggregation (0.0: disable constraint aggregation)
Definition at line 1288 of file parameters.hpp.
|
constexpr |
maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for separating knapsack cardinality cuts
Definition at line 1293 of file parameters.hpp.
|
constexpr |
maximum coefficient dynamism (ie. maxabsval / minabsval) for dual multiaggregation
Definition at line 1334 of file parameters.hpp.
|
constexpr |
maximum activity delta to run easy propagation on linear constraint (faster, but numerically less stable)
Definition at line 1290 of file parameters.hpp.
|
constexpr |
maximum coefficient dynamism (ie. maxabsval / minabsval) for primal multiaggregation
Definition at line 1332 of file parameters.hpp.
|
constexpr |
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
Definition at line 1262 of file parameters.hpp.
|
constexpr |
maximal number of separation rounds per node (-1: unlimited)
Definition at line 1272 of file parameters.hpp.
|
constexpr |
maximal number of separation rounds per node in the root node (-1: unlimited)
Definition at line 1274 of file parameters.hpp.
|
constexpr |
maximal number of cuts separated per separation round
Definition at line 1276 of file parameters.hpp.
|
constexpr |
maximal number of cuts separated per separation round in the root node
Definition at line 1278 of file parameters.hpp.
|
constexpr |
minimal gain per minimal pairwise presolve comparisons to repeat pairwise comparison round
Definition at line 1286 of file parameters.hpp.
|
constexpr |
should multi-aggregations only be performed if the constraint can be removed afterwards?
Definition at line 1330 of file parameters.hpp.
|
constexpr |
number for minimal pairwise presolve comparisons
Definition at line 1284 of file parameters.hpp.
|
constexpr |
should pairwise constraint comparison be performed in presolving?
Definition at line 1280 of file parameters.hpp.
|
constexpr |
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
Definition at line 1268 of file parameters.hpp.
|
constexpr |
should hash table be used for detecting redundant constraints in advance
Definition at line 1282 of file parameters.hpp.
|
constexpr |
frequency for propagating domains (-1: never, 0: only in root node)
Definition at line 1255 of file parameters.hpp.
|
constexpr |
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS)
Definition at line 1257 of file parameters.hpp.
|
constexpr |
should presolving and propagation extract sub-constraints from ranged rows and equations?
Definition at line 1324 of file parameters.hpp.
|
constexpr |
frequency for applying ranged row propagation
Definition at line 1328 of file parameters.hpp.
|
constexpr |
maximum depth to apply ranged row propagation
Definition at line 1326 of file parameters.hpp.
|
constexpr |
should presolving and propagation try to improve bounds, detect infeasibility, and extract sub-constraints from ranged rows and equations?
Definition at line 1322 of file parameters.hpp.
|
constexpr |
frequency for separating cuts (-1: never, 0: only in root node)
Definition at line 1253 of file parameters.hpp.
|
constexpr |
should all constraints be subject to cardinality cut generation instead of only the ones with non-zero dual value?
Definition at line 1296 of file parameters.hpp.
|
constexpr |
should presolving try to simplify inequalities
Definition at line 1300 of file parameters.hpp.
|
constexpr |
should stuffing of singleton continuous variables be performed?
Definition at line 1304 of file parameters.hpp.
|
constexpr |
should single variable stuffing be performed, which tries to fulfill constraints using the cheapest variable?
Definition at line 1306 of file parameters.hpp.
|
constexpr |
apply binaries sorting in decr. order of coeff abs value?
Definition at line 1308 of file parameters.hpp.
|
constexpr |
multiplier on propagation frequency, how often the bounds are tightened (-1: never, 0: only at root)
Definition at line 1270 of file parameters.hpp.