TaskModelIntLB GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const BoolVarArgs &x, IntRelType irt, int c, IntConLevel icl=ICL_DEF) linear Home home const BoolVarArgs & x IntRelType irt int c IntConLevel icl ICL_DEF Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} c$. GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const BoolVarArgs &x, IntRelType irt, int c, Reify r, IntConLevel icl=ICL_DEF) linear Home home const BoolVarArgs & x IntRelType irt int c Reify r IntConLevel icl ICL_DEF Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\right)\equiv r$. GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const BoolVarArgs &x, IntRelType irt, IntVar y, IntConLevel icl=ICL_DEF) linear Home home const BoolVarArgs & x IntRelType irt IntVar y IntConLevel icl ICL_DEF Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} y$. GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const BoolVarArgs &x, IntRelType irt, IntVar y, Reify r, IntConLevel icl=ICL_DEF) linear Home home const BoolVarArgs & x IntRelType irt IntVar y Reify r IntConLevel icl ICL_DEF Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\right)\equiv r$. GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, int c, IntConLevel icl=ICL_DEF) linear Home home const IntArgs & a const BoolVarArgs & x IntRelType irt int c IntConLevel icl ICL_DEF Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, int c, Reify r, IntConLevel icl=ICL_DEF) linear Home home const IntArgs & a const BoolVarArgs & x IntRelType irt int c Reify r IntConLevel icl ICL_DEF Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\right)\equiv r$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, IntVar y, IntConLevel icl=ICL_DEF) linear Home home const IntArgs & a const BoolVarArgs & x IntRelType irt IntVar y IntConLevel icl ICL_DEF Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, IntVar y, Reify r, IntConLevel icl=ICL_DEF) linear Home home const IntArgs & a const BoolVarArgs & x IntRelType irt IntVar y Reify r IntConLevel icl ICL_DEF Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\right)\equiv r$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. All variants for linear constraints over Boolean variables share the following properties: Bounds consistency (over the real numbers) is supported for all constraints (actually, for disequlities always domain consistency is used as it is cheaper).Variables occurring multiply in the argument arrays are replaced by a single occurrence: for example, $ax+bx$ becomes $(a+b)x$.If in the above simplification the value for $(a+b)$ (or for $a$ and $b$) exceeds the limits for integers as defined in Int::Limits, an exception of type Int::OutOfLimits is thrown.Assume the constraint $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c$. If $|c|+\sum_{i=0}^{|x|-1}a_i\cdot x_i$ exceeds the limits for integers as defined in Int::Limits, an exception of type Int::OutOfLimits is thrown.In all other cases, the created propagators are accurate (that is, they will not silently overflow during propagation).