SCIP
Solving Constraint Integer Programs
cons_linear.c File Reference
Detailed Description
Constraint handler for linear constraints in their most general form, \(lhs <= a^T x <= rhs\).
Linear constraints are separated with a high priority, because they are easy to separate. Instead of using the global cut pool, the same effect can be implemented by adding linear constraints to the root node, such that they are separated each time, the linear constraints are separated. A constraint handler, which generates linear constraints in this way should have a lower separation priority than the linear constraint handler, and it should have a separation frequency that is a multiple of the frequency of the linear constraint handler. In this way, it can be avoided to separate the same cut twice, because if a separation run of the handler is always preceded by a separation of the linear constraints, the priorily added constraints are always satisfied.
Linear constraints are enforced and checked with a very low priority. Checking of (many) linear constraints is much more involved than checking the solution values for integrality. Because we are separating the linear constraints quite often, it is only necessary to enforce them for integral solutions. A constraint handler which generates pool cuts in its enforcing method should have an enforcing priority smaller than that of the linear constraint handler to avoid regenerating constraints which already exist.
Definition in file cons_linear.c.
#include "blockmemshell/memory.h"#include "scip/cons_knapsack.h"#include "scip/cons_linear.h"#include "scip/cons_nonlinear.h"#include "scip/cons_quadratic.h"#include "scip/debug.h"#include "scip/pub_conflict.h"#include "scip/pub_cons.h"#include "scip/pub_event.h"#include "scip/pub_lp.h"#include "scip/pub_message.h"#include "scip/pub_misc.h"#include "scip/pub_misc_sort.h"#include "scip/pub_var.h"#include "scip/scip_branch.h"#include "scip/scip_conflict.h"#include "scip/scip_cons.h"#include "scip/scip_copy.h"#include "scip/scip_cut.h"#include "scip/scip_event.h"#include "scip/scip_general.h"#include "scip/scip_lp.h"#include "scip/scip_mem.h"#include "scip/scip_message.h"#include "scip/scip_numerics.h"#include "scip/scip_param.h"#include "scip/scip_prob.h"#include "scip/scip_probing.h"#include "scip/scip_sol.h"#include "scip/scip_solvingstats.h"#include "scip/scip_tree.h"#include "scip/scip_var.h"#include <ctype.h>#include <string.h>#include <strings.h>Go to the source code of this file.
Data Structures | |
| struct | SCIP_LinConsUpgrade |
Typedefs | |
| typedef enum Proprule | PROPRULE |
| typedef struct InferInfo | INFERINFO |
Enumerations | |
| enum | Proprule { PROPRULE_1, PROPRULE_2, PROPRULE_3, PROPRULE_4, PROPRULE_INVALID, PROPRULE_INVALID = 0, PROPRULE_1 = 1, PROPRULE_2 = 2, PROPRULE_3 = 3, PROPRULE_4 = 4, PROPRULE_0_INVALID = 0, PROPRULE_1_CORETIMES = 1, PROPRULE_2_EDGEFINDING = 2, PROPRULE_3_TTEF = 3, PROPRULE_1_RHS = 1, PROPRULE_1_LHS = 2, PROPRULE_1_RANGEDROW = 3, PROPRULE_INVALID = 0, PROPRULE_1 = 0, PROPRULE_2 = 1, PROPRULE_3 = 2, PROPRULE_4 = 3, PROPRULE_INVALID = 4, PROPRULE_1, PROPRULE_2, PROPRULE_3, PROPRULE_4, PROPRULE_0, PROPRULE_1, PROPRULE_INTLB, PROPRULE_INTUB, PROPRULE_INVALID } |
Functions | |
| static INFERINFO | intToInferInfo (int i) |
| static int | inferInfoToInt (INFERINFO inferinfo) |
| static int | inferInfoGetProprule (INFERINFO inferinfo) |
| static int | inferInfoGetPos (INFERINFO inferinfo) |
| static INFERINFO | getInferInfo (PROPRULE proprule, int pos) |
| static int | getInferInt (PROPRULE proprule, int pos) |
| static SCIP_RETCODE | conshdlrdataEnsureLinconsupgradesSize (SCIP *scip, SCIP_CONSHDLRDATA *conshdlrdata, int num) |
| static SCIP_RETCODE | consdataEnsureVarsSize (SCIP *scip, SCIP_CONSDATA *consdata, int num) |
| static SCIP_RETCODE | linconsupgradeCreate (SCIP *scip, SCIP_LINCONSUPGRADE **linconsupgrade, SCIP_DECL_LINCONSUPGD((*linconsupgd)), int priority) |
| static void | linconsupgradeFree (SCIP *scip, SCIP_LINCONSUPGRADE **linconsupgrade) |
| static SCIP_RETCODE | conshdlrdataCreate (SCIP *scip, SCIP_CONSHDLRDATA **conshdlrdata, SCIP_EVENTHDLR *eventhdlr) |
| static void | conshdlrdataFree (SCIP *scip, SCIP_CONSHDLRDATA **conshdlrdata) |
| static SCIP_Bool | conshdlrdataHasUpgrade (SCIP *scip, SCIP_CONSHDLRDATA *conshdlrdata, SCIP_DECL_LINCONSUPGD((*linconsupgd)), const char *conshdlrname) |
| static SCIP_RETCODE | conshdlrdataIncludeUpgrade (SCIP *scip, SCIP_CONSHDLRDATA *conshdlrdata, SCIP_LINCONSUPGRADE *linconsupgrade) |
| static SCIP_RETCODE | lockRounding (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var, SCIP_Real val) |
| static SCIP_RETCODE | unlockRounding (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var, SCIP_Real val) |
| static SCIP_RETCODE | consCatchEvent (SCIP *scip, SCIP_CONS *cons, SCIP_EVENTHDLR *eventhdlr, int pos) |
| static SCIP_RETCODE | consDropEvent (SCIP *scip, SCIP_CONS *cons, SCIP_EVENTHDLR *eventhdlr, int pos) |
| static SCIP_RETCODE | consCatchAllEvents (SCIP *scip, SCIP_CONS *cons, SCIP_EVENTHDLR *eventhdlr) |
| static SCIP_RETCODE | consDropAllEvents (SCIP *scip, SCIP_CONS *cons, SCIP_EVENTHDLR *eventhdlr) |
| static SCIP_RETCODE | consdataCreate (SCIP *scip, SCIP_CONSDATA **consdata, int nvars, SCIP_VAR **vars, SCIP_Real *vals, SCIP_Real lhs, SCIP_Real rhs) |
| static SCIP_RETCODE | consdataFree (SCIP *scip, SCIP_CONSDATA **consdata) |
| static SCIP_RETCODE | consdataPrint (SCIP *scip, SCIP_CONSDATA *consdata, FILE *file) |
| static SCIP_RETCODE | consPrintConsSol (SCIP *scip, SCIP_CONS *cons, SCIP_SOL *sol, FILE *file) |
| static void | consdataInvalidateActivities (SCIP_CONSDATA *consdata) |
| static SCIP_Real | consdataComputePseudoActivity (SCIP *scip, SCIP_CONSDATA *consdata) |
| static void | consdataRecomputeMinactivity (SCIP *scip, SCIP_CONSDATA *consdata) |
| static void | consdataRecomputeMaxactivity (SCIP *scip, SCIP_CONSDATA *consdata) |
| static void | consdataRecomputeGlbMinactivity (SCIP *scip, SCIP_CONSDATA *consdata) |
| static void | consdataRecomputeGlbMaxactivity (SCIP *scip, SCIP_CONSDATA *consdata) |
| static void | consdataCalcMaxAbsval (SCIP_CONSDATA *consdata) |
| static void | consdataCalcMinAbsval (SCIP_CONSDATA *consdata) |
| static void | consdataCheckNonbinvar (SCIP_CONSDATA *consdata) |
| static void | consdataRecomputeMaxActivityDelta (SCIP *scip, SCIP_CONSDATA *consdata) |
| static void | consdataUpdateActivities (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real oldbound, SCIP_Real newbound, SCIP_Real val, SCIP_BOUNDTYPE boundtype, SCIP_Bool global, SCIP_Bool checkreliability) |
| static void | consdataUpdateActivitiesLb (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real oldlb, SCIP_Real newlb, SCIP_Real val, SCIP_Bool checkreliability) |
| static void | consdataUpdateActivitiesUb (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real oldub, SCIP_Real newub, SCIP_Real val, SCIP_Bool checkreliability) |
| static void | consdataUpdateActivitiesGlbLb (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_Real oldlb, SCIP_Real newlb, SCIP_Real val, SCIP_Bool checkreliability) |
| static void | consdataUpdateActivitiesGlbUb (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_Real oldub, SCIP_Real newub, SCIP_Real val, SCIP_Bool checkreliability) |
| static void | consdataUpdateAddCoef (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real val, SCIP_Bool checkreliability) |
| static void | consdataUpdateDelCoef (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real val, SCIP_Bool checkreliability) |
| static void | consdataUpdateChgCoef (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real oldval, SCIP_Real newval, SCIP_Bool checkreliability) |
| static SCIP_Real | consdataGetMaxAbsval (SCIP_CONSDATA *consdata) |
| static SCIP_Real | consdataGetMinAbsval (SCIP_CONSDATA *consdata) |
| static void | consdataCalcActivities (SCIP *scip, SCIP_CONSDATA *consdata) |
| static void | getMinActivity (SCIP *scip, SCIP_CONSDATA *consdata, int posinf, int neginf, int poshuge, int neghuge, SCIP_Real delta, SCIP_Bool global, SCIP_Bool goodrelax, SCIP_Real *minactivity, SCIP_Bool *isrelax, SCIP_Bool *issettoinfinity) |
| static void | getMaxActivity (SCIP *scip, SCIP_CONSDATA *consdata, int posinf, int neginf, int poshuge, int neghuge, SCIP_Real delta, SCIP_Bool global, SCIP_Bool goodrelax, SCIP_Real *maxactivity, SCIP_Bool *isrelax, SCIP_Bool *issettoinfinity) |
| static void | consdataGetActivityBounds (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_Bool goodrelax, SCIP_Real *minactivity, SCIP_Real *maxactivity, SCIP_Bool *minisrelax, SCIP_Bool *maxisrelax, SCIP_Bool *isminsettoinfinity, SCIP_Bool *ismaxsettoinfinity) |
| static void | consdataGetReliableResidualActivity (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *cancelvar, SCIP_Real *resactivity, SCIP_Bool isminresact, SCIP_Bool useglobalbounds) |
| static void | consdataGetActivityResiduals (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real val, SCIP_Bool goodrelax, SCIP_Real *minresactivity, SCIP_Real *maxresactivity, SCIP_Bool *minisrelax, SCIP_Bool *maxisrelax, SCIP_Bool *isminsettoinfinity, SCIP_Bool *ismaxsettoinfinity) |
| static void | consdataGetGlbActivityBounds (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_Bool goodrelax, SCIP_Real *glbminactivity, SCIP_Real *glbmaxactivity, SCIP_Bool *minisrelax, SCIP_Bool *maxisrelax, SCIP_Bool *isminsettoinfinity, SCIP_Bool *ismaxsettoinfinity) |
| static void | consdataGetGlbActivityResiduals (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *var, SCIP_Real val, SCIP_Bool goodrelax, SCIP_Real *minresactivity, SCIP_Real *maxresactivity, SCIP_Bool *minisrelax, SCIP_Bool *maxisrelax, SCIP_Bool *isminsettoinfinity, SCIP_Bool *ismaxsettoinfinity) |
| static SCIP_Real | consdataGetActivity (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_SOL *sol) |
| static SCIP_Real | consdataGetFeasibility (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_SOL *sol) |
| static void | consdataUpdateSignatures (SCIP_CONSDATA *consdata, int pos) |
| static void | consdataCalcSignatures (SCIP_CONSDATA *consdata) |
| static | SCIP_DECL_SORTINDCOMP (consdataCompVar) |
| static | SCIP_DECL_SORTINDCOMP (consdataCompVarProp) |
| static void | permSortConsdata (SCIP_CONSDATA *consdata, int *perm, int nvars) |
| static SCIP_RETCODE | consdataSort (SCIP *scip, SCIP_CONSDATA *consdata) |
| static SCIP_RETCODE | chgLhs (SCIP *scip, SCIP_CONS *cons, SCIP_Real lhs) |
| static SCIP_RETCODE | chgRhs (SCIP *scip, SCIP_CONS *cons, SCIP_Real rhs) |
| static SCIP_RETCODE | addCoef (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var, SCIP_Real val) |
| static SCIP_RETCODE | delCoefPos (SCIP *scip, SCIP_CONS *cons, int pos) |
| static SCIP_RETCODE | chgCoefPos (SCIP *scip, SCIP_CONS *cons, int pos, SCIP_Real newval) |
| static SCIP_RETCODE | scaleCons (SCIP *scip, SCIP_CONS *cons, SCIP_Real scalar) |
| static SCIP_RETCODE | performVarDeletions (SCIP *scip, SCIP_CONSHDLR *conshdlr, SCIP_CONS **conss, int nconss) |
| static SCIP_RETCODE | normalizeCons (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *infeasible) |
| static SCIP_RETCODE | mergeMultiples (SCIP *scip, SCIP_CONS *cons) |
| static SCIP_RETCODE | applyFixings (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *infeasible) |
| static SCIP_RETCODE | addConflictBounds (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *infervar, SCIP_BDCHGIDX *bdchgidx, int inferpos, SCIP_Bool reasonisrhs) |
| static SCIP_RETCODE | addConflictFixedVars (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *infervar, SCIP_BDCHGIDX *bdchgidx, int inferpos) |
| static SCIP_RETCODE | addConflictReasonVars (SCIP *scip, SCIP_VAR **vars, int nvars, SCIP_VAR *var, SCIP_Real bound) |
| static SCIP_RETCODE | resolvePropagation (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *infervar, INFERINFO inferinfo, SCIP_BOUNDTYPE boundtype, SCIP_BDCHGIDX *bdchgidx, SCIP_RESULT *result) |
| static SCIP_RETCODE | analyzeConflict (SCIP *scip, SCIP_CONS *cons, SCIP_Bool reasonisrhs) |
| static SCIP_Bool | canTightenBounds (SCIP_CONS *cons) |
| static SCIP_RETCODE | tightenVarUb (SCIP *scip, SCIP_CONS *cons, int pos, PROPRULE proprule, SCIP_Real newub, SCIP_Real oldub, SCIP_Bool *cutoff, int *nchgbds, SCIP_Bool force) |
| static SCIP_RETCODE | tightenVarLb (SCIP *scip, SCIP_CONS *cons, int pos, PROPRULE proprule, SCIP_Real newlb, SCIP_Real oldlb, SCIP_Bool *cutoff, int *nchgbds, SCIP_Bool force) |
| static SCIP_RETCODE | tightenVarBoundsEasy (SCIP *scip, SCIP_CONS *cons, int pos, SCIP_Bool *cutoff, int *nchgbds, SCIP_Bool force) |
| static SCIP_RETCODE | analyzeConflictRangedRow (SCIP *scip, SCIP_CONS *cons, SCIP_VAR **vars, int nvars, SCIP_VAR *var, SCIP_Real bound) |
| static SCIP_RETCODE | rangedRowPropagation (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *cutoff, int *nfixedvars, int *nchgbds, int *naddconss) |
| static SCIP_RETCODE | tightenVarBounds (SCIP *scip, SCIP_CONS *cons, int pos, SCIP_Bool *cutoff, int *nchgbds, SCIP_Bool force) |
| static SCIP_RETCODE | tightenBounds (SCIP *scip, SCIP_CONS *cons, SCIP_Real maxeasyactivitydelta, SCIP_Bool sortvars, SCIP_Bool *cutoff, int *nchgbds) |
| static SCIP_RETCODE | checkCons (SCIP *scip, SCIP_CONS *cons, SCIP_SOL *sol, SCIP_Bool checklprows, SCIP_Bool checkrelmaxabs, SCIP_Bool *violated) |
| static SCIP_RETCODE | createRow (SCIP *scip, SCIP_CONS *cons) |
| static SCIP_RETCODE | addRelaxation (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *cutoff) |
| static SCIP_RETCODE | separateCons (SCIP *scip, SCIP_CONS *cons, SCIP_CONSHDLRDATA *conshdlrdata, SCIP_SOL *sol, SCIP_Bool separatecards, SCIP_Bool separateall, int *ncuts, SCIP_Bool *cutoff) |
| static SCIP_RETCODE | propagateCons (SCIP *scip, SCIP_CONS *cons, SCIP_Bool tightenbounds, SCIP_Bool rangedrowpropagation, SCIP_Real maxeasyactivitydelta, SCIP_Bool sortvars, SCIP_Bool *cutoff, int *nchgbds) |
| static SCIP_RETCODE | fixVariables (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *cutoff, int *nfixedvars) |
| static SCIP_RETCODE | extractCliques (SCIP *scip, SCIP_CONS *cons, SCIP_Real maxeasyactivitydelta, SCIP_Bool sortvars, int *nfixedvars, int *nchgbds, SCIP_Bool *cutoff) |
| static SCIP_RETCODE | tightenSides (SCIP *scip, SCIP_CONS *cons, int *nchgsides, SCIP_Bool *infeasible) |
| static SCIP_RETCODE | consdataTightenCoefs (SCIP *scip, SCIP_CONS *cons, int *nchgcoefs, int *nchgsides) |
| static SCIP_RETCODE | convertUnaryEquality (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *cutoff, int *nfixedvars, int *ndelconss) |
| static SCIP_RETCODE | convertBinaryEquality (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *cutoff, int *naggrvars, int *ndelconss) |
| static void | getNewSidesAfterAggregation (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_VAR *slackvar, SCIP_Real slackcoef, SCIP_Real *newlhs, SCIP_Real *newrhs) |
| static SCIP_RETCODE | convertLongEquality (SCIP *scip, SCIP_CONSHDLRDATA *conshdlrdata, SCIP_CONS *cons, SCIP_Bool *cutoff, int *naggrvars, int *ndelconss) |
| static SCIP_Bool | checkEqualObjective (SCIP *scip, SCIP_CONSDATA *consdata, SCIP_Real *scale, SCIP_Real *offset) |
| static SCIP_RETCODE | checkPartialObjective (SCIP *scip, SCIP_CONS *cons, SCIP_CONSHDLRDATA *conshdlrdata) |
| static SCIP_RETCODE | updateCutoffbound (SCIP *scip, SCIP_CONS *cons, SCIP_Real primalbound) |
| static SCIP_RETCODE | checkParallelObjective (SCIP *scip, SCIP_CONS *cons, SCIP_CONSHDLRDATA *conshdlrdata) |
| static SCIP_RETCODE | convertEquality (SCIP *scip, SCIP_CONS *cons, SCIP_CONSHDLRDATA *conshdlrdata, SCIP_Bool *cutoff, int *nfixedvars, int *naggrvars, int *ndelconss) |
| static SCIP_Bool | consdataIsResidualIntegral (SCIP *scip, SCIP_CONSDATA *consdata, int pos, SCIP_Real val) |
| static void | calculateMinvalAndMaxval (SCIP *scip, SCIP_Real side, SCIP_Real val, SCIP_Real minresactivity, SCIP_Real maxresactivity, SCIP_Real *minval, SCIP_Real *maxval) |
| static SCIP_RETCODE | dualPresolve (SCIP *scip, SCIP_CONSHDLRDATA *conshdlrdata, SCIP_CONS *cons, SCIP_Bool *cutoff, int *nfixedvars, int *naggrvars, int *ndelconss) |
| static int | getVarWeight (SCIP_VAR *var) |
| static SCIP_RETCODE | aggregateVariables (SCIP *scip, SCIP_CONS *cons, SCIP_Bool *cutoff, int *nfixedvars, int *naggrvars) |
| static | SCIP_DECL_SORTINDCOMP (consdataCompSim) |
| static SCIP_RETCODE | rangedRowSimplify (SCIP *scip, SCIP_CONS *cons, int *nchgcoefs, int *nchgsides) |
| static SCIP_RETCODE | simplifyInequalities (SCIP *scip, SCIP_CONS *cons, int *nchgcoefs, int *nchgsides, SCIP_Bool *infeasible) |
| static SCIP_RETCODE | aggregateConstraints (SCIP *scip, SCIP_CONS *cons0, SCIP_CONS *cons1, int *commonidx0, int *commonidx1, int *diffidx0minus1, int *diffidx1minus0, int nvarscommon, int commonidxweight, int diffidx0minus1weight, int diffidx1minus0weight, SCIP_Real maxaggrnormscale, int *nchgcoefs, SCIP_Bool *aggregated, SCIP_Bool *infeasible) |
| static | SCIP_DECL_HASHGETKEY (hashGetKeyLinearcons) |
| static | SCIP_DECL_HASHKEYEQ (hashKeyEqLinearcons) |
| static | SCIP_DECL_HASHKEYVAL (hashKeyValLinearcons) |
| static unsigned int | getParallelConsKey (SCIP_CONS *cons) |
| static SCIP_RETCODE | retrieveParallelConstraints (SCIP_HASHTABLE *hashtable, SCIP_CONS **querycons, SCIP_CONS **parallelconss, int *nparallelconss) |
| static SCIP_RETCODE | detectRedundantConstraints (SCIP *scip, BMS_BLKMEM *blkmem, SCIP_CONS **conss, int nconss, int *firstchange, SCIP_Bool *cutoff, int *ndelconss, int *nchgsides) |
| static SCIP_RETCODE | preprocessConstraintPairs (SCIP *scip, SCIP_CONS **conss, int firstchange, int chkind, SCIP_Real maxaggrnormscale, SCIP_Bool *cutoff, int *ndelconss, int *nchgsides, int *nchgcoefs) |
| static SCIP_RETCODE | presolStuffing (SCIP *scip, SCIP_CONS *cons, SCIP_Bool singletonstuffing, SCIP_Bool singlevarstuffing, SCIP_Bool *cutoff, int *nfixedvars, int *nchgbds) |
| static SCIP_RETCODE | fullDualPresolve (SCIP *scip, SCIP_CONS **conss, int nconss, SCIP_Bool *cutoff, int *nchgbds) |
| static SCIP_RETCODE | enforceConstraint (SCIP *scip, SCIP_CONSHDLR *conshdlr, SCIP_CONS **conss, int nconss, int nusefulconss, SCIP_SOL *sol, SCIP_RESULT *result) |
| static | SCIP_DECL_CONSHDLRCOPY (conshdlrCopyLinear) |
| static | SCIP_DECL_CONSFREE (consFreeLinear) |
| static | SCIP_DECL_CONSINIT (consInitLinear) |
| static | SCIP_DECL_CONSEXIT (consExitLinear) |
| static SCIP_Bool | isRangedRow (SCIP *scip, SCIP_Real lhs, SCIP_Real rhs) |
| static SCIP_Bool | isFiniteNonnegativeIntegral (SCIP *scip, SCIP_Real x) |
| SCIP_RETCODE | SCIPclassifyConstraintTypesLinear (SCIP *scip, SCIP_LINCONSSTATS *linconsstats) |
| static | SCIP_DECL_CONSEXITPRE (consExitpreLinear) |
| static | SCIP_DECL_CONSEXITSOL (consExitsolLinear) |
| static | SCIP_DECL_CONSDEACTIVE (consDeactiveLinear) |
| static | SCIP_DECL_CONSDELETE (consDeleteLinear) |
| static | SCIP_DECL_CONSTRANS (consTransLinear) |
| static | SCIP_DECL_CONSINITLP (consInitlpLinear) |
| static | SCIP_DECL_CONSSEPALP (consSepalpLinear) |
| static | SCIP_DECL_CONSSEPASOL (consSepasolLinear) |
| static | SCIP_DECL_CONSENFOLP (consEnfolpLinear) |
| static | SCIP_DECL_CONSENFORELAX (consEnforelaxLinear) |
| static | SCIP_DECL_CONSENFOPS (consEnfopsLinear) |
| static | SCIP_DECL_CONSCHECK (consCheckLinear) |
| static | SCIP_DECL_CONSPROP (consPropLinear) |
| static | SCIP_DECL_CONSPRESOL (consPresolLinear) |
| static | SCIP_DECL_CONSRESPROP (consRespropLinear) |
| static | SCIP_DECL_CONSLOCK (consLockLinear) |
| static | SCIP_DECL_CONSDELVARS (consDelvarsLinear) |
| static | SCIP_DECL_CONSPRINT (consPrintLinear) |
| static | SCIP_DECL_CONSCOPY (consCopyLinear) |
| static void | findOperators (const char *str, char **firstoperator, char **secondoperator, SCIP_Bool *success) |
| static | SCIP_DECL_CONSPARSE (consParseLinear) |
| static | SCIP_DECL_CONSGETVARS (consGetVarsLinear) |
| static | SCIP_DECL_CONSGETNVARS (consGetNVarsLinear) |
| static | SCIP_DECL_EVENTEXEC (eventExecLinear) |
| static | SCIP_DECL_CONFLICTEXEC (conflictExecLinear) |
| static | SCIP_DECL_QUADCONSUPGD (upgradeConsQuadratic) |
| static | SCIP_DECL_NONLINCONSUPGD (upgradeConsNonlinear) |
| SCIP_RETCODE | SCIPincludeConshdlrLinear (SCIP *scip) |
| SCIP_RETCODE | SCIPincludeLinconsUpgrade (SCIP *scip, SCIP_DECL_LINCONSUPGD((*linconsupgd)), int priority, const char *conshdlrname) |
| SCIP_RETCODE | SCIPcreateConsLinear (SCIP *scip, SCIP_CONS **cons, const char *name, int nvars, SCIP_VAR **vars, SCIP_Real *vals, SCIP_Real lhs, SCIP_Real rhs, SCIP_Bool initial, SCIP_Bool separate, SCIP_Bool enforce, SCIP_Bool check, SCIP_Bool propagate, SCIP_Bool local, SCIP_Bool modifiable, SCIP_Bool dynamic, SCIP_Bool removable, SCIP_Bool stickingatnode) |
| SCIP_RETCODE | SCIPcreateConsBasicLinear (SCIP *scip, SCIP_CONS **cons, const char *name, int nvars, SCIP_VAR **vars, SCIP_Real *vals, SCIP_Real lhs, SCIP_Real rhs) |
| SCIP_RETCODE | SCIPcopyConsLinear (SCIP *scip, SCIP_CONS **cons, SCIP *sourcescip, const char *name, int nvars, SCIP_VAR **sourcevars, SCIP_Real *sourcecoefs, SCIP_Real lhs, SCIP_Real rhs, SCIP_HASHMAP *varmap, SCIP_HASHMAP *consmap, SCIP_Bool initial, SCIP_Bool separate, SCIP_Bool enforce, SCIP_Bool check, SCIP_Bool propagate, SCIP_Bool local, SCIP_Bool modifiable, SCIP_Bool dynamic, SCIP_Bool removable, SCIP_Bool stickingatnode, SCIP_Bool global, SCIP_Bool *valid) |
| SCIP_RETCODE | SCIPaddCoefLinear (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var, SCIP_Real val) |
| SCIP_RETCODE | SCIPchgCoefLinear (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var, SCIP_Real val) |
| SCIP_RETCODE | SCIPdelCoefLinear (SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var) |
| SCIP_Real | SCIPgetLhsLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_Real | SCIPgetRhsLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_RETCODE | SCIPchgLhsLinear (SCIP *scip, SCIP_CONS *cons, SCIP_Real lhs) |
| SCIP_RETCODE | SCIPchgRhsLinear (SCIP *scip, SCIP_CONS *cons, SCIP_Real rhs) |
| int | SCIPgetNVarsLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_VAR ** | SCIPgetVarsLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_Real * | SCIPgetValsLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_Real | SCIPgetActivityLinear (SCIP *scip, SCIP_CONS *cons, SCIP_SOL *sol) |
| SCIP_Real | SCIPgetFeasibilityLinear (SCIP *scip, SCIP_CONS *cons, SCIP_SOL *sol) |
| SCIP_Real | SCIPgetDualsolLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_Real | SCIPgetDualfarkasLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_ROW * | SCIPgetRowLinear (SCIP *scip, SCIP_CONS *cons) |
| SCIP_RETCODE | SCIPupgradeConsLinear (SCIP *scip, SCIP_CONS *cons, SCIP_CONS **upgdcons) |
| SCIP_RETCODE | SCIPcleanupConssLinear (SCIP *scip, SCIP_Bool onlychecked, SCIP_Bool *infeasible) |
Macro Definition Documentation
◆ CONSHDLR_NAME
| #define CONSHDLR_NAME "linear" |
Definition at line 90 of file cons_linear.c.
Referenced by isFiniteNonnegativeIntegral(), SCIP_DECL_CONSCHECK(), SCIP_DECL_CONSEXITSOL(), SCIP_DECL_CONSHDLRCOPY(), SCIPaddCoefLinear(), SCIPchgLhsLinear(), SCIPchgRhsLinear(), SCIPcopyConsLinear(), SCIPcreateConsLinear(), and SCIPdelCoefLinear().
◆ CONSHDLR_DESC
Definition at line 91 of file cons_linear.c.
◆ CONSHDLR_SEPAPRIORITY
| #define CONSHDLR_SEPAPRIORITY +100000 |
priority of the constraint handler for separation
Definition at line 92 of file cons_linear.c.
◆ CONSHDLR_ENFOPRIORITY
| #define CONSHDLR_ENFOPRIORITY -1000000 |
priority of the constraint handler for constraint enforcing
Definition at line 93 of file cons_linear.c.
◆ CONSHDLR_CHECKPRIORITY
| #define CONSHDLR_CHECKPRIORITY -1000000 |
priority of the constraint handler for checking feasibility
Definition at line 94 of file cons_linear.c.
◆ CONSHDLR_SEPAFREQ
| #define CONSHDLR_SEPAFREQ 0 |
frequency for separating cuts; zero means to separate only in the root node
Definition at line 95 of file cons_linear.c.
◆ CONSHDLR_PROPFREQ
| #define CONSHDLR_PROPFREQ 1 |
frequency for propagating domains; zero means only preprocessing propagation
Definition at line 96 of file cons_linear.c.
◆ CONSHDLR_EAGERFREQ
| #define CONSHDLR_EAGERFREQ 100 |
frequency for using all instead of only the useful constraints in separation, propagation and enforcement, -1 for no eager evaluations, 0 for first only
Definition at line 97 of file cons_linear.c.
◆ CONSHDLR_MAXPREROUNDS
| #define CONSHDLR_MAXPREROUNDS -1 |
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
Definition at line 100 of file cons_linear.c.
◆ CONSHDLR_DELAYSEPA
| #define CONSHDLR_DELAYSEPA FALSE |
should separation method be delayed, if other separators found cuts?
Definition at line 101 of file cons_linear.c.
◆ CONSHDLR_DELAYPROP
| #define CONSHDLR_DELAYPROP FALSE |
should propagation method be delayed, if other propagators found reductions?
Definition at line 102 of file cons_linear.c.
◆ CONSHDLR_NEEDSCONS
| #define CONSHDLR_NEEDSCONS TRUE |
should the constraint handler be skipped, if no constraints are available?
Definition at line 103 of file cons_linear.c.
◆ CONSHDLR_PRESOLTIMING
| #define CONSHDLR_PRESOLTIMING (SCIP_PRESOLTIMING_FAST | SCIP_PRESOLTIMING_EXHAUSTIVE) |
presolving timing of the constraint handler (fast, medium, or exhaustive)
Definition at line 105 of file cons_linear.c.
◆ CONSHDLR_PROP_TIMING
| #define CONSHDLR_PROP_TIMING SCIP_PROPTIMING_BEFORELP |
Definition at line 106 of file cons_linear.c.
◆ EVENTHDLR_NAME
| #define EVENTHDLR_NAME "linear" |
Definition at line 108 of file cons_linear.c.
Referenced by SCIP_DECL_CONSGETNVARS(), and SCIP_DECL_NONLINCONSUPGD().
◆ EVENTHDLR_DESC
| #define EVENTHDLR_DESC "bound change event handler for linear constraints" |
Definition at line 109 of file cons_linear.c.
Referenced by SCIP_DECL_NONLINCONSUPGD().
◆ CONFLICTHDLR_NAME
| #define CONFLICTHDLR_NAME "linear" |
Definition at line 111 of file cons_linear.c.
Referenced by SCIP_DECL_NONLINCONSUPGD().
◆ CONFLICTHDLR_DESC
| #define CONFLICTHDLR_DESC "conflict handler creating linear constraints" |
Definition at line 112 of file cons_linear.c.
Referenced by SCIP_DECL_NONLINCONSUPGD().
◆ CONFLICTHDLR_PRIORITY
| #define CONFLICTHDLR_PRIORITY -1000000 |
Definition at line 113 of file cons_linear.c.
Referenced by SCIP_DECL_NONLINCONSUPGD().
◆ DEFAULT_TIGHTENBOUNDSFREQ
| #define DEFAULT_TIGHTENBOUNDSFREQ 1 |
multiplier on propagation frequency, how often the bounds are tightened
Definition at line 115 of file cons_linear.c.
◆ DEFAULT_MAXROUNDS
| #define DEFAULT_MAXROUNDS 5 |
maximal number of separation rounds per node (-1: unlimited)
Definition at line 116 of file cons_linear.c.
◆ DEFAULT_MAXROUNDSROOT
| #define DEFAULT_MAXROUNDSROOT -1 |
maximal number of separation rounds in the root node (-1: unlimited)
Definition at line 117 of file cons_linear.c.
◆ DEFAULT_MAXSEPACUTS
| #define DEFAULT_MAXSEPACUTS 50 |
maximal number of cuts separated per separation round
Definition at line 118 of file cons_linear.c.
◆ DEFAULT_MAXSEPACUTSROOT
| #define DEFAULT_MAXSEPACUTSROOT 200 |
maximal number of cuts separated per separation round in root node
Definition at line 119 of file cons_linear.c.
◆ DEFAULT_PRESOLPAIRWISE
| #define DEFAULT_PRESOLPAIRWISE TRUE |
should pairwise constraint comparison be performed in presolving?
Definition at line 120 of file cons_linear.c.
◆ DEFAULT_PRESOLUSEHASHING
| #define DEFAULT_PRESOLUSEHASHING TRUE |
should hash table be used for detecting redundant constraints in advance
Definition at line 121 of file cons_linear.c.
◆ DEFAULT_NMINCOMPARISONS
| #define DEFAULT_NMINCOMPARISONS 200000 |
number for minimal pairwise presolving comparisons
Definition at line 122 of file cons_linear.c.
◆ DEFAULT_MINGAINPERNMINCOMP
| #define DEFAULT_MINGAINPERNMINCOMP 1e-06 |
minimal gain per minimal pairwise presolving comparisons to repeat pairwise comparison round
Definition at line 123 of file cons_linear.c.
◆ DEFAULT_SORTVARS
| #define DEFAULT_SORTVARS TRUE |
should variables be sorted after presolve w.r.t their coefficient absolute for faster propagation?
Definition at line 126 of file cons_linear.c.
◆ DEFAULT_CHECKRELMAXABS
| #define DEFAULT_CHECKRELMAXABS FALSE |
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 129 of file cons_linear.c.
◆ DEFAULT_MAXAGGRNORMSCALE
| #define DEFAULT_MAXAGGRNORMSCALE 0.0 |
maximal allowed relative gain in maximum norm for constraint aggregation (0.0: disable constraint aggregation)
Definition at line 132 of file cons_linear.c.
◆ DEFAULT_MAXEASYACTIVITYDELTA
| #define DEFAULT_MAXEASYACTIVITYDELTA 1e6 |
maximum activity delta to run easy propagation on linear constraint (faster, but numerically less stable)
Definition at line 135 of file cons_linear.c.
◆ DEFAULT_MAXCARDBOUNDDIST
| #define DEFAULT_MAXCARDBOUNDDIST 0.0 |
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 138 of file cons_linear.c.
◆ DEFAULT_SEPARATEALL
| #define DEFAULT_SEPARATEALL FALSE |
should all constraints be subject to cardinality cut generation instead of only the ones with non-zero dual value?
Definition at line 141 of file cons_linear.c.
◆ DEFAULT_AGGREGATEVARIABLES
| #define DEFAULT_AGGREGATEVARIABLES TRUE |
should presolving search for redundant variables in equations
Definition at line 144 of file cons_linear.c.
◆ DEFAULT_SIMPLIFYINEQUALITIES
| #define DEFAULT_SIMPLIFYINEQUALITIES TRUE |
should presolving try to simplify inequalities
Definition at line 145 of file cons_linear.c.
◆ DEFAULT_DUALPRESOLVING
| #define DEFAULT_DUALPRESOLVING TRUE |
should dual presolving steps be performed?
Definition at line 146 of file cons_linear.c.
◆ DEFAULT_SINGLETONSTUFFING
| #define DEFAULT_SINGLETONSTUFFING TRUE |
should stuffing of singleton continuous variables be performed?
Definition at line 147 of file cons_linear.c.
◆ DEFAULT_SINGLEVARSTUFFING
| #define DEFAULT_SINGLEVARSTUFFING FALSE |
should single variable stuffing be performed, which tries to fulfill constraints using the cheapest variable?
Definition at line 148 of file cons_linear.c.
◆ DEFAULT_DETECTCUTOFFBOUND
| #define DEFAULT_DETECTCUTOFFBOUND TRUE |
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 151 of file cons_linear.c.
◆ DEFAULT_DETECTLOWERBOUND
| #define DEFAULT_DETECTLOWERBOUND TRUE |
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 156 of file cons_linear.c.
◆ DEFAULT_DETECTPARTIALOBJECTIVE
| #define DEFAULT_DETECTPARTIALOBJECTIVE TRUE |
should presolving try to detect subsets of constraints parallel to the objective function
Definition at line 161 of file cons_linear.c.
◆ DEFAULT_RANGEDROWPROPAGATION
| #define DEFAULT_RANGEDROWPROPAGATION TRUE |
should we perform ranged row propagation
Definition at line 164 of file cons_linear.c.
◆ DEFAULT_RANGEDROWARTCONS
| #define DEFAULT_RANGEDROWARTCONS TRUE |
should presolving and propagation extract sub-constraints from ranged rows and equations?
Definition at line 165 of file cons_linear.c.
◆ DEFAULT_RANGEDROWMAXDEPTH
| #define DEFAULT_RANGEDROWMAXDEPTH INT_MAX |
maximum depth to apply ranged row propagation
Definition at line 166 of file cons_linear.c.
◆ DEFAULT_RANGEDROWFREQ
| #define DEFAULT_RANGEDROWFREQ 1 |
frequency for applying ranged row propagation
Definition at line 167 of file cons_linear.c.
◆ DEFAULT_MULTAGGRREMOVE
| #define DEFAULT_MULTAGGRREMOVE FALSE |
should multi-aggregations only be performed if the constraint can be removed afterwards?
Definition at line 169 of file cons_linear.c.
◆ DEFAULT_MAXMULTAGGRQUOT
| #define DEFAULT_MAXMULTAGGRQUOT 1e+03 |
maximum coefficient dynamism (ie. maxabsval / minabsval) for multiaggregation
Definition at line 172 of file cons_linear.c.
◆ DEFAULT_MAXDUALMULTAGGRQUOT
| #define DEFAULT_MAXDUALMULTAGGRQUOT 1e+20 |
maximum coefficient dynamism (ie. maxabsval / minabsval) for multiaggregation
Definition at line 173 of file cons_linear.c.
◆ DEFAULT_EXTRACTCLIQUES
| #define DEFAULT_EXTRACTCLIQUES TRUE |
should cliques be extracted?
Definition at line 174 of file cons_linear.c.
◆ MAXDNOM
| #define MAXDNOM 10000LL |
maximal denominator for simple rational fixed values
Definition at line 176 of file cons_linear.c.
Referenced by buildFlowCover(), and SCIP_DECL_PRESOLEXEC().
◆ MAXSCALEDCOEF
| #define MAXSCALEDCOEF 0 |
maximal coefficient value after scaling
Definition at line 177 of file cons_linear.c.
◆ MAXSCALEDCOEFINTEGER
| #define MAXSCALEDCOEFINTEGER 0 |
maximal coefficient value after scaling if all variables are of integral type
Definition at line 178 of file cons_linear.c.
◆ MAXVALRECOMP
| #define MAXVALRECOMP 1e+06 |
maximal abolsute value we trust without recomputing the activity
Definition at line 184 of file cons_linear.c.
◆ MINVALRECOMP
| #define MINVALRECOMP 1e-05 |
minimal abolsute value we trust without recomputing the activity
Definition at line 185 of file cons_linear.c.
◆ QUADCONSUPGD_PRIORITY
| #define QUADCONSUPGD_PRIORITY 1000000 |
priority of the constraint handler for upgrading of quadratic constraints
Definition at line 188 of file cons_linear.c.
◆ NONLINCONSUPGD_PRIORITY
| #define NONLINCONSUPGD_PRIORITY 1000000 |
priority of the constraint handler for upgrading of nonlinear constraints
Definition at line 189 of file cons_linear.c.
◆ checkMaxActivityDelta
| #define checkMaxActivityDelta | ( | scip, | |
| consdata | |||
| ) |
Definition at line 1538 of file cons_linear.c.
Referenced by consdataCheckNonbinvar().
◆ MAXTIGHTENROUNDS
| #define MAXTIGHTENROUNDS 10 |
Definition at line 7073 of file cons_linear.c.
◆ MAX_CLIQUE_NONZEROS_PER_CONS
| #define MAX_CLIQUE_NONZEROS_PER_CONS 1000000 |
Definition at line 7908 of file cons_linear.c.
◆ BINWEIGHT
| #define BINWEIGHT 1 |
Definition at line 11106 of file cons_linear.c.
◆ INTWEIGHT
| #define INTWEIGHT 4 |
Definition at line 11107 of file cons_linear.c.
◆ CONTWEIGHT
| #define CONTWEIGHT 8 |
Definition at line 11108 of file cons_linear.c.
◆ MAXCONSPRESOLROUNDS
| #define MAXCONSPRESOLROUNDS 10 |
Definition at line 16173 of file cons_linear.c.
Typedef Documentation
◆ PROPRULE
Definition at line 363 of file cons_linear.c.
◆ INFERINFO
| typedef struct InferInfo INFERINFO |
Definition at line 378 of file cons_linear.c.
Enumeration Type Documentation
◆ Proprule
| enum Proprule |
Definition at line 353 of file cons_linear.c.
Function Documentation
◆ intToInferInfo()
|
static |
converts an integer into an inference information
- Parameters
-
i integer to convert
Definition at line 382 of file cons_linear.c.
◆ inferInfoToInt()
|
static |
converts an inference information into an int
- Parameters
-
inferinfo inference information to convert
Definition at line 395 of file cons_linear.c.
Referenced by getInferInfo().
◆ inferInfoGetProprule()
|
static |
returns the propagation rule stored in the inference information
- Parameters
-
inferinfo inference information to convert
Definition at line 404 of file cons_linear.c.
◆ inferInfoGetPos()
|
static |
returns the position stored in the inference information
- Parameters
-
inferinfo inference information to convert
Definition at line 413 of file cons_linear.c.
◆ getInferInfo()
constructs an inference information out of a propagation rule and a position number
- Parameters
-
proprule propagation rule that deduced the value pos variable position, the propagation rule was applied at
Definition at line 422 of file cons_linear.c.
References conshdlrdataEnsureLinconsupgradesSize(), and inferInfoToInt().
◆ getInferInt()
|
static |
constructs an inference information out of a propagation rule and a position number, returns info as int
- Parameters
-
proprule propagation rule that deduced the value pos variable position, the propagation rule was applied at
Definition at line 441 of file cons_linear.c.
References NULL, SCIP_CALL, SCIPcalcMemGrowSize(), and SCIPreallocBlockMemoryArray.
◆ conshdlrdataEnsureLinconsupgradesSize()
|
static |
ensures, that linconsupgrades array can store at least num entries
- Parameters
-
scip SCIP data structure conshdlrdata linear constraint handler data num minimum number of entries to store
Definition at line 456 of file cons_linear.c.
Referenced by conshdlrdataHasUpgrade(), and getInferInfo().
◆ consdataEnsureVarsSize()
|
static |
ensures, that vars and vals arrays can store at least num entries
- Parameters
-
scip SCIP data structure consdata linear constraint data num minimum number of entries to store
Definition at line 481 of file cons_linear.c.
References linconsupgradeCreate(), NULL, SCIP_CALL, SCIP_DECL_LINCONSUPGD, SCIP_OKAY, SCIPallocBlockMemory, SCIPreallocBlockMemoryArray, and TRUE.
◆ linconsupgradeCreate()
|
static |
creates a linear constraint upgrade data object
- Parameters
-
scip SCIP data structure linconsupgrade pointer to store the linear constraint upgrade priority priority of upgrading method
Definition at line 516 of file cons_linear.c.
References conshdlrdataCreate(), NULL, and SCIPfreeBlockMemory.
Referenced by consdataEnsureVarsSize().
◆ linconsupgradeFree()
|
static |
frees a linear constraint upgrade data object
- Parameters
-
scip SCIP data structure linconsupgrade pointer to the linear constraint upgrade
Definition at line 537 of file cons_linear.c.
References NULL, SCIP_CALL, and SCIPallocBlockMemory.
Referenced by conshdlrdataCreate().
◆ conshdlrdataCreate()
|
static |
creates constraint handler data for linear constraint handler
- Parameters
-
scip SCIP data structure conshdlrdata pointer to store the constraint handler data eventhdlr event handler
Definition at line 551 of file cons_linear.c.
References linconsupgradeFree(), NULL, and SCIPfreeBlockMemoryArrayNull.
Referenced by linconsupgradeCreate().
◆ conshdlrdataFree()
|
static |
frees constraint handler data for linear constraint handler
- Parameters
-
scip SCIP data structure conshdlrdata pointer to the constraint handler data
Definition at line 575 of file cons_linear.c.
Referenced by SCIP_DECL_CONSHDLRCOPY().
◆ conshdlrdataHasUpgrade()
|
static |
creates a linear constraint upgrade data object
- Parameters
-
scip SCIP data structure conshdlrdata constraint handler data conshdlrname name of the constraint handler
Definition at line 597 of file cons_linear.c.
References conshdlrdataEnsureLinconsupgradesSize(), conshdlrdataIncludeUpgrade(), FALSE, NULL, SCIP_LinConsUpgrade::priority, SCIP_CALL, SCIPwarningMessage(), and TRUE.
◆ conshdlrdataIncludeUpgrade()
|
static |
adds a linear constraint update method to the constraint handler's data
- Parameters
-
scip SCIP data structure conshdlrdata constraint handler data linconsupgrade linear constraint upgrade method
Definition at line 627 of file cons_linear.c.
Referenced by conshdlrdataHasUpgrade().
◆ lockRounding()
|
static |
installs rounding locks for the given variable associated to the given coefficient in the linear constraint
- Parameters
-
scip SCIP data structure cons linear constraint var variable of constraint entry val coefficient of constraint entry
Definition at line 659 of file cons_linear.c.
References NULL, SCIP_CALL, SCIP_OKAY, SCIP_Real, SCIPconsGetData(), SCIPisInfinity(), SCIPisZero(), SCIPlockVarCons(), and unlockRounding().
◆ unlockRounding()
|
static |
removes rounding locks for the given variable associated to the given coefficient in the linear constraint
- Parameters
-
scip SCIP data structure cons linear constraint var variable of constraint entry val coefficient of constraint entry
Definition at line 692 of file cons_linear.c.
References consCatchEvent(), NULL, SCIP_CALL, SCIP_OKAY, SCIPconsGetData(), SCIPisInfinity(), and SCIPunlockVarCons().
Referenced by lockRounding().
◆ consCatchEvent()
|
static |
creates event data for variable at given position, and catches events ! [SnippetDebugAssertions]
- Parameters
-
scip SCIP data structure cons linear constraint eventhdlr event handler to call for the event processing pos array position of variable to catch bound change events for
Definition at line 726 of file cons_linear.c.
Referenced by unlockRounding().
◆ consDropEvent()
|
static |
! [SnippetDebugAssertions] deletes event data for variable at given position, and drops events
- Parameters
-
scip SCIP data structure cons linear constraint eventhdlr event handler to call for the event processing pos array position of variable to catch bound change events for
Definition at line 765 of file cons_linear.c.
Referenced by consDropAllEvents().
◆ consCatchAllEvents()
|
static |
catches bound change events for all variables in transformed linear constraint
- Parameters
-
scip SCIP data structure cons linear constraint eventhdlr event handler to call for the event processing
Definition at line 799 of file cons_linear.c.
◆ consDropAllEvents()
|
static |
drops bound change events for all variables in transformed linear constraint
- Parameters
-
scip SCIP data structure cons linear constraint eventhdlr event handler to call for the event processing
Definition at line 831 of file cons_linear.c.
References consdataCreate(), consDropEvent(), NULL, SCIP_CALL, SCIP_OKAY, SCIP_Real, and SCIPfreeBlockMemoryArray.
◆ consdataCreate()
|
static |
creates a linear constraint data
- Parameters
-
scip SCIP data structure consdata pointer to linear constraint data nvars number of nonzeros in the constraint vars array with variables of constraint entries vals array with coefficients of constraint entries lhs left hand side of row rhs right hand side of row
Definition at line 862 of file cons_linear.c.
Referenced by consDropAllEvents(), and SCIPcreateConsLinear().
◆ consdataFree()
|
static |
frees a linear constraint data
- Parameters
-
scip SCIP data structure consdata pointer to linear constraint data
Definition at line 1061 of file cons_linear.c.
References consdataPrint(), NULL, SCIP_CALL, SCIP_OKAY, SCIPfreeBlockMemory, SCIPfreeBlockMemoryArrayNull, SCIPinfoMessage(), SCIPisEQ(), SCIPisInfinity(), SCIPisZero(), and SCIPreleaseVar().
◆ consdataPrint()
|
static |
prints linear constraint in CIP format to file stream
- Parameters
-
scip SCIP data structure consdata linear constraint data file output file (or NULL for standard output)
Definition at line 1096 of file cons_linear.c.
Referenced by consdataFree(), and SCIP_DECL_CONSDELVARS().
◆ consPrintConsSol()
|
static |
prints linear constraint and contained solution values of variables to file stream
- Parameters
-
scip SCIP data structure cons linear constraint sol solution to print file output file (or NULL for standard output)
Definition at line 1135 of file cons_linear.c.
Referenced by SCIP_DECL_CONSCHECK().
◆ consdataInvalidateActivities()
|
static |
invalidates activity bounds, such that they are recalculated in next get
- Parameters
-
consdata linear constraint
Definition at line 1207 of file cons_linear.c.
◆ consdataComputePseudoActivity()
|
static |
compute the pseudo activity of a constraint
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 1253 of file cons_linear.c.
References bound, consdataRecomputeMinactivity(), SCIP_BOUNDTYPE_LOWER, SCIP_INVALID, SCIP_Real, SCIPinfinity(), SCIPisHugeValue(), SCIPisInfinity(), SCIPvarGetBestBoundType(), SCIPvarGetLbLocal(), and SCIPvarGetUbLocal().
Referenced by consdataGetGlbActivityResiduals().
◆ consdataRecomputeMinactivity()
|
static |
recompute the minactivity of a constraint
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 1306 of file cons_linear.c.
References bound, SCIP_Real, SCIPisHugeValue(), SCIPisInfinity(), SCIPvarGetLbLocal(), and SCIPvarGetUbLocal().
Referenced by consdataComputePseudoActivity().
◆ consdataRecomputeMaxactivity()
|
static |
recompute the maxactivity of a constraint
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 1333 of file cons_linear.c.
References bound, SCIP_Real, SCIPisHugeValue(), SCIPisInfinity(), SCIPvarGetLbGlobal(), and SCIPvarGetUbGlobal().
◆ consdataRecomputeGlbMinactivity()
|
static |
recompute the global minactivity of a constraint
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 1360 of file cons_linear.c.
References bound, SCIP_Real, SCIPisHugeValue(), SCIPisInfinity(), SCIPvarGetLbGlobal(), and SCIPvarGetUbGlobal().
◆ consdataRecomputeGlbMaxactivity()
|
static |
recompute the global maxactivity of a constraint
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 1387 of file cons_linear.c.
References NULL, REALABS, SCIP_INVALID, SCIP_Real, and TRUE.
◆ consdataCalcMaxAbsval()
|
static |
calculates maximum absolute value of coefficients
- Parameters
-
consdata linear constraint data
Definition at line 1414 of file cons_linear.c.
References NULL, REALABS, SCIP_INVALID, SCIP_Real, and TRUE.
◆ consdataCalcMinAbsval()
|
static |
calculates minimum absolute value of coefficients
- Parameters
-
consdata linear constraint data
Definition at line 1438 of file cons_linear.c.
References consdataCheckNonbinvar(), FALSE, REALABS, SCIP_VARTYPE_BINARY, SCIPvarGetType(), and TRUE.
Referenced by consdataGetMaxAbsval().
◆ consdataCheckNonbinvar()
|
static |
checks the type of all variables of the constraint and sets hasnonbinvar and hascontvar flags accordingly
- Parameters
-
consdata linear constraint data
Definition at line 1467 of file cons_linear.c.
References checkMaxActivityDelta, consdataRecomputeMaxActivityDelta(), REALABS, SCIP_INVALID, SCIP_Real, SCIPinfinity(), SCIPisFeasEQ(), SCIPisInfinity(), SCIPvarGetLbLocal(), SCIPvarGetUbLocal(), and TRUE.
Referenced by consdataCalcMinAbsval().
◆ consdataRecomputeMaxActivityDelta()
|
static |
recompute maximal activity contribution for a single variable
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 1543 of file cons_linear.c.
References consdataUpdateActivities(), REALABS, SCIP_Bool, SCIP_Real, SCIPinfinity(), SCIPisInfinity(), SCIPvarGetLbLocal(), and SCIPvarGetUbLocal().
Referenced by consdataCheckNonbinvar().
◆ consdataUpdateActivities()
|
static |
updates activities for a change in a bound
- Parameters
-
scip SCIP data structure consdata linear constraint data var variable that has been changed; can be NULL for global bound changes oldbound old bound of variable newbound new bound of variable val coefficient of constraint entry boundtype type of the bound change global is it a global or a local bound change? checkreliability should the reliability of the recalculated activity be checked?
Definition at line 1605 of file cons_linear.c.
Referenced by consdataRecomputeMaxActivityDelta().
◆ consdataUpdateActivitiesLb()
|
static |
updates minimum and maximum activity for a change in lower bound
- Parameters
-
scip SCIP data structure consdata linear constraint data var variable that has been changed oldlb old lower bound of variable newlb new lower bound of variable val coefficient of constraint entry checkreliability should the reliability of the recalculated activity be checked?
Definition at line 1990 of file cons_linear.c.
◆ consdataUpdateActivitiesUb()
|
static |
updates minimum and maximum activity for a change in upper bound
- Parameters
-
scip SCIP data structure consdata linear constraint data var variable that has been changed oldub old upper bound of variable newub new upper bound of variable val coefficient of constraint entry checkreliability should the reliability of the recalculated activity be checked?
Definition at line 2015 of file cons_linear.c.
◆ consdataUpdateActivitiesGlbLb()
|
static |
updates minimum and maximum global activity for a change in the global lower bound
- Parameters
-
scip SCIP data structure consdata linear constraint data oldlb old lower bound of variable newlb new lower bound of variable val coefficient of constraint entry checkreliability should the reliability of the recalculated activity be checked?
Definition at line 2040 of file cons_linear.c.
◆ consdataUpdateActivitiesGlbUb()
|
static |
updates minimum and maximum global activity for a change in global upper bound
- Parameters
-
scip SCIP data structure consdata linear constraint data oldub old upper bound of variable newub new upper bound of variable val coefficient of constraint entry checkreliability should the reliability of the recalculated activity be checked?
Definition at line 2063 of file cons_linear.c.
◆ consdataUpdateAddCoef()
|
static |
updates minimum and maximum activity and maximum absolute value for coefficient addition
- Parameters
-
scip SCIP data structure consdata linear constraint data var variable of constraint entry val coefficient of constraint entry checkreliability should the reliability of the recalculated activity be checked?
Definition at line 2086 of file cons_linear.c.
◆ consdataUpdateDelCoef()
|
static |
updates minimum and maximum activity for coefficient deletion, invalidates maximum absolute value if necessary
- Parameters
-
scip SCIP data structure consdata linear constraint data var variable of constraint entry val coefficient of constraint entry checkreliability should the reliability of the recalculated activity be checked?
Definition at line 2136 of file cons_linear.c.
◆ consdataUpdateChgCoef()
|
static |
updates minimum and maximum activity for coefficient change, invalidates maximum absolute value if necessary
- Parameters
-
scip SCIP data structure consdata linear constraint data var variable of constraint entry oldval old coefficient of constraint entry newval new coefficient of constraint entry checkreliability should the reliability of the recalculated activity be checked?
Definition at line 2193 of file cons_linear.c.
◆ consdataGetMaxAbsval()
|
static |
returns the maximum absolute value of all coefficients in the constraint
- Parameters
-
consdata linear constraint data
Definition at line 2292 of file cons_linear.c.
References consdataCalcMinAbsval(), NULL, and SCIP_INVALID.
Referenced by aggregateConstraints().
◆ consdataGetMinAbsval()
|
static |
returns the minimum absolute value of all coefficients in the constraint
- Parameters
-
consdata linear constraint data
Definition at line 2308 of file cons_linear.c.
References NULL, SCIP_INVALID, and TRUE.
◆ consdataCalcActivities()
|
static |
calculates minimum and maximum local and global activity for constraint from scratch; additionally recalculates maximum absolute value of coefficients
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 2326 of file cons_linear.c.
Referenced by consdataGetActivityBounds(), consdataGetActivityResiduals(), and consdataGetGlbActivityResiduals().
◆ getMinActivity()
|
static |
gets minimal activity for constraint and given values of counters for infinite and huge contributions and (if needed) delta to subtract from stored finite part of activity in case of a residual activity
- Parameters
-
scip SCIP data structure consdata linear constraint posinf number of coefficients contributing pos. infinite value neginf number of coefficients contributing neg. infinite value poshuge number of coefficients contributing huge pos. value neghuge number of coefficients contributing huge neg. value delta value to subtract from stored minactivity (contribution of the variable set to zero when getting residual activity) global should the global or local minimal activity be returned? goodrelax should a good relaxation be computed or are relaxed acticities ignored, anyway? minactivity pointer to store the minimal activity isrelax pointer to store whether the activity is a relaxation, i.e. is <= the exact minactivity (in case of huge contributing values) issettoinfinity pointer to store whether minactivity was set to infinity or calculated
Definition at line 2388 of file cons_linear.c.
Referenced by consdataGetActivityBounds(), consdataGetActivityResiduals(), and consdataGetGlbActivityResiduals().
◆ getMaxActivity()
|
static |
gets maximal activity for constraint and given values of counters for infinite and huge contributions and (if needed) delta to subtract from stored finite part of activity in case of a residual activity
- Parameters
-
scip SCIP data structure consdata linear constraint posinf number of coefficients contributing pos. infinite value neginf number of coefficients contributing neg. infinite value poshuge number of coefficients contributing huge pos. value neghuge number of coefficients contributing huge neg. value delta value to subtract from stored maxactivity (contribution of the variable set to zero when getting residual activity) global should the global or local maximal activity be returned? goodrelax should a good relaxation be computed or are relaxed acticities ignored, anyway? maxactivity pointer to store the maximal activity isrelax pointer to store whether the activity is a relaxation, i.e. is >= the exact maxactivity (in case of huge contributing values) issettoinfinity pointer to store whether maxactivity was set to infinity or calculated
Definition at line 2489 of file cons_linear.c.
Referenced by consdataGetActivityBounds(), consdataGetActivityResiduals(), and consdataGetGlbActivityResiduals().
◆ consdataGetActivityBounds()
|
static |
gets activity bounds for constraint
- Parameters
-
scip SCIP data structure consdata linear constraint goodrelax if we have huge contributions, do we need a good relaxation or are relaxed activities ignored, anyway? minactivity pointer to store the minimal activity maxactivity pointer to store the maximal activity minisrelax pointer to store whether the returned minactivity is just a relaxation, i.e. <= the exact minactivity (in case of huge contributions), or equal to the exact minimal activity maxisrelax pointer to store whether the returned maxactivity is just a relaxation, i.e. >= the exact maxactivity (in case of huge contributions), or equal to the exact maximal activity isminsettoinfinity pointer to store whether minactivity was set to infinity or calculated ismaxsettoinfinity pointer to store whether maxactivity was set to infinity or calculated
Definition at line 2588 of file cons_linear.c.
References consdataCalcActivities(), consdataGetReliableResidualActivity(), FALSE, getMaxActivity(), getMinActivity(), NULL, SCIP_Bool, SCIP_INVALID, and SCIP_Real.
◆ consdataGetReliableResidualActivity()
|
static |
calculates activity bounds for constraint after setting variable to zero
- Parameters
-
scip SCIP data structure consdata linear constraint cancelvar variable to calculate activity residual for resactivity pointer to store the residual activity isminresact should minimal or maximal residual activity be calculated? useglobalbounds should global or local bounds be used?
Definition at line 2637 of file cons_linear.c.
Referenced by consdataGetActivityBounds().
◆ consdataGetActivityResiduals()
|
static |
gets activity bounds for constraint after setting variable to zero
- Parameters
-
scip SCIP data structure consdata linear constraint var variable to calculate activity residual for val coefficient value of variable in linear constraint goodrelax if we have huge contributions, do we need a good relaxation or are relaxed acticities ignored, anyway? minresactivity pointer to store the minimal residual activity maxresactivity pointer to store the maximal residual activity minisrelax pointer to store whether the returned residual minactivity is just a relaxation, i.e. <= the exact residual minactivity (in case of huge contributions), or equal to the exact residual minactivity maxisrelax pointer to store whether the returned residual maxactivity is just a relaxation, i.e. <= the exact residual maxactivity (in case of huge contributions), or equal to the exact residual minactivity isminsettoinfinity pointer to store whether minresactivity was set to infinity or calculated ismaxsettoinfinity pointer to store whether maxresactivity was set to infinity or calculated
Definition at line 2718 of file cons_linear.c.
References consdataCalcActivities(), consdataGetGlbActivityBounds(), FALSE, getMaxActivity(), getMinActivity(), NULL, SCIP_Bool, SCIP_INVALID, SCIP_Real, SCIPisHugeValue(), SCIPisInfinity(), SCIPvarGetLbLocal(), and SCIPvarGetUbLocal().
◆ consdataGetGlbActivityBounds()
|
static |
gets global activity bounds for constraint
- Parameters
-
scip SCIP data structure consdata linear constraint goodrelax if we have huge contributions, do we need a good relaxation or are relaxed acticities ignored, anyway? glbminactivity pointer to store the minimal activity, or NULL, if not needed glbmaxactivity pointer to store the maximal activity, or NULL, if not needed minisrelax pointer to store whether the returned minactivity is just a relaxation, i.e. <= the exact minactivity (in case of huge contributions), or equal to the exact minimal activity maxisrelax pointer to store whether the returned maxactivity is just a relaxation, i.e. >= the exact maxactivity (in case of huge contributions), or equal to the exact maximal activity isminsettoinfinity pointer to store whether minresactivity was set to infinity or calculated ismaxsettoinfinity pointer to store whether maxresactivity was set to infinity or calculated
Definition at line 2869 of file cons_linear.c.
Referenced by consdataGetActivityResiduals().
◆ consdataGetGlbActivityResiduals()
|
static |
gets global activity bounds for constraint after setting variable to zero
- Parameters
-
scip SCIP data structure consdata linear constraint var variable to calculate activity residual for val coefficient value of variable in linear constraint goodrelax if we have huge contributions, do we need a good relaxation or are relaxed acticities ignored, anyway? minresactivity pointer to store the minimal residual activity, or NULL, if not needed maxresactivity pointer to store the maximal residual activity, or NULL, if not needed minisrelax pointer to store whether the returned residual minactivity is just a relaxation, i.e. <= the exact residual minactivity (in case of huge contributions), or equal to the exact residual minactivity maxisrelax pointer to store whether the returned residual maxactivity is just a relaxation, i.e. <= the exact residual maxactivity (in case of huge contributions), or equal to the exact residual minactivity isminsettoinfinity pointer to store whether minresactivity was set to infinity or calculated ismaxsettoinfinity pointer to store whether maxresactivity was set to infinity or calculated
Definition at line 2931 of file cons_linear.c.
References consdataCalcActivities(), consdataComputePseudoActivity(), consdataGetActivity(), getMaxActivity(), getMinActivity(), NULL, SCIP_INVALID, SCIP_Real, SCIPhasCurrentNodeLP(), SCIPisHugeValue(), SCIPisInfinity(), SCIPvarGetLbGlobal(), SCIPvarGetUbGlobal(), and TRUE.
◆ consdataGetActivity()
|
static |
calculates the activity of the linear constraint for given solution
- Parameters
-
scip SCIP data structure consdata linear constraint data sol solution to get activity for, NULL to current solution
Definition at line 3083 of file cons_linear.c.
References consdataGetFeasibility(), FALSE, MAX, NULL, SCIP_INVALID, SCIP_Real, SCIPdebugMsg, SCIPgetSolVal(), SCIPinfinity(), SCIPisInfinity(), and TRUE.
Referenced by consdataGetGlbActivityResiduals(), and SCIP_DECL_CONSCHECK().
◆ consdataGetFeasibility()
|
static |
calculates the feasibility of the linear constraint for given solution
- Parameters
-
scip SCIP data structure consdata linear constraint data sol solution to get feasibility for, NULL to current solution
Definition at line 3151 of file cons_linear.c.
References NULL, SCIP_Real, SCIPhashSignature64, SCIPvarGetIndex(), SCIPvarGetLbGlobal(), and SCIPvarGetUbGlobal().
Referenced by consdataGetActivity().
◆ consdataUpdateSignatures()
|
static |
updates bit signatures after adding a single coefficient
- Parameters
-
consdata linear constraint data pos position of coefficient to update signatures for
Definition at line 3172 of file cons_linear.c.
◆ consdataCalcSignatures()
|
static |
calculates the bit signatures of the given constraint data
- Parameters
-
consdata linear constraint data
Definition at line 3197 of file cons_linear.c.
References NULL, and SCIPvarIsBinary().
◆ SCIP_DECL_SORTINDCOMP() [1/3]
|
static |
index comparison method of linear constraints: compares two indices of the variable set in the linear constraint
Definition at line 3217 of file cons_linear.c.
References NULL, SCIPvarCompare(), SCIPvarGetType(), and SCIPvarIsBinary().
Referenced by aggregateVariables().
◆ SCIP_DECL_SORTINDCOMP() [2/3]
|
static |
index comparison method of linear constraints: compares two indices of the variable set in the linear constraint
Definition at line 3256 of file cons_linear.c.
References EPSGT, NULL, permSortConsdata(), REALABS, SCIP_Real, SCIPvarGetLbGlobal(), SCIPvarGetProbindex(), SCIPvarGetType(), SCIPvarGetUbGlobal(), and SCIPvarIsIntegral().
◆ permSortConsdata()
|
static |
permutes the constraint's variables according to a given permutation.
- Parameters
-
consdata the constraint data perm the target permutation nvars the number of variables
Definition at line 3326 of file cons_linear.c.
References consdataSort(), NULL, SCIP_STAGE_INITSOLVE, SCIPgetStage(), SCIPvarIsBinary(), and TRUE.
Referenced by consdataSort(), and SCIP_DECL_SORTINDCOMP().
◆ consdataSort()
|
static |
sorts linear constraint's variables depending on the stage of the solving process:
- during PRESOLVING sorts variables by binaries, integers, implicit integers, and continuous variables, and the variables of the same type by non-decreasing variable index
during SOLVING sorts variables of the remaining problem by binaries, integers, implicit integers, and continuous variables, and binary and integer variables by their global max activity delta (within each group), ties within a group are broken by problem index of the variable.
This fastens the propagation time of the constraint handler.
- Parameters
-
scip SCIP data structure consdata linear constraint data
Definition at line 3402 of file cons_linear.c.
References chgLhs(), FALSE, NULL, permSortConsdata(), SCIP_Bool, SCIP_CALL, SCIP_OKAY, SCIP_Real, SCIP_STAGE_INITSOLVE, SCIPallocBufferArray, SCIPfreeBufferArray, SCIPgetStage(), SCIPinfinity(), SCIPisInfinity(), SCIPsort(), SCIPvarIsBinary(), and TRUE.
Referenced by permSortConsdata().
◆ chgLhs()
|
static |
sets left hand side of linear constraint
- Parameters
-
scip SCIP data structure cons linear constraint lhs new left hand side
Definition at line 3469 of file cons_linear.c.
Referenced by consdataSort(), and SCIPaddCoefLinear().
◆ chgRhs()
|
static |
sets right hand side of linear constraint
- Parameters
-
scip SCIP data structure cons linear constraint rhs new right hand side
Definition at line 3595 of file cons_linear.c.
Referenced by SCIPaddCoefLinear(), and SCIPchgLhsLinear().
◆ addCoef()
|
static |
adds coefficient in linear constraint
- Parameters
-
scip SCIP data structure cons linear constraint var variable of constraint entry val coefficient of constraint entry
Definition at line 3723 of file cons_linear.c.
Referenced by SCIPaddCoefLinear().
◆ delCoefPos()
|
static |
deletes coefficient at given position from linear constraint data
- Parameters
-
scip SCIP data structure cons linear constraint pos position of coefficient to delete
Definition at line 3888 of file cons_linear.c.
Referenced by performVarDeletions(), and SCIPchgCoefLinear().
◆ chgCoefPos()
|
static |
changes coefficient value at given position of linear constraint data
- Parameters
-
scip SCIP data structure cons linear constraint pos position of coefficient to delete newval new value of coefficient
Definition at line 4009 of file cons_linear.c.
Referenced by SCIPchgCoefLinear().
◆ scaleCons()
|
static |
scales a linear constraint with a constant scalar
- Parameters
-
scip SCIP data structure cons linear constraint to scale scalar value to scale constraint with
Definition at line 4088 of file cons_linear.c.
◆ performVarDeletions()
|
static |
perform deletion of variables in all constraints of the constraint handler
- Parameters
-
scip SCIP data structure conshdlr constraint handler conss array of constraints nconss number of constraints
Definition at line 4181 of file cons_linear.c.
References delCoefPos(), FALSE, normalizeCons(), SCIP_Bool, SCIP_CALL, SCIP_Longint, SCIP_OKAY, SCIP_Real, SCIPconsGetData(), and SCIPvarIsDeleted().
Referenced by SCIP_DECL_CONSLOCK().
◆ normalizeCons()
|
static |
normalizes a linear constraint with the following rules:
- if all coefficients have them same absolute value, change them to (-)1.0
- multiplication with +1 or -1: Apply the following rules in the given order, until the sign of the factor is determined. Later rules only apply, if the current rule doesn't determine the sign):
- the right hand side must not be negative
- the right hand side must not be infinite
- the absolute value of the right hand side must be greater than that of the left hand side
- the number of positive coefficients must not be smaller than the number of negative coefficients
- multiply with +1
- rationals to integrals Try to identify a rational representation of the fractional coefficients, and multiply all coefficients by the smallest common multiple of all denominators to get integral coefficients. Forbid large denominators due to numerical stability.
- division by greatest common divisor If all coefficients are integral, divide them by the greatest common divisor.
- Parameters
-
scip SCIP data structure cons linear constraint to normalize infeasible pointer to store whether infeasibility was detected
Definition at line 4240 of file cons_linear.c.
Referenced by aggregateConstraints(), aggregateVariables(), and performVarDeletions().
◆ mergeMultiples()
|
static |
replaces multiple occurrences of a variable by a single coefficient
- Parameters
-
scip SCIP data structure cons linear constraint
Definition at line 4573 of file cons_linear.c.
◆ applyFixings()
|
static |
replaces all fixed and aggregated variables by their non-fixed counterparts
- Parameters
-
scip SCIP data structure cons linear constraint infeasible pointer to store if infeasibility is detected; or NULL if this information is not needed; in this case, we apply all fixings instead of stopping after the first infeasible one
Definition at line 4644 of file cons_linear.c.
Referenced by addRelaxation(), aggregateVariables(), and SCIPcleanupConssLinear().
◆ addConflictBounds()
|
static |
for each variable in the linear constraint, except the inferred variable, adds one bound to the conflict analysis' candidate store (bound depends on sign of coefficient and whether the left or right hand side was the reason for the inference variable's bound change); the conflict analysis can be initialized with the linear constraint being the conflict detecting constraint by using NULL as inferred variable
- Parameters
-
scip SCIP data structure cons constraint that inferred the bound change infervar variable that was deduced, or NULL bdchgidx bound change index (time stamp of bound change), or NULL for current time inferpos position of the inferred variable in the vars array reasonisrhs is the right hand side responsible for the bound change?
Definition at line 4904 of file cons_linear.c.
◆ addConflictFixedVars()
|
static |
for each variable in the linear ranged row constraint, except the inferred variable, adds the bounds of all fixed variables to the conflict analysis' candidate store; the conflict analysis can be initialized with the linear constraint being the conflict detecting constraint by using NULL as inferred variable
- Parameters
-
scip SCIP data structure cons constraint that inferred the bound change infervar variable that was deduced, or NULL bdchgidx bound change index (time stamp of bound change), or NULL for current time inferpos position of the inferred variable in the vars array, or -1
Definition at line 5086 of file cons_linear.c.
◆ addConflictReasonVars()
|
static |
add reasoning variables to conflict candidate queue which led to the conflict
- Parameters
-
scip SCIP data structure vars variables reasoning the infeasibility nvars number of variables reasoning the infeasibility var variable which was tried to fix/tighten, or NULL bound bound of variable which was tried to apply, or SCIP_INVALID
Definition at line 5151 of file cons_linear.c.
References NULL, resolvePropagation(), SCIP_CALL, SCIP_OKAY, SCIP_Real, SCIPaddConflictLb(), SCIPaddConflictUb(), SCIPisEQ(), SCIPvarGetLbLocal(), SCIPvarGetUbGlobal(), and SCIPvarGetUbLocal().
◆ resolvePropagation()
|
static |
resolves a propagation on the given variable by supplying the variables needed for applying the corresponding propagation rule (see propagateCons()): (1) activity residuals of all other variables tighten bounds of single variable
- Parameters
-
scip SCIP data structure cons constraint that inferred the bound change infervar variable that was deduced inferinfo inference information boundtype the type of the changed bound (lower or upper bound) bdchgidx bound change index (time stamp of bound change), or NULL for current time result pointer to store the result of the propagation conflict resolving call
Definition at line 5202 of file cons_linear.c.
Referenced by addConflictReasonVars().
◆ analyzeConflict()
|
static |
analyzes conflicting bounds on given constraint, and adds conflict constraint to problem
- Parameters
-
scip SCIP data structure cons conflict detecting constraint reasonisrhs is the right hand side responsible for the conflict?
Definition at line 5295 of file cons_linear.c.
◆ canTightenBounds()
check if there is any hope of tightening some bounds
- Parameters
-
cons linear constraint
Definition at line 5319 of file cons_linear.c.
◆ tightenVarUb()
|
static |
tighten upper bound
- Parameters
-
scip SCIP data structure cons linear constraint pos variable position proprule propagation rule that deduced the value newub new upper bound oldub old upper bound cutoff pointer to store whether the node can be cut off nchgbds pointer to count the total number of tightened bounds force should a possible bound change be forced even if below bound strengthening tolerance
Definition at line 5347 of file cons_linear.c.
◆ tightenVarLb()
|
static |
tighten lower bound
- Parameters
-
scip SCIP data structure cons linear constraint pos variable position proprule propagation rule that deduced the value newlb new lower bound oldlb old lower bound cutoff pointer to store whether the node can be cut off nchgbds pointer to count the total number of tightened bounds force should a possible bound change be forced even if below bound strengthening tolerance
Definition at line 5416 of file cons_linear.c.
◆ tightenVarBoundsEasy()
|
static |
tightens bounds of a single variable due to activity bounds (easy case)
- Parameters
-
scip SCIP data structure cons linear constraint pos position of the variable in the vars array cutoff pointer to store whether the node can be cut off nchgbds pointer to count the total number of tightened bounds force should a possible bound change be forced even if below bound strengthening tolerance
Definition at line 5485 of file cons_linear.c.
◆ analyzeConflictRangedRow()
|
static |
analyzes conflicting bounds on given ranged row constraint, and adds conflict constraint to problem
- Parameters
-
scip SCIP data structure cons conflict detecting constraint vars variables reasoning the infeasibility nvars number of variables reasoning the infeasibility var variable which was tried to fix/tighten, or NULL bound bound of variable which was tried to apply, or SCIP_INVALID
Definition at line 5762 of file cons_linear.c.
◆ rangedRowPropagation()
|
static |
propagate ranged rows
Check ranged rows for possible solutions, possibly detect infeasibility, fix variables due to having only one possible solution, tighten bounds if having only two possible solutions or add constraints which propagate a subset of variables better.
Example: c1: 12 x1 + 9 x2 - x3 = 0 with x1, x2 free and 1 <= x3 <= 2
x3 needs to be a multiple of 3, so the instance is infeasible.
Example: c1: 12 x1 + 9 x2 - x3 = 1 with x1, x2 free and 1 <= x3 <= 2
The only possible value for x3 is 2, so the variable will be fixed.
- Parameters
-
scip SCIP data structure cons linear constraint cutoff pointer to store TRUE, if a cutoff was found nfixedvars pointer to count number of fixed variables nchgbds pointer to count the number of bound changes naddconss pointer to count number of added constraints
Definition at line 5820 of file cons_linear.c.
◆ tightenVarBounds()
|
static |
tightens bounds of a single variable due to activity bounds
- Parameters
-
scip SCIP data structure cons linear constraint pos position of the variable in the vars array cutoff pointer to store whether the node can be cut off nchgbds pointer to count the total number of tightened bounds force should a possible bound change be forced even if below bound strengthening tolerance
Definition at line 6805 of file cons_linear.c.
◆ tightenBounds()
|
static |
tightens bounds of variables in constraint due to activity bounds
- Parameters
-
scip SCIP data structure cons linear constraint maxeasyactivitydelta maximum activity delta to run easy propagation on linear constraint sortvars should variables be used in sorted order? cutoff pointer to store whether the node can be cut off nchgbds pointer to count the total number of tightened bounds
Definition at line 7077 of file cons_linear.c.
◆ checkCons()
|
static |
checks linear constraint for feasibility of given solution or current solution
- Parameters
-
scip SCIP data structure cons linear constraint sol solution to be checked, or NULL for current solution checklprows Do constraints represented by rows in the current LP have to be checked? 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)? violated pointer to store whether the constraint is violated
Definition at line 7255 of file cons_linear.c.
Referenced by SCIP_DECL_CONSCHECK().
◆ createRow()
|
static |
creates an LP row in a linear constraint data
- Parameters
-
scip SCIP data structure cons linear constraint
Definition at line 7515 of file cons_linear.c.
Referenced by addRelaxation().
◆ addRelaxation()
|
static |
adds linear constraint as cut to the LP
- Parameters
-
scip SCIP data structure cons linear constraint cutoff pointer to store whether a cutoff was found
Definition at line 7539 of file cons_linear.c.
References applyFixings(), createRow(), FALSE, NULL, SCIP_Bool, SCIP_CALL, SCIP_OKAY, SCIPaddRow(), SCIPconsGetName(), SCIPdebug, SCIPdebugMsg, SCIPgetIntParam(), SCIPisInfinity(), SCIPprintRow(), SCIProwIsInLP(), and separateCons().
◆ separateCons()
|
static |
separates linear constraint: adds linear constraint as cut, if violated by given solution
- Parameters
-
scip SCIP data structure cons linear constraint conshdlrdata constraint handler data sol primal CIP solution, NULL for current LP solution separatecards should knapsack cardinality cuts be generated? separateall should all constraints be subject to cardinality cut generation instead of only the ones with non-zero dual value? ncuts pointer to add up the number of found cuts cutoff pointer to store whether a cutoff was found
Definition at line 7602 of file cons_linear.c.
Referenced by addRelaxation().
◆ propagateCons()
|
static |
propagation method for linear constraints
- Parameters
-
scip SCIP data structure cons linear constraint tightenbounds should the variable's bounds be tightened? rangedrowpropagation should ranged row propagation be performed? maxeasyactivitydelta maximum activity delta to run easy propagation on linear constraint sortvars should variable sorting for faster propagation be used? cutoff pointer to store whether the node can be cut off nchgbds pointer to count the total number of tightened bounds
Definition at line 7692 of file cons_linear.c.
Referenced by SCIP_DECL_CONSPROP().
◆ fixVariables()
|
static |
converts all variables with fixed domain into FIXED variables
- Parameters
-
scip SCIP data structure cons linear constraint cutoff pointer to store TRUE, if a cutoff was found nfixedvars pointer to count the total number of fixed variables
Definition at line 7840 of file cons_linear.c.
◆ extractCliques()
|
static |
extracts cliques of the constraint and adds them to SCIP
The following clique extraction mechanism are implemeneted
collect binary variables and sort them in non increasing order, then
a) if the constraint has a finite right hand side and the negative infinity counters for the minactivity are zero then add the variables as a clique for which all successive pairs of coefficients fullfill the following condition
minactivity + vals[i] + vals[i+1] > rhs
and also add the binary to binary implication also for non-successive variables for which the same argument holds
minactivity + vals[i] + vals[j] > rhs
e.g. 5.3 x1 + 3.6 x2 + 3.3 x3 + 2.1 x4 <= 5.5 (all x are binary) would lead to the clique (x1, x2, x3) and the binary to binary implications x1 = 1 => x4 = 0 and x2 = 1 => x4 = 0b) if the constraint has a finite left hand side and the positive infinity counters for the maxactivity are zero then add the variables as a clique for which all successive pairs of coefficients fullfill the follwoing condition
maxactivity + vals[i] + vals[i-1] < lhs
and also add the binary to binary implication also for non-successive variables for which the same argument holds
maxactivity + vals[i] + vals[j] < lhs
e.g. you could multiply the above example by -1
c) the constraint has a finite right hand side and a finite minactivity then add the variables as a negated clique(clique on the negated variables) for which all successive pairs of coefficients fullfill the following condition
minactivity - vals[i] - vals[i-1] > rhs
and also add the binary to binary implication also for non-successive variables for which the same argument holds
minactivity - vals[i] - vals[j] > rhs
e.g. -4 x1 -3 x2 - 2 x3 + 2 x4 <= -4 would lead to the (negated) clique (~x1, ~x2) and the binary to binary implication x1 = 0 => x3 = 1d) the constraint has a finite left hand side and a finite maxactivity then add the variables as a negated clique(clique on the negated variables) for which all successive pairs of coefficients fullfill the following condition
maxactivity - vals[i] - vals[i+1] < lhs
and also add the binary to binary implication also for non-successive variables for which the same argument holds
maxactivity - vals[i] - vals[j] < lhs
e.g. you could multiply the above example by -1
- if the linear constraint represents a set-packing or set-partitioning constraint, the whole constraint is added as clique, (this part is done at the end of the method)
- Parameters
-
scip SCIP data structure cons linear constraint maxeasyactivitydelta maximum activity delta to run easy propagation on linear constraint sortvars should variables be used in sorted order? nfixedvars pointer to count number of fixed variables nchgbds pointer to count the total number of tightened bounds cutoff pointer to store TRUE, if a cutoff was found
Definition at line 7975 of file cons_linear.c.
◆ tightenSides()
|
static |
tightens left and right hand side of constraint due to integrality
- Parameters
-
scip SCIP data structure cons linear constraint nchgsides pointer to count number of side changes infeasible pointer to store whether infeasibility was detected
Definition at line 8944 of file cons_linear.c.
◆ consdataTightenCoefs()
|
static |
tightens coefficients of binary, integer, and implicit integer variables due to activity bounds in presolving: given an inequality lhs <= a*x + ai*xi <= rhs, with a non-continuous variable li <= xi <= ui let minact := min{a*x + ai*xi}, maxact := max{a*x + ai*xi} (i) ai >= 0: if minact + ai >= lhs and maxact - ai <= rhs: (**)
- a deviation from the lower/upper bound of xi would make the left/right hand side redundant
- ai, lhs and rhs can be changed to have the same redundancy effect and the same results for xi fixed to its bounds, but with a reduced ai and tightened sides to tighten the LP relaxation
- change coefficients: ai' := max(lhs - minact, maxact - rhs) lhs' := lhs - (ai - ai')*li rhs' := rhs - (ai - ai')*ui (ii) ai < 0: if minact - ai >= lhs and maxact + ai <= rhs: (***)
- a deviation from the upper/lower bound of xi would make the left/right hand side redundant
- ai, lhs and rhs can be changed to have the same redundancy effect and the same results for xi fixed to its bounds, but with a reduced ai and tightened sides to tighten the LP relaxation
- change coefficients: ai' := min(rhs - maxact, minact - lhs) lhs' := lhs - (ai - ai')*ui rhs' := rhs - (ai - ai')*li
We further try to remove redundant variable from the constraint; Variables which fulfill conditions (**) or (***) are called surely non-redundant variables. A deviation of only one from their bound makes the lhs/rhs feasible (i.e., redundant), even if all other variables are set to their "worst" bound. If all variables which are not surely non-redundant cannot make the lhs/rhs redundant, even if they are set to their "best" bound, they can be removed from the constraint. E.g., for binary variables and an inequality x_1 +x_2 +10y_1 +10y_2 >= 5, setting either of the y_i to one suffices to fulfill the inequality, whereas the x_i do not contribute to feasibility and can be removed.
- Parameters
-
scip SCIP data structure cons linear constraint nchgcoefs pointer to count total number of changed coefficients nchgsides pointer to count number of side changes
Definition at line 9066 of file cons_linear.c.
◆ convertUnaryEquality()
|
static |
processes equality with only one variable by fixing the variable and deleting the constraint
- Parameters
-
scip SCIP data structure cons linear constraint cutoff pointer to store TRUE, if a cutoff was found nfixedvars pointer to count number of fixed variables ndelconss pointer to count number of deleted constraints
Definition at line 9500 of file cons_linear.c.
◆ convertBinaryEquality()
|
static |
processes equality with exactly two variables by aggregating one of the variables and deleting the constraint
- Parameters
-
scip SCIP data structure cons linear constraint cutoff pointer to store TRUE, if a cutoff was found naggrvars pointer to count number of aggregated variables ndelconss pointer to count number of deleted constraints
Definition at line 9556 of file cons_linear.c.
◆ getNewSidesAfterAggregation()
|
static |
calculates the new lhs and rhs of the constraint after the given variable is aggregated out
- Parameters
-
scip SCIP data structure consdata linear constraint data slackvar variable to be aggregated out slackcoef coefficient of variable in constraint newlhs pointer to store new lhs of constraint newrhs pointer to store new rhs of constraint
Definition at line 9614 of file cons_linear.c.
◆ convertLongEquality()
|
static |
processes equality with more than two variables by multi-aggregating one of the variables and converting the equality into an inequality; if multi-aggregation is not possible, tries to identify one continuous or integer variable that is implicitly integral by this constraint
- Parameters
-
scip SCIP data structure conshdlrdata linear constraint handler data cons linear constraint cutoff pointer to store TRUE, if a cutoff was found naggrvars pointer to count number of aggregated variables ndelconss pointer to count number of deleted constraints
Definition at line 9668 of file cons_linear.c.
◆ checkEqualObjective()
|
static |
checks if the given variables and their coefficient are equal (w.r.t. scaling factor) to the objective function
- Parameters
-
scip SCIP data structure consdata linear constraint data scale pointer to store the scaling factor between the constraint and the objective function offset pointer to store the offset of the objective function resulting by this constraint
Definition at line 10209 of file cons_linear.c.
◆ checkPartialObjective()
|
static |
check if the linear equality constraint is equal to a subset of the objective function; if so we can remove the objective coefficients and add an objective offset
- Parameters
-
scip SCIP data structure cons linear equation constraint conshdlrdata linear constraint handler data
Definition at line 10287 of file cons_linear.c.
◆ updateCutoffbound()
|
static |
updates the cutoff if the given primal bound (which is implied by the given constraint) is better
- Parameters
-
scip SCIP data structure cons constraint primalbound feasible primal bound
Definition at line 10354 of file cons_linear.c.
◆ checkParallelObjective()
|
static |
check if the linear constraint is parallel to objective function; if so update the cutoff bound and avoid that the constraint enters the LP by setting the initial and separated flag to FALSE
- Parameters
-
scip SCIP data structure cons linear constraint conshdlrdata linear constraint handler data
Definition at line 10400 of file cons_linear.c.
◆ convertEquality()
|
static |
converts special equalities
- Parameters
-
scip SCIP data structure cons linear constraint conshdlrdata linear constraint handler data cutoff pointer to store TRUE, if a cutoff was found nfixedvars pointer to count number of fixed variables naggrvars pointer to count number of aggregated variables ndelconss pointer to count number of deleted constraints
Definition at line 10525 of file cons_linear.c.
◆ consdataIsResidualIntegral()
|
static |
returns whether the linear sum of all variables/coefficients except the given one divided by the given value is always integral
- Parameters
-
scip SCIP data structure consdata linear constraint pos position of variable to be left out val value to divide the coefficients by
Definition at line 10580 of file cons_linear.c.
References NULL, and SCIPisInfinity().
◆ calculateMinvalAndMaxval()
|
static |
check if lhs/a_i - {j i} a_j/a_i * x_j is always inside the bounds of x_i, check if rhs/a_i - {j i} a_j/a_i * x_j is always inside the bounds of x_i
- Parameters
-
scip SCIP data structure side lhs or rhs val coefficient minresactivity minimal residual activity maxresactivity maximal residual activity minval pointer to store calculated minval maxval pointer to store calculated maxval
Definition at line 10606 of file cons_linear.c.
References dualPresolve(), SCIP_Bool, SCIP_Real, and SCIPisInfinity().
◆ dualPresolve()
|
static |
applies dual presolving for variables that are locked only once in a direction, and this locking is due to a linear inequality
- Parameters
-
scip SCIP data structure conshdlrdata linear constraint handler data cons linear constraint cutoff pointer to store TRUE, if a cutoff was found nfixedvars pointer to count number of fixed variables naggrvars pointer to count number of aggregated variables ndelconss pointer to count number of deleted constraints
Definition at line 10651 of file cons_linear.c.
Referenced by calculateMinvalAndMaxval().
◆ getVarWeight()
|
static |
gets weight for variable in a "weighted number of variables" sum
- Parameters
-
var variable to get weight for
Definition at line 11112 of file cons_linear.c.
References NULL, SCIP_Bool, and SCIPconsGetData().
Referenced by aggregateConstraints().
◆ aggregateVariables()
|
static |
tries to aggregate variables in equations a^Tx = lhs in case there are at most two binary variables with an odd coefficient and all other variables are not continuous and have an even coefficient then:
- exactly one odd binary variables this binary variables y can be fixed to 0 if the lhs is even and to 1 if the lhs is odd
- lhs is odd -> y = 1
- lhs is even -> y = 0
- exactly two odd binary variables aggregate the two binary variables with odd coefficient
- lhs is odd -> exactly one of the variable has to be 1 -> var1 + var2 = 1
- lhs is even -> both have to take the same value -> var1 - var2 = 0
- Parameters
-
scip SCIP data structure cons linear constraint cutoff pointer to store TRUE, if a cutoff was found nfixedvars pointer to count number of fixed variables naggrvars pointer to count number of aggregated variables
Definition at line 11145 of file cons_linear.c.
References applyFixings(), FALSE, normalizeCons(), NULL, SCIP_Bool, SCIP_CALL, SCIP_DECL_SORTINDCOMP(), SCIP_Longint, SCIP_OKAY, SCIP_Real, SCIP_VARTYPE_CONTINUOUS, SCIPaggregateVars(), SCIPconsGetName(), SCIPdebugMsg, SCIPfeasFloor(), SCIPfixVar(), SCIPisInfinity(), SCIPisIntegral(), SCIPvarGetName(), SCIPvarGetType(), SCIPvarIsBinary(), and TRUE.
Referenced by checkCons(), and SCIP_DECL_CONSPRESOL().
◆ SCIP_DECL_SORTINDCOMP() [3/3]
|
static |
sorting method for constraint data, compares two variables on given indices, continuous variables will be sorted to the end and for all other variables the sortation will be in non-increasing order of their absolute value of the coefficients
Definition at line 11317 of file cons_linear.c.
◆ rangedRowSimplify()
|
static |
tries to simplify coefficients and delete variables in ranged row of the form lhs <= a^Tx <= rhs, e.g. using the greatest common divisor
- lhs <= a^Tx <= rhs, forall a_i >= lhs, a_i <= rhs, and forall pairs a_i + a_j > rhs then we can change this constraint to 1^Tx = 1
- Parameters
-
scip SCIP data structure cons linear constraint nchgcoefs pointer to store the amount of changed coefficients nchgsides pointer to store the amount of changed sides
Definition at line 11357 of file cons_linear.c.
◆ simplifyInequalities()
|
static |
tries to simplify coefficients and delete variables in constraints of the form lhs <= a^Tx <= rhs for equations
- See also
- rangedRowSimplify() will be called
there are several different coefficient reduction steps which will be applied
We try to determine parts of the constraint which will not change anything on (in-)feasibility of the constraint
e.g. 5x1 + 5x2 + 3z1 <= 8 => 3z1 is redundant if all x are binary and -2 < 3z1 <= 3
We try to remove redundant fractional parts in a constraint
e.g. 5.2x1 + 5.1x2 + 3x3 <= 8.3 => will be changed to 5x1 + 5x2 + 3x3 <= 8 if all x are binary
We are using the greatest common divisor for further reductions
e.g. 10x1 + 5y2 + 5x3 + 3x4 <= 15 => will be changed to 2x1 + y2 + x3 + x4 <= 3 if all xi are binary and y2 is integral
- Parameters
-
scip SCIP data structure cons linear constraint nchgcoefs pointer to store the amount of changed coefficients nchgsides pointer to store the amount of changed sides infeasible pointer to store whether infeasibility was detected
Definition at line 11469 of file cons_linear.c.
◆ aggregateConstraints()
|
static |
tries to aggregate an (in)equality and an equality in order to decrease the number of variables in the (in)equality: cons0 := a * cons0 + b * cons1, where a = val1[v] and b = -val0[v] for common variable v which removes most variable weight; for numerical stability, we will only accept integral a and b; the variable weight is a weighted sum over all included variables, where each binary variable weighs BINWEIGHT, each integer or implicit integer variable weighs INTWEIGHT and each continuous variable weighs CONTWEIGHT
- Parameters
-
scip SCIP data structure cons0 (in)equality to modify cons1 equality to use for aggregation of cons0 commonidx0 array with indices of variables in cons0, that appear also in cons1 commonidx1 array with indices of variables in cons1, that appear also in cons0 diffidx0minus1 array with indices of variables in cons0, that don't appear in cons1 diffidx1minus0 array with indices of variables in cons1, that don't appear in cons0 nvarscommon number of variables, that appear in both constraints commonidxweight variable weight sum of common variables diffidx0minus1weight variable weight sum of variables in cons0, that don't appear in cons1 diffidx1minus0weight variable weight sum of variables in cons1, that don't appear in cons0 maxaggrnormscale maximal allowed relative gain in maximum norm for constraint aggregation nchgcoefs pointer to count the number of changed coefficients aggregated pointer to store whether an aggregation was made infeasible pointer to store whether infeasibility was detected
Definition at line 12694 of file cons_linear.c.
References a, b, consdataGetMaxAbsval(), FALSE, getVarWeight(), normalizeCons(), NULL, REALABS, SCIP_Bool, SCIP_CALL, SCIP_DECL_HASHGETKEY(), SCIP_DECL_HASHKEYEQ(), SCIP_OKAY, SCIP_Real, SCIPaddCons(), SCIPallocBufferArray, SCIPconsGetData(), SCIPconsGetName(), SCIPconsGetNUpgradeLocks(), SCIPconsIsActive(), SCIPconsIsChecked(), SCIPconsIsDynamic(), SCIPconsIsEnforced(), SCIPconsIsInitial(), SCIPconsIsLocal(), SCIPconsIsModifiable(), SCIPconsIsPropagated(), SCIPconsIsRemovable(), SCIPconsIsSeparated(), SCIPconsIsStickingAtNode(), SCIPcreateConsLinear(), SCIPdebug, SCIPdebugMsg, SCIPdebugPrintCons, SCIPdelCons(), SCIPfreeBufferArray, SCIPinfinity(), SCIPisEQ(), SCIPisInfinity(), SCIPisIntegral(), SCIPisLE(), SCIPisPositive(), SCIPisZero(), SCIPreleaseCons(), and TRUE.
◆ SCIP_DECL_HASHGETKEY()
|
static |
gets the key of the given element
Definition at line 13014 of file cons_linear.c.
Referenced by aggregateConstraints().
◆ SCIP_DECL_HASHKEYEQ()
|
static |
returns TRUE iff both keys are equal; two constraints are equal if they have the same variables and the coefficients are either equal or negated
Definition at line 13024 of file cons_linear.c.
Referenced by aggregateConstraints().
◆ SCIP_DECL_HASHKEYVAL()
|
static |
returns the hash value of the key
Definition at line 13085 of file cons_linear.c.
◆ getParallelConsKey()
|
static |
returns the key for deciding which of two parallel constraints should be kept (smaller key should be kept); prefers non-upgraded constraints and as second criterion the constraint with the smallest position
- Parameters
-
cons linear constraint
Definition at line 13121 of file cons_linear.c.
References NULL, and SCIPhashtableRetrieve().
◆ retrieveParallelConstraints()
|
static |
updates the hashtable such that out of all constraints in the hashtable that are detected to be parallel to *querycons, only one is kept in the hashtable and stored into *querycons, and all others are removed from the hashtable and stored in the given array
- Parameters
-
hashtable hashtable containing linear constraints querycons pointer to linear constraint used to look for duplicates in the hash table; upon return will contain the constraint that should be kept parallelconss array to return constraints that are parallel to the given; these constraints where removed from the hashtable nparallelconss pointer to return number of parallel constraints
Definition at line 13140 of file cons_linear.c.
◆ detectRedundantConstraints()
|
static |
compares each constraint with all other constraints for possible redundancy and removes or changes constraint accordingly; in contrast to preprocessConstraintPairs(), it uses a hash table
- Parameters
-
scip SCIP data structure blkmem block memory conss constraint set nconss number of constraints in constraint set firstchange pointer to store first changed constraint cutoff pointer to store TRUE, if a cutoff was found ndelconss pointer to count number of deleted constraints nchgsides pointer to count number of changed left/right hand sides
Definition at line 13201 of file cons_linear.c.
◆ preprocessConstraintPairs()
|
static |
compares constraint with all prior constraints for possible redundancy or aggregation, and removes or changes constraint accordingly
- Parameters
-
scip SCIP data structure conss constraint set firstchange first constraint that changed since last pair preprocessing round chkind index of constraint to check against all prior indices upto startind maxaggrnormscale maximal allowed relative gain in maximum norm for constraint aggregation cutoff pointer to store TRUE, if a cutoff was found ndelconss pointer to count number of deleted constraints nchgsides pointer to count number of changed left/right hand sides nchgcoefs pointer to count number of changed coefficients
Definition at line 13395 of file cons_linear.c.
◆ presolStuffing()
|
static |
do stuffing presolving on a single constraint
- Parameters
-
scip SCIP data structure cons linear constraint singletonstuffing should stuffing of singleton continuous variables be performed? singlevarstuffing should single variable stuffing be performed, which tries to fulfill constraints using the cheapest variable? cutoff pointer to store TRUE, if a cutoff was found nfixedvars pointer to count the total number of fixed variables nchgbds pointer to count the total number of tightened bounds
Definition at line 13999 of file cons_linear.c.
◆ fullDualPresolve()
|
static |
applies full dual presolving on variables that only appear in linear constraints
- Parameters
-
scip SCIP data structure conss constraint set nconss number of constraints cutoff pointer to store TRUE, if a cutoff was found nchgbds pointer to count the number of bound changes
Definition at line 14590 of file cons_linear.c.
◆ enforceConstraint()
|
static |
helper function to enforce constraints
- Parameters
-
scip SCIP data structure conshdlr constraint handler conss constraints to process nconss number of constraints nusefulconss number of useful (non-obsolete) constraints to process sol solution to enforce (NULL for the LP solution) result pointer to store the result of the enforcing call
Definition at line 15053 of file cons_linear.c.
◆ SCIP_DECL_CONSHDLRCOPY()
|
static |
copy method for constraint handler plugins (called when SCIP copies plugins)
Definition at line 15129 of file cons_linear.c.
References CONSHDLR_NAME, conshdlrdataFree(), NULL, SCIP_OKAY, SCIPconshdlrGetData(), SCIPconshdlrGetName(), and SCIPconshdlrSetData().
◆ SCIP_DECL_CONSFREE()
|
static |
destructor of constraint handler to free constraint handler data (called when SCIP is exiting)
Definition at line 15145 of file cons_linear.c.
References NULL, and SCIPconshdlrGetData().
◆ SCIP_DECL_CONSINIT()
|
static |
initialization method of constraint handler (called after problem was transformed)
Definition at line 15167 of file cons_linear.c.
◆ SCIP_DECL_CONSEXIT()
|
static |
deinitialization method of constraint handler (called before transformed problem is freed)
Definition at line 15193 of file cons_linear.c.
◆ isRangedRow()
is constraint ranged row, i.e., -inf < lhs < rhs < inf?
- Parameters
-
scip SCIP data structure lhs left hand side rhs right hand side
Definition at line 15226 of file cons_linear.c.
References NULL, SCIPisInfinity(), SCIPisIntegral(), and SCIPisNegative().
◆ isFiniteNonnegativeIntegral()
is constraint ranged row, i.e., -inf < lhs < rhs < inf?
- Parameters
-
scip SCIP data structure x value
Definition at line 15239 of file cons_linear.c.
References CONSHDLR_NAME, NULL, SCIP_STAGE_PROBLEM, SCIPfindConshdlr(), and SCIPgetStage().
◆ SCIP_DECL_CONSEXITPRE()
|
static |
presolving deinitialization method of constraint handler (called after presolving has been finished)
Definition at line 15597 of file cons_linear.c.
◆ SCIP_DECL_CONSEXITSOL()
|
static |
solving process deinitialization method of constraint handler (called before branch and bound process data is freed)
Definition at line 15675 of file cons_linear.c.
References CONSHDLR_NAME, NULL, SCIP_CALL, SCIP_DECL_CONSDEACTIVE(), SCIP_OKAY, SCIP_VERBLEVEL_HIGH, SCIPconsGetData(), SCIPconshdlrGetName(), SCIPconsIsDeleted(), SCIPconvertCutsToConss(), SCIPverbMessage(), and TRUE.
◆ SCIP_DECL_CONSDEACTIVE()
|
static |
constraint deactivation notification method of constraint handler
Definition at line 15722 of file cons_linear.c.
Referenced by SCIP_DECL_CONSEXITSOL().
◆ SCIP_DECL_CONSDELETE()
|
static |
frees specific constraint data
Definition at line 15759 of file cons_linear.c.
◆ SCIP_DECL_CONSTRANS()
|
static |
transforms constraint data into data belonging to the transformed problem
Definition at line 15786 of file cons_linear.c.
◆ SCIP_DECL_CONSINITLP()
|
static |
LP initialization method of constraint handler (called before the initial LP relaxation at a node is solved)
Definition at line 15830 of file cons_linear.c.
◆ SCIP_DECL_CONSSEPALP()
|
static |
separation method of constraint handler for LP solutions
Definition at line 15851 of file cons_linear.c.
◆ SCIP_DECL_CONSSEPASOL()
|
static |
separation method of constraint handler for arbitrary primal solutions
Definition at line 15922 of file cons_linear.c.
◆ SCIP_DECL_CONSENFOLP()
|
static |
constraint enforcing method of constraint handler for LP solutions
Definition at line 15980 of file cons_linear.c.
◆ SCIP_DECL_CONSENFORELAX()
|
static |
constraint enforcing method of constraint handler for relaxation solutions
Definition at line 15989 of file cons_linear.c.
◆ SCIP_DECL_CONSENFOPS()
|
static |
constraint enforcing method of constraint handler for pseudo solutions
Definition at line 15998 of file cons_linear.c.
◆ SCIP_DECL_CONSCHECK()
|
static |
feasibility check method of constraint handler for integral solutions
Definition at line 16046 of file cons_linear.c.
References checkCons(), consdataGetActivity(), CONSHDLR_NAME, consPrintConsSol(), FALSE, NULL, SCIP_Bool, SCIP_CALL, SCIP_DECL_CONSPROP(), SCIP_INFEASIBLE, SCIP_INVALID, SCIP_OKAY, SCIP_Real, SCIPconsGetData(), SCIPconshdlrGetData(), SCIPconshdlrGetName(), SCIPinfoMessage(), SCIPisFeasGT(), and SCIPisFeasLT().
◆ SCIP_DECL_CONSPROP()
|
static |
domain propagation method of constraint handler
Definition at line 16105 of file cons_linear.c.
References FALSE, propagateCons(), SCIP_Bool, SCIP_CALL, SCIP_CUTOFF, SCIP_DECL_CONSPRESOL(), SCIP_DIDNOTFIND, SCIP_OKAY, SCIP_Real, SCIP_REDUCEDDOM, SCIPconshdlrGetPropFreq(), SCIPgetDepth(), SCIPinRepropagation(), and SCIPunmarkConsPropagate().
Referenced by SCIP_DECL_CONSCHECK().
◆ SCIP_DECL_CONSPRESOL()
|
static |
presolving method of constraint handler
Definition at line 16176 of file cons_linear.c.
Referenced by SCIP_DECL_CONSPROP().
◆ SCIP_DECL_CONSRESPROP()
|
static |
propagation conflict resolving method of constraint handler
Definition at line 16688 of file cons_linear.c.
◆ SCIP_DECL_CONSLOCK()
|
static |
variable rounding lock method of constraint handler
Definition at line 16702 of file cons_linear.c.
References NULL, performVarDeletions(), SCIP_CALL, SCIP_DECL_CONSDELVARS(), SCIP_DECL_CONSPRINT(), SCIP_OKAY, SCIPaddVarLocksType(), and SCIPisPositive().
◆ SCIP_DECL_CONSDELVARS()
|
static |
variable deletion method of constraint handler
Definition at line 16750 of file cons_linear.c.
References consdataPrint(), NULL, SCIP_CALL, SCIP_DECL_CONSCOPY(), SCIP_OKAY, SCIP_Real, and SCIPconsGetData().
Referenced by SCIP_DECL_CONSLOCK().
◆ SCIP_DECL_CONSPRINT()
|
static |
constraint display method of constraint handler
Definition at line 16766 of file cons_linear.c.
Referenced by SCIP_DECL_CONSLOCK().
◆ SCIP_DECL_CONSCOPY()
|
static |
constraint copying method of constraint handler
Definition at line 16779 of file cons_linear.c.
Referenced by SCIP_DECL_CONSDELVARS().
◆ findOperators()
|
static |
find operators '<=', '==', '>=', [free] in input string and return those places
There should only be one operator, except for ranged rows for which exactly two operators '<=' must be present.
- Parameters
-
str null terminated input string firstoperator pointer to store the string starting at the first operator secondoperator pointer to store the string starting at the second operator success pointer to store if the line contains a valid operator order
Definition at line 16815 of file cons_linear.c.
References FALSE, NULL, SCIP_Bool, SCIP_DECL_CONSPARSE(), SCIP_Real, SCIPerrorMessage, and TRUE.
◆ SCIP_DECL_CONSPARSE()
|
static |
constraint parsing method of constraint handler
Definition at line 16914 of file cons_linear.c.
Referenced by findOperators().
◆ SCIP_DECL_CONSGETVARS()
|
static |
constraint method of constraint handler which returns the variables (if possible)
Definition at line 17073 of file cons_linear.c.
References NULL, SCIP_OKAY, SCIPconsGetData(), and TRUE.
◆ SCIP_DECL_CONSGETNVARS()
|
static |
! [Callback for the number of variables] constraint method of constraint handler which returns the number of variables (if possible)
Definition at line 17096 of file cons_linear.c.
References EVENTHDLR_NAME, NULL, SCIPconsGetData(), and SCIPeventhdlrGetName().
◆ SCIP_DECL_EVENTEXEC()
|
static |
! [Callback for the number of variables] execution method of event handler
Definition at line 17116 of file cons_linear.c.
◆ SCIP_DECL_CONFLICTEXEC()
|
static |
conflict processing method of conflict handler (called when conflict was found)
Definition at line 17312 of file cons_linear.c.
◆ SCIP_DECL_QUADCONSUPGD()
|
static |
upgrades quadratic constraints with only and at least one linear variables into a linear constraint
Definition at line 17400 of file cons_linear.c.
References NULL, SCIP_CALL, SCIP_DECL_NONLINCONSUPGD(), SCIP_OKAY, SCIPconsGetData(), SCIPconsGetName(), SCIPconsIsChecked(), SCIPconsIsDynamic(), SCIPconsIsEnforced(), SCIPconsIsInitial(), SCIPconsIsLocal(), SCIPconsIsModifiable(), SCIPconsIsPropagated(), SCIPconsIsRemovable(), SCIPconsIsSeparated(), SCIPconsIsStickingAtNode(), SCIPcreateConsLinear(), SCIPdebugMsg, SCIPdebugPrintCons, SCIPgetCoefsLinearVarsQuadratic(), SCIPgetExprgraphNodeNonlinear(), SCIPgetLhsQuadratic(), SCIPgetLinearVarsQuadratic(), SCIPgetNLinearVarsNonlinear(), SCIPgetNLinearVarsQuadratic(), SCIPgetRhsQuadratic(), and TRUE.
◆ SCIP_DECL_NONLINCONSUPGD()
|
static |
tries to upgrade a nonlinear constraint into a linear constraint
Definition at line 17451 of file cons_linear.c.
References CONFLICTHDLR_DESC, CONFLICTHDLR_NAME, CONFLICTHDLR_PRIORITY, EVENTHDLR_DESC, EVENTHDLR_NAME, NULL, SCIP_CALL, SCIP_OKAY, SCIPconsGetData(), SCIPconsGetName(), SCIPconsIsChecked(), SCIPconsIsDynamic(), SCIPconsIsEnforced(), SCIPconsIsInitial(), SCIPconsIsLocal(), SCIPconsIsModifiable(), SCIPconsIsPropagated(), SCIPconsIsRemovable(), SCIPconsIsSeparated(), SCIPconsIsStickingAtNode(), SCIPcreateConsLinear(), SCIPdebugMsg, SCIPdebugPrintCons, SCIPgetLhsNonlinear(), SCIPgetLinearCoefsNonlinear(), SCIPgetLinearVarsNonlinear(), SCIPgetNLinearVarsNonlinear(), SCIPgetRhsNonlinear(), SCIPincludeConflicthdlrBasic(), SCIPincludeConshdlrLinear(), SCIPincludeEventhdlrBasic(), and TRUE.
Referenced by SCIP_DECL_QUADCONSUPGD().