struct_var.h
Go to the documentation of this file.
31/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
75 SCIP_Real lpsolval; /**< sol val of var in last LP prior to bound change, or SCIP_INVALID if unknown */
100 unsigned int boundchgtype:2; /**< bound change type: branching decision or inferred bound change */
102 unsigned int inferboundtype:1; /**< type of bound for inference var (see inference data): lower or upper bound */
107/** bound change index representing the time of the bound change in path from root to current node */
123 unsigned int boundchgtype:2; /**< bound change type: branching decision or inferred bound change */
125 unsigned int inferboundtype:1; /**< type of bound for inference var (see inference data): lower or upper bound */
126 unsigned int redundant:1; /**< does the bound change info belong to a redundant bound change? */
209 SCIP_Real obj; /**< objective function value of variable (might be changed temporarily in probing mode)*/
210 SCIP_Real unchangedobj; /**< unchanged objective function value of variable (ignoring temporary changes in probing mode) */
213 SCIP_Real bestrootsol; /**< best primal solution of variable in root node, or zero, w.r.t. root LP value and root reduced cost */
214 SCIP_Real bestrootredcost; /**< best reduced costs of variable in root node, or zero, w.r.t. root LP value and root solution value */
215 SCIP_Real bestrootlpobjval; /**< best root LP objective value, or SCIP_INVALID, w.r.t. root solution value and root reduced cost */
216 SCIP_Real relaxsol; /**< primal solution of variable in current relaxation solution, or SCIP_INVALID */
218 SCIP_Real primsolavg; /**< weighted average of all values of variable in primal feasible solutions */
221 SCIP_Real conflictrelaxedlb; /**< maximal relaxed lower bound of variable in the current conflict (conflictrelaxedlb <= conflictlb) */
222 SCIP_Real conflictrelaxedub; /**< minimal relaxed upper bound of variable in the current conflict (conflictrelaxedub >= conflictub) */
223 SCIP_Real lazylb; /**< global lower bound that is ensured by constraints and has not to be added to the LP */
224 SCIP_Real lazyub; /**< global upper bound that is ensured by constraints and has not to be added to the LP */
232 SCIP_MULTAGGR multaggr; /**< multiple aggregation information (for multiple aggregated variables) */
238 SCIP_DECL_VARTRANS ((*vartrans)); /**< creates transformed user data by transforming original user data */
242 SCIP_VAR* negatedvar; /**< pointer to the variables negation: x' = lb + ub - x, or NULL if not created */
245 SCIP_IMPLICS* implics; /**< implications y >=/<= b following from x <= 0 and x >= 1 (x binary), or NULL if x is not binary */
247 SCIP_EVENTFILTER* eventfilter; /**< event filter for events concerning this variable; not for ORIGINAL vars */
248 SCIP_BDCHGINFO* lbchginfos; /**< bound change informations for lower bound changes from root to current node */
249 SCIP_BDCHGINFO* ubchginfos; /**< bound change informations for upper bound changes from root to current node */
252 SCIP_VALUEHISTORY* valuehistory; /**< branching and inference history information which are value based, or NULL if not used */
253 SCIP_Longint closestvblpcount; /**< LP count for which the closestvlbidx/closestvubidx entries are valid */
255 int probindex; /**< array position in problems vars array, or -1 if not assigned to a problem */
261 int nparentvars; /**< number of parent variables in aggregation tree (used slots of parentvars) */
263 int nlocksdown[NLOCKTYPES]; /**< array of variable locks for rounding down; if zero, rounding down is always feasible */
264 int nlocksup[NLOCKTYPES]; /**< array of variable locks for rounding up; if zero, rounding up is always feasible */
275 unsigned int removable:1; /**< TRUE iff var's column is removable from the LP (due to aging or cleanup) */
281 unsigned int varstatus:3; /**< status of variable: original, loose, column, fixed, aggregated, multiaggregated, negated */
283 unsigned int branchdirection:2; /**< preferred branching direction of the variable (downwards, upwards, auto) */
284 unsigned int eventqueueimpl:1; /**< is an IMPLADDED event on this variable currently in the event queue? */
285 unsigned int delglobalstructs:1; /**< is variable marked to be removed from global structures (cliques etc.)? */
286 unsigned int relaxationonly:1; /**< TRUE if variable has been introduced only to define a relaxation */
common defines and data types used in all packages of SCIP
Definition: struct_var.h:184
Definition: struct_var.h:109
Definition: struct_var.h:116
Definition: struct_var.h:92
union SCIP_BoundChg::@21 data
Definition: struct_implics.h:90
Definition: struct_lp.h:136
Definition: struct_cons.h:47
Definition: struct_var.h:139
Definition: struct_var.h:131
Definition: struct_var.h:149
Definition: struct_var.h:169
Definition: struct_event.h:189
Definition: struct_history.h:46
Definition: struct_var.h:66
Definition: struct_var.h:52
Definition: struct_var.h:59
Definition: struct_implics.h:63
Definition: struct_var.h:192
Definition: struct_var.h:202
Definition: struct_var.h:177
Definition: struct_prop.h:47
Definition: struct_implics.h:49
Definition: struct_history.h:67
Definition: struct_var.h:208
SCIP_DECL_VARDELTRANS((*vardeltrans))
union SCIP_Var::@22 data
SCIP_DECL_VARTRANS((*vartrans))
SCIP_DECL_VARDELORIG((*vardelorig))
SCIP_DECL_VARCOPY((*varcopy))
Definition: struct_scip.h:70
type definitions for constraints and constraint handlers
type definitions for managing events
type definitions for branching and inference history
type definitions for implications, variable bounds, and cliques
type definitions for LP management
type definitions for propagators
type definitions for problem variables
Definition: struct_var.h:161