prop_obbt.h
Go to the documentation of this file.
34 * where \f$P'\f$ is the current LP relaxation restricted by the primal cutoff constraint \f$c^T x <= z\f$, \f$z\f$ the
35 * current cutoff bound. Trivially, the optimal objective value of this LP provides a valid lower/upper bound on
38 * Since solving LPs may be expensive, the propagator inspects solutions \f$x \in P'\f$ and does not run for variable
39 * bounds which are tight at \f$x\f$: First, we check SCIP's last LP relaxation solution. Second, we solve a sequence of
40 * filtering LP's \f$\min / \max \, \{ \sum w_i \, x_i \mid x \in P' \}\f$ in order to push several variables towards
41 * one of their bounds in one LP solve. Third, we inspect all solutions of the auxiliary LPs solved along the way.
45 * After we learned a better variable bound the propagator tries to separate the solution of the current OBBT LP with
46 * the refined outer approximation in order to strengthen the learned bound. Additionally, we trigger a
49 * Additionally, the propagator uses the dual solution of the auxiliary LPs to construct globally valid generalized
53 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43