Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class LevelZeroEquality
Note: This documentation is automatically generated.
This assumes target = SUM_i coeffs[i] * vars[i], and detects that the target
must be of the form (a*X + b).
This propagator is quite specific and runs only at level zero. For now, this
is mainly used for the objective variable. As we fix terms with high
objective coefficient, it is possible the only terms left have a common
divisor. This close app2-2.mps in less than a second instead of running
forever to prove the optimal (in single thread).
| Method |
LevelZeroEquality | Arguments: IntegerVariable target,
const std::vector<IntegerVariable>& vars,
const std::vector<IntegerValue>& coeffs, Model* model |
Propagate | Return type: bool |
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["The `LevelZeroEquality` class in C++ detects if a target variable can be expressed as `(a*X + b)`, where the target is a sum of coefficients multiplied by variables. It operates at level zero and primarily focuses on the objective variable. Its purpose is to identify common divisors among remaining terms as high objective coefficient terms are fixed, enabling faster optimization, as shown by the `app2-2.mps` example. Key methods include the constructor `LevelZeroEquality` and `Propagate` for checking.\n"],null,[]]
