struct_var.h
Go to the documentation of this file.
22 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
66 SCIP_Real lpsolval; /**< sol val of var in last LP prior to bound change, or SCIP_INVALID if unknown */
91 unsigned int boundchgtype:2; /**< bound change type: branching decision or infered bound change */
93 unsigned int inferboundtype:1; /**< type of bound for inference var (see inference data): lower or upper bound */
98 /** bound change index representing the time of the bound change in path from root to current node */
114 unsigned int boundchgtype:2; /**< bound change type: branching decision or infered bound change */
116 unsigned int inferboundtype:1; /**< type of bound for inference var (see inference data): lower or upper bound */
117 unsigned int redundant:1; /**< does the bound change info belong to a redundant bound change? */
203 SCIP_Real obj; /**< objective function value of variable (might be changed temporarily in probing mode)*/
204 SCIP_Real unchangedobj; /**< unchanged objective function value of variable (ignoring temporary changes in probing mode) */
207 SCIP_Real bestrootsol; /**< best primal solution of variable in root node, or zero, w.r.t. root LP value and root reduced cost */
208 SCIP_Real bestrootredcost; /**< best reduced costs of variable in root node, or zero, w.r.t. root LP value and root solution value */
209 SCIP_Real bestrootlpobjval; /**< best root LP objective value, or SCIP_INVALID, w.r.t. root solution value and root reduced cost */
210 SCIP_Real relaxsol; /**< primal solution of variable in current relaxation solution, or SCIP_INVALID */
212 SCIP_Real primsolavg; /**< weighted average of all values of variable in primal feasible solutions */
215 SCIP_Real conflictrelaxedlb; /**< minimal relaxed lower bound of variable in the current conflict (conflictrelqxlb <= conflictlb) */
216 SCIP_Real conflictrelaxedub; /**< minimal release upper bound of variable in the current conflict (conflictrelqxlb <= conflictlb) */
217 SCIP_Real lazylb; /**< global lower bound that is ensured by constraints and has not to be added to the LP */
218 SCIP_Real lazyub; /**< global upper bound that is ensured by constraints and has not to be added to the LP */
226 SCIP_MULTAGGR multaggr; /**< multiple aggregation information (for multiple aggregated variables) */
232 SCIP_DECL_VARTRANS ((*vartrans)); /**< creates transformed user data by transforming original user data */
236 SCIP_VAR* negatedvar; /**< pointer to the variables negation: x' = lb + ub - x, or NULL if not created */
239 SCIP_IMPLICS* implics; /**< implications y >=/<= b following from x <= 0 and x >= 1 (x binary), or NULL if x is not binary */
241 SCIP_EVENTFILTER* eventfilter; /**< event filter for events concerning this variable; not for ORIGINAL vars */
242 SCIP_BDCHGINFO* lbchginfos; /**< bound change informations for lower bound changes from root to current node */
243 SCIP_BDCHGINFO* ubchginfos; /**< bound change informations for upper bound changes from root to current node */
246 SCIP_VALUEHISTORY* valuehistory; /**< branching and inference history information which are value based, or NULL if not used */
247 SCIP_Longint closestvblpcount; /**< LP count for which the closestvlbidx/closestvubidx entries are valid */
249 int probindex; /**< array position in problems vars array, or -1 if not assigned to a problem */
255 int nparentvars; /**< number of parent variables in aggregation tree (used slots of parentvars) */
257 int nlocksdown[NLOCKTYPES]; /**< array of variable locks for rounding down; if zero, rounding down is always feasible */
258 int nlocksup[NLOCKTYPES]; /**< array of variable locks for rounding up; if zero, rounding up is always feasible */
269 unsigned int removable:1; /**< TRUE iff var's column is removable from the LP (due to aging or cleanup) */
274 unsigned int varstatus:3; /**< status of variable: original, loose, column, fixed, aggregated, multiaggregated, negated */
276 unsigned int branchdirection:2; /**< preferred branching direction of the variable (downwards, upwards, auto) */
277 unsigned int eventqueueimpl:1; /**< is an IMPLADDED event on this variable currently in the event queue? */
278 unsigned int delglobalstructs:1; /**< is variable marked to be removed from global structures (cliques etc.)? */
Definition: struct_implics.h:39
Definition: struct_var.h:99
type definitions for implications, variable bounds, and cliques
Definition: struct_scip.h:58
Definition: struct_var.h:151
Definition: struct_var.h:198
Definition: struct_var.h:82
Definition: struct_event.h:170
Definition: struct_history.h:51
Definition: struct_lp.h:126
type definitions for LP management
Definition: struct_var.h:121
Definition: struct_var.h:174
Definition: struct_cons.h:37
Definition: struct_var.h:159
Definition: struct_var.h:129
Definition: struct_history.h:36
type definitions for problem variables
Definition: struct_implics.h:80
type definitions for managing events
Definition: struct_prop.h:37
Definition: struct_var.h:106
Definition: struct_var.h:56
Definition: struct_var.h:49
Definition: struct_var.h:192
Definition: struct_var.h:42
type definitions for propagators
Definition: struct_var.h:182
Definition: struct_var.h:167
type definitions for branching and inference history
Definition: struct_var.h:139
common defines and data types used in all packages of SCIP
Definition: struct_implics.h:53
type definitions for constraints and constraint handlers