All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
set.h
Go to the documentation of this file.
22 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
60 /** copies plugins from sourcescip to targetscip; in case that a constraint handler which does not need constraints
61 * cannot be copied, valid will return FALSE. All plugins can declare that, if their copy process failed, the
116 /** creates a SCIP_Bool parameter, sets it to its default value, and adds it to the parameter set */
148 /** creates a SCIP_Longint parameter, sets it to its default value, and adds it to the parameter set */
165 /** creates a SCIP_Real parameter, sets it to its default value, and adds it to the parameter set */
193 const char* allowedvalues, /**< array with possible parameter values, or NULL if not restricted */
198 /** creates a string parameter, sets it to its default value, and adds it to the parameter set */
430 SCIP_Bool onlychanged /**< should only the parameters been written, that are changed from default? */
465 /** sets parameters to deactivate separators and heuristics that use auxiliary SCIP instances; should be called for
576 /** reinserts a constraint handler with modified sepa priority into the sepa priority sorted array */
1011 * This is useful, if the value, e.g., the activity of a linear constraint or the pseudo objective value, gets a high
1012 * absolute value during the optimization process which is later reduced significantly. In this case, the last digits
1014 * We dot not consider the cancellations which can occur during increasing the absolute value because they just cannot
1016 * The idea to get more reliable values is to always store the last reliable value, where increasing the absolute of
1017 * the value is viewed as preserving reliability. Then, after each update, the new absolute value can be compared
1018 * against the last reliable one with this method, checking whether it was decreased by a factor of at least
1034 /** returns the minimum value that is regarded as huge and should be handled separately (e.g., in activity
1060 /** returns primal feasibility tolerance of LP solver given as minimum of lpfeastol option and tolerance specified by separation storage */
1066 /** returns primal feasibility tolerance as specified by separation storage, or SCIP_INVALID */
1156 /** checks, if value is huge and should be handled separately (e.g., in activity computation) */
1426 /** checks, if the given new lower bound is tighter (w.r.t. bound strengthening epsilon) than the old one */
1435 /** checks, if the given new upper bound is tighter (w.r.t. bound strengthening epsilon) than the old one */
1535 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
1544 #define SCIPsetLpfeastol(set) ( (set)->sepa_primfeastol == SCIP_INVALID ? (set)->num_lpfeastol : MIN((set)->num_lpfeastol, (set)->sepa_primfeastol) )
1586 #define SCIPsetIsFeasLE(set, val1, val2) ( !EPSP(SCIPrelDiff(val1, val2), (set)->num_feastol) )
1588 #define SCIPsetIsFeasGE(set, val1, val2) ( !EPSN(SCIPrelDiff(val1, val2), (set)->num_feastol) )
1604 ( root ? EPSP(efficacy, (set)->sepa_minefficacyroot) : EPSP(efficacy, (set)->sepa_minefficacy) )
1612 #define SCIPsetIsSumRelEQ(set, val1, val2) ( EPSZ(SCIPrelDiff(val1, val2), (set)->num_sumepsilon) )
1613 #define SCIPsetIsSumRelLT(set, val1, val2) ( EPSN(SCIPrelDiff(val1, val2), (set)->num_sumepsilon) )
1614 #define SCIPsetIsSumRelLE(set, val1, val2) ( !EPSP(SCIPrelDiff(val1, val2), (set)->num_sumepsilon) )
1615 #define SCIPsetIsSumRelGT(set, val1, val2) ( EPSP(SCIPrelDiff(val1, val2), (set)->num_sumepsilon) )
1616 #define SCIPsetIsSumRelGE(set, val1, val2) ( !EPSN(SCIPrelDiff(val1, val2), (set)->num_sumepsilon) )
1623 #define SCIPsetAllocBufferArray(set,ptr,num) ( SCIPbufferAllocMem((set)->buffer, set, (void**)(ptr), \
1628 #define SCIPsetReallocBufferArray(set,ptr,num) ( SCIPbufferReallocMem((set)->buffer, set, (void**)(ptr), \
1632 #define SCIPsetAllocBufferArray(set,ptr,num) ( SCIPbufferAllocMemSave(set, (void**)(ptr), num, sizeof(**(ptr))) )
1633 #define SCIPsetDuplicateBufferArray(set,ptr,source,num) ( SCIPbufferDuplicateMemSave(set, (void**)(ptr), source, num, sizeof(**(ptr))) )
1634 #define SCIPsetReallocBufferArray(set,ptr,num) ( SCIPbufferReallocMemSave(set, (void**)(ptr), num, sizeof(**(ptr))) )
1637 #define SCIPsetAllocBuffer(set,ptr) ( SCIPbufferAllocMem((set)->buffer, set, (void**)(ptr), (int) sizeof(**(ptr))) )
1638 #define SCIPsetAllocBufferSize(set,ptr,size) ( SCIPbufferAllocMem((set)->buffer, set, (void**)(ptr), size) )
1641 #define SCIPsetReallocBufferSize(set,ptr,size) ( SCIPbufferReallocMem((set)->buffer, set, (void**)(ptr), size) )
|