prop_genvbounds.h
Go to the documentation of this file.
26 * where \f$c\f$ is either 1 or -1 and \f$primal\_bound\f$ is an upper bound on the optimal objective 28 * used for providing bounds on the LHS's variable \f$x_i\f$. If the above inequality is valid, the 40 * primal bound causes an improvement of the provided bound. Similarly, if \f$a_j > 0\f$ (\f$< 0\f$), a 41 * tightened lower (upper) bound of a variable \f$x_j\f$ also yields a better bound for \f$x_i\f$. 45 * generalized variable bound B if the left-hand side variable of A appears in the right-hand side 52 * Both global and local propagation is applied: If the primal bound improves, generalized variable bounds with a 53 * nonzero coefficient d are enforced in order to tighten global bounds using the global variable bounds for computing 54 * the minactivity. Independently, the genvbounds propagator catches events SCIP_EVENTTYPE_LBTIGHTENED and 55 * SCIP_EVENTTYPE_UBTIGHTENED, i.e., locally tightened bounds of variables that occur in the right-hand sides of 59 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ 71 /** adds a generalized variable bound to the genvbounds propagator; if there is already a genvbound for the bound
SCIP_RETCODE SCIPgenVBoundAdd(SCIP *scip, SCIP_PROP *genvboundprop, SCIP_VAR **vars, SCIP_VAR *var, SCIP_Real *coefs, int ncoefs, SCIP_Real coefprimalbound, SCIP_Real constant, SCIP_BOUNDTYPE boundtype) SCIP_RETCODE SCIPincludePropGenvbounds(SCIP *scip) Definition: objbranchrule.h:33 SCIP callable library. |