|
public methods for problem variables
- Author
- Tobias Achterberg
Definition in file pub_var.h.
Go to the source code of this file.
|
int | SCIPvarGetNLocksDown (SCIP_VAR *var) |
|
int | SCIPvarGetNLocksUp (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarMayRoundDown (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarMayRoundUp (SCIP_VAR *var) |
|
int | SCIPvarCompareActiveAndNegated (SCIP_VAR *var1, SCIP_VAR *var2) |
|
| SCIP_DECL_SORTPTRCOMP (SCIPvarCompActiveAndNegated) |
|
int | SCIPvarCompare (SCIP_VAR *var1, SCIP_VAR *var2) |
|
| SCIP_DECL_SORTPTRCOMP (SCIPvarComp) |
|
| SCIP_DECL_SORTPTRCOMP (SCIPvarCompObj) |
|
| SCIP_DECL_HASHGETKEY (SCIPvarGetHashkey) |
|
| SCIP_DECL_HASHKEYEQ (SCIPvarIsHashkeyEq) |
|
| SCIP_DECL_HASHKEYVAL (SCIPvarGetHashkeyVal) |
|
void | SCIPvarsGetProbvar (SCIP_VAR **vars, int nvars) |
|
SCIP_VAR * | SCIPvarGetProbvar (SCIP_VAR *var) |
|
SCIP_RETCODE | SCIPvarsGetProbvarBinary (SCIP_VAR ***vars, SCIP_Bool **negatedarr, int nvars) |
|
SCIP_RETCODE | SCIPvarGetProbvarBinary (SCIP_VAR **var, SCIP_Bool *negated) |
|
SCIP_RETCODE | SCIPvarGetProbvarBound (SCIP_VAR **var, SCIP_Real *bound, SCIP_BOUNDTYPE *boundtype) |
|
SCIP_RETCODE | SCIPvarGetProbvarHole (SCIP_VAR **var, SCIP_Real *left, SCIP_Real *right) |
|
SCIP_RETCODE | SCIPvarGetOrigvarSum (SCIP_VAR **var, SCIP_Real *scalar, SCIP_Real *constant) |
|
SCIP_Bool | SCIPvarIsTransformedOrigvar (SCIP_VAR *var) |
|
SCIP_Longint | SCIPvarGetNBranchings (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Longint | SCIPvarGetNBranchingsCurrentRun (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Real | SCIPvarGetInferenceSum (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Real | SCIPvarGetInferenceSumCurrentRun (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Real | SCIPvarGetCutoffSum (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Real | SCIPvarGetCutoffSumCurrentRun (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Real | SCIPvarGetAvgBranchdepth (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Real | SCIPvarGetAvgBranchdepthCurrentRun (SCIP_VAR *var, SCIP_BRANCHDIR dir) |
|
SCIP_Bool | SCIPvarHasImplic (SCIP_VAR *var, SCIP_Bool varfixing, SCIP_VAR *implvar, SCIP_BOUNDTYPE impltype) |
|
SCIP_Bool | SCIPvarHasBinaryImplic (SCIP_VAR *var, SCIP_Bool varfixing, SCIP_VAR *implvar, SCIP_Bool implvarfixing) |
|
SCIP_Bool | SCIPvarsHaveCommonClique (SCIP_VAR *var1, SCIP_Bool value1, SCIP_VAR *var2, SCIP_Bool value2, SCIP_Bool regardimplics) |
|
SCIP_RETCODE | SCIPvarGetAggregatedObj (SCIP_VAR *var, SCIP_Real *aggrobj) |
|
SCIP_RETCODE | SCIPvarSetInitial (SCIP_VAR *var, SCIP_Bool initial) |
|
SCIP_RETCODE | SCIPvarSetRemovable (SCIP_VAR *var, SCIP_Bool removable) |
|
const char * | SCIPvarGetName (SCIP_VAR *var) |
|
int | SCIPvarGetNUses (SCIP_VAR *var) |
|
SCIP_VARDATA * | SCIPvarGetData (SCIP_VAR *var) |
|
void | SCIPvarSetData (SCIP_VAR *var, SCIP_VARDATA *vardata) |
|
void | SCIPvarSetDelorigData (SCIP_VAR *var, SCIP_DECL_VARDELORIG((*vardelorig))) |
|
void | SCIPvarSetTransData (SCIP_VAR *var, SCIP_DECL_VARTRANS((*vartrans))) |
|
void | SCIPvarSetDeltransData (SCIP_VAR *var, SCIP_DECL_VARDELTRANS((*vardeltrans))) |
|
void | SCIPvarSetCopyData (SCIP_VAR *var, SCIP_DECL_VARCOPY((*varcopy))) |
|
SCIP_VARSTATUS | SCIPvarGetStatus (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsOriginal (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsTransformed (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsNegated (SCIP_VAR *var) |
|
SCIP_VARTYPE | SCIPvarGetType (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsBinary (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsIntegral (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsInitial (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsRemovable (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsDeleted (SCIP_VAR *var) |
|
void | SCIPvarMarkDeletable (SCIP_VAR *var) |
|
void | SCIPvarMarkNotDeletable (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsDeletable (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsActive (SCIP_VAR *var) |
|
int | SCIPvarGetIndex (SCIP_VAR *var) |
|
int | SCIPvarGetProbindex (SCIP_VAR *var) |
|
SCIP_VAR * | SCIPvarGetTransVar (SCIP_VAR *var) |
|
SCIP_COL * | SCIPvarGetCol (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarIsInLP (SCIP_VAR *var) |
|
SCIP_VAR * | SCIPvarGetAggrVar (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetAggrScalar (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetAggrConstant (SCIP_VAR *var) |
|
int | SCIPvarGetMultaggrNVars (SCIP_VAR *var) |
|
SCIP_VAR ** | SCIPvarGetMultaggrVars (SCIP_VAR *var) |
|
SCIP_Real * | SCIPvarGetMultaggrScalars (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetMultaggrConstant (SCIP_VAR *var) |
|
SCIP_VAR * | SCIPvarGetNegatedVar (SCIP_VAR *var) |
|
SCIP_VAR * | SCIPvarGetNegationVar (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetNegationConstant (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetObj (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetUnchangedObj (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetLbOriginal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetUbOriginal (SCIP_VAR *var) |
|
SCIP_HOLELIST * | SCIPvarGetHolelistOriginal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetLbGlobal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetUbGlobal (SCIP_VAR *var) |
|
SCIP_HOLELIST * | SCIPvarGetHolelistGlobal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetBestBoundGlobal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetWorstBoundGlobal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetLbLocal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetUbLocal (SCIP_VAR *var) |
|
SCIP_HOLELIST * | SCIPvarGetHolelistLocal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetBestBoundLocal (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetWorstBoundLocal (SCIP_VAR *var) |
|
SCIP_BOUNDTYPE | SCIPvarGetBestBoundType (SCIP_VAR *var) |
|
SCIP_BOUNDTYPE | SCIPvarGetWorstBoundType (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetLbLazy (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetUbLazy (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetBranchFactor (SCIP_VAR *var) |
|
int | SCIPvarGetBranchPriority (SCIP_VAR *var) |
|
SCIP_BRANCHDIR | SCIPvarGetBranchDirection (SCIP_VAR *var) |
|
int | SCIPvarGetNVlbs (SCIP_VAR *var) |
|
SCIP_VAR ** | SCIPvarGetVlbVars (SCIP_VAR *var) |
|
SCIP_Real * | SCIPvarGetVlbCoefs (SCIP_VAR *var) |
|
SCIP_Real * | SCIPvarGetVlbConstants (SCIP_VAR *var) |
|
int | SCIPvarGetNVubs (SCIP_VAR *var) |
|
SCIP_VAR ** | SCIPvarGetVubVars (SCIP_VAR *var) |
|
SCIP_Real * | SCIPvarGetVubCoefs (SCIP_VAR *var) |
|
SCIP_Real * | SCIPvarGetVubConstants (SCIP_VAR *var) |
|
int | SCIPvarGetNImpls (SCIP_VAR *var, SCIP_Bool varfixing) |
|
SCIP_VAR ** | SCIPvarGetImplVars (SCIP_VAR *var, SCIP_Bool varfixing) |
|
SCIP_BOUNDTYPE * | SCIPvarGetImplTypes (SCIP_VAR *var, SCIP_Bool varfixing) |
|
SCIP_Real * | SCIPvarGetImplBounds (SCIP_VAR *var, SCIP_Bool varfixing) |
|
int * | SCIPvarGetImplIds (SCIP_VAR *var, SCIP_Bool varfixing) |
|
int | SCIPvarGetNCliques (SCIP_VAR *var, SCIP_Bool varfixing) |
|
SCIP_CLIQUE ** | SCIPvarGetCliques (SCIP_VAR *var, SCIP_Bool varfixing) |
|
SCIP_Real | SCIPvarGetLPSol (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetNLPSol (SCIP_VAR *var) |
|
SCIP_BDCHGINFO * | SCIPvarGetBdchgInfoLb (SCIP_VAR *var, int pos) |
|
int | SCIPvarGetNBdchgInfosLb (SCIP_VAR *var) |
|
SCIP_BDCHGINFO * | SCIPvarGetBdchgInfoUb (SCIP_VAR *var, int pos) |
|
int | SCIPvarGetNBdchgInfosUb (SCIP_VAR *var) |
|
SCIP_VALUEHISTORY * | SCIPvarGetValuehistory (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetLPSol_rec (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetNLPSol_rec (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetPseudoSol (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetSol (SCIP_VAR *var, SCIP_Bool getlpval) |
|
SCIP_Real | SCIPvarGetRootSol (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetBestRootSol (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetBestRootRedcost (SCIP_VAR *var) |
|
SCIP_Real | SCIPvarGetBestRootLPObjval (SCIP_VAR *var) |
|
void | SCIPvarSetBestRootSol (SCIP_VAR *var, SCIP_Real rootsol, SCIP_Real rootredcost, SCIP_Real rootlpobjval) |
|
SCIP_Real | SCIPvarGetAvgSol (SCIP_VAR *var) |
|
SCIP_BDCHGINFO * | SCIPvarGetLbchgInfo (SCIP_VAR *var, SCIP_BDCHGIDX *bdchgidx, SCIP_Bool after) |
|
SCIP_BDCHGINFO * | SCIPvarGetUbchgInfo (SCIP_VAR *var, SCIP_BDCHGIDX *bdchgidx, SCIP_Bool after) |
|
SCIP_BDCHGINFO * | SCIPvarGetBdchgInfo (SCIP_VAR *var, SCIP_BOUNDTYPE boundtype, SCIP_BDCHGIDX *bdchgidx, SCIP_Bool after) |
|
SCIP_Real | SCIPvarGetLbAtIndex (SCIP_VAR *var, SCIP_BDCHGIDX *bdchgidx, SCIP_Bool after) |
|
SCIP_Real | SCIPvarGetUbAtIndex (SCIP_VAR *var, SCIP_BDCHGIDX *bdchgidx, SCIP_Bool after) |
|
SCIP_Real | SCIPvarGetBdAtIndex (SCIP_VAR *var, SCIP_BOUNDTYPE boundtype, SCIP_BDCHGIDX *bdchgidx, SCIP_Bool after) |
|
SCIP_Bool | SCIPvarWasFixedAtIndex (SCIP_VAR *var, SCIP_BDCHGIDX *bdchgidx, SCIP_Bool after) |
|
SCIP_BDCHGIDX * | SCIPvarGetLastBdchgIndex (SCIP_VAR *var) |
|
int | SCIPvarGetLastBdchgDepth (SCIP_VAR *var) |
|
SCIP_Bool | SCIPvarWasFixedEarlier (SCIP_VAR *var1, SCIP_VAR *var2) |
|
SCIP_Bool | SCIPbdchgidxIsEarlier (SCIP_BDCHGIDX *bdchgidx1, SCIP_BDCHGIDX *bdchgidx2) |
|
SCIP_Bool | SCIPbdchgidxIsEarlierNonNull (SCIP_BDCHGIDX *bdchgidx1, SCIP_BDCHGIDX *bdchgidx2) |
|
SCIP_Real | SCIPbdchginfoGetOldbound (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_Real | SCIPbdchginfoGetNewbound (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_VAR * | SCIPbdchginfoGetVar (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_BOUNDCHGTYPE | SCIPbdchginfoGetChgtype (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_BOUNDTYPE | SCIPbdchginfoGetBoundtype (SCIP_BDCHGINFO *bdchginfo) |
|
int | SCIPbdchginfoGetDepth (SCIP_BDCHGINFO *bdchginfo) |
|
int | SCIPbdchginfoGetPos (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_BDCHGIDX * | SCIPbdchginfoGetIdx (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_VAR * | SCIPbdchginfoGetInferVar (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_CONS * | SCIPbdchginfoGetInferCons (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_PROP * | SCIPbdchginfoGetInferProp (SCIP_BDCHGINFO *bdchginfo) |
|
int | SCIPbdchginfoGetInferInfo (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_BOUNDTYPE | SCIPbdchginfoGetInferBoundtype (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_Bool | SCIPbdchginfoIsRedundant (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_Bool | SCIPbdchginfoHasInferenceReason (SCIP_BDCHGINFO *bdchginfo) |
|
SCIP_Bool | SCIPbdchginfoIsTighter (SCIP_BDCHGINFO *bdchginfo1, SCIP_BDCHGINFO *bdchginfo2) |
|
SCIP_Real | SCIPboundchgGetNewbound (SCIP_BOUNDCHG *boundchg) |
|
SCIP_VAR * | SCIPboundchgGetVar (SCIP_BOUNDCHG *boundchg) |
|
SCIP_BOUNDCHGTYPE | SCIPboundchgGetBoundchgtype (SCIP_BOUNDCHG *boundchg) |
|
SCIP_BOUNDTYPE | SCIPboundchgGetBoundtype (SCIP_BOUNDCHG *boundchg) |
|
SCIP_Bool | SCIPboundchgIsRedundant (SCIP_BOUNDCHG *boundchg) |
|
int | SCIPdomchgGetNBoundchgs (SCIP_DOMCHG *domchg) |
|
SCIP_BOUNDCHG * | SCIPdomchgGetBoundchg (SCIP_DOMCHG *domchg, int pos) |
|
SCIP_Real | SCIPholelistGetLeft (SCIP_HOLELIST *holelist) |
|
SCIP_Real | SCIPholelistGetRight (SCIP_HOLELIST *holelist) |
|
SCIP_HOLELIST * | SCIPholelistGetNext (SCIP_HOLELIST *holelist) |
|
int SCIPvarGetNLocksDown |
( |
SCIP_VAR * |
var | ) |
|
gets number of locks for rounding down
- Parameters
-
int SCIPvarGetNLocksUp |
( |
SCIP_VAR * |
var | ) |
|
gets number of locks for rounding up
- Parameters
-
is it possible, to round variable down and stay feasible?
- Parameters
-
is it possible, to round variable up and stay feasible?
- Parameters
-
compares the index of two variables, only active or negated variables are allowed, if a variable is negated then the index of the corresponding active variable is taken, returns -1 if first is smaller than, and +1 if first is greater than second variable index; returns 0 if both indices are equal, which means both variables are equal
- Parameters
-
var1 | first problem variable |
var2 | second problem variable |
SCIP_DECL_SORTPTRCOMP |
( |
SCIPvarCompActiveAndNegated |
| ) |
|
comparison method for sorting active and negated variables by non-decreasing index, active and negated variables are handled as the same variables
compares the index of two variables, returns -1 if first is smaller than, and +1 if first is greater than second variable index; returns 0 if both indices are equal, which means both variables are equal
- Parameters
-
var1 | first problem variable |
var2 | second problem variable |
SCIP_DECL_SORTPTRCOMP |
( |
SCIPvarComp |
| ) |
|
comparison method for sorting variables by non-decreasing index
SCIP_DECL_SORTPTRCOMP |
( |
SCIPvarCompObj |
| ) |
|
comparison method for sorting variables by non-decreasing objective coefficient
SCIP_DECL_HASHGETKEY |
( |
SCIPvarGetHashkey |
| ) |
|
hash key retrieval function for variables
SCIP_DECL_HASHKEYEQ |
( |
SCIPvarIsHashkeyEq |
| ) |
|
returns TRUE iff the indices of both variables are equal
SCIP_DECL_HASHKEYVAL |
( |
SCIPvarGetHashkeyVal |
| ) |
|
returns the hash value of the key
void SCIPvarsGetProbvar |
( |
SCIP_VAR ** |
vars, |
|
|
int |
nvars |
|
) |
| |
gets corresponding active, fixed, or multi-aggregated problem variables of given variables, - Note
- the content of the given array will/might change
- Parameters
-
vars | array of problem variables |
nvars | number of variables |
gets corresponding active, fixed, or multi-aggregated problem variable of a variable
- Parameters
-
gets corresponding active, fixed, or multi-aggregated problem variables of binary variables and updates the given negation status of each variable
- Parameters
-
vars | pointer to binary problem variables |
negatedarr | pointer to corresponding array to update the negation status |
nvars | number of variables and values in vars and negated array |
gets corresponding active, fixed, or multi-aggregated problem variable of a binary variable and updates the given negation status
- Parameters
-
var | pointer to binary problem variable |
negated | pointer to update the negation status |
transforms given variable, boundtype and bound to the corresponding active, fixed, or multi-aggregated variable values
- Parameters
-
var | pointer to problem variable |
bound | pointer to bound value to transform |
boundtype | pointer to type of bound: lower or upper bound |
transforms given variable and domain hole to the corresponding active, fixed, or multi-aggregated variable values
- Parameters
-
var | pointer to problem variable |
left | pointer to left bound of open interval in hole to transform |
right | pointer to right bound of open interval in hole to transform |
retransforms given variable, scalar and constant to the corresponding original variable, scalar and constant, if possible; if the retransformation is impossible, NULL is returned as variable
- Parameters
-
var | pointer to problem variable x in sum a*x + c |
scalar | pointer to scalar a in sum a*x + c |
constant | pointer to constant c in sum a*x + c |
returns whether the given variable is the direct counterpart of an original problem variable
- Parameters
-
returns the number of times, a bound of the variable was changed in given direction due to branching
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns the number of times, a bound of the variable was changed in given direction due to branching in the current run
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns the number of inferences branching on this variable in given direction triggered
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns the number of inferences branching on this variable in given direction triggered in the current run
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns the number of cutoffs branching on this variable in given direction produced
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns the number of cutoffs branching on this variable in given direction produced in the current run
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns the average depth of bound changes in given direction due to branching on the variable
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns the average depth of bound changes in given direction due to branching on the variable in the current run
- Parameters
-
var | problem variable |
dir | branching direction (downwards, or upwards) |
returns whether there is an implication x == varfixing -> y <= b or y >= b in the implication graph; implications that are represented as cliques in the clique table are not regarded (use SCIPvarsHaveCommonClique()); both variables must be active, variable x must be binary
- Parameters
-
var | problem variable x |
varfixing | FALSE if y should be searched in implications for x == 0, TRUE for x == 1 |
implvar | variable y to search for |
impltype | type of implication y <=/>= b to search for |
returns whether there is an implication x == varfixing -> y == implvarfixing in the implication graph; implications that are represented as cliques in the clique table are not regarded (use SCIPvarsHaveCommonClique()); both variables must be active binary variables
- Parameters
-
var | problem variable x |
varfixing | FALSE if y should be searched in implications for x == 0, TRUE for x == 1 |
implvar | variable y to search for |
implvarfixing | value of the implied variable to search for |
returns whether there is a clique that contains both given variable/value pairs; the variables must be active binary variables; if regardimplics is FALSE, only the cliques in the clique table are looked at; if regardimplics is TRUE, both the cliques and the implications of the implication graph are regarded
- Parameters
-
var1 | first variable |
value1 | value of first variable |
var2 | second variable |
value2 | value of second variable |
regardimplics | should the implication graph also be searched for a clique? |
gets corresponding objective value of active, fixed, or multi-aggregated problem variable of given variable e.g. obj(x) = 1 this method returns for ~x the value -1
- Parameters
-
var | problem variable |
aggrobj | pointer to store the aggregated objective value |
sets the initial flag of a variable; only possible for original or loose variables
- Parameters
-
var | problem variable |
initial | initial flag |
sets the removable flag of a variable; only possible for original or loose variables
- Parameters
-
var | problem variable |
removable | removable flag |
const char* SCIPvarGetName |
( |
SCIP_VAR * |
var | ) |
|
returns the name of the variable
- Note
- to change the name of a variable, use SCIPchgVarName() from scip.h
- Parameters
-
gets number of times, the variable is currently captured
- Parameters
-
returns the user data of the variable
- Parameters
-
sets the user data for the variable
- Parameters
-
var | problem variable |
vardata | user variable data |
sets method to free user data for the original variable
- Parameters
-
sets method to transform user data of the variable
- Parameters
-
sets method to free transformed user data for the variable
- Parameters
-
sets method to copy this variable into sub-SCIPs
- Parameters
-
gets status of variable
- Parameters
-
returns whether the variable belongs to the original problem
- Parameters
-
returns whether the variable belongs to the transformed problem
- Parameters
-
returns whether the variable was created by negation of a different variable
- Parameters
-
gets type of variable
- Parameters
-
returns TRUE if the variable is of binary type; this is the case if: (1) variable type is binary (2) variable type is integer or implicit integer and (i) the lazy lower bound or the global lower bound is greater or equal to zero (ii) the lazy upper bound or the global upper bound is less tor equal to one
- Parameters
-
returns whether variable is of integral type (binary, integer, or implicit integer)
- Parameters
-
returns whether variable's column should be present in the initial root LP
- Parameters
-
returns whether variable's column is removable from the LP (due to aging or cleanup)
- Parameters
-
returns whether the variable was deleted from the problem
- Parameters
-
void SCIPvarMarkDeletable |
( |
SCIP_VAR * |
var | ) |
|
marks the variable to be deletable, i.e., it may be deleted completely from the problem; method can only be called before the variable is added to the problem by SCIPaddVar() or SCIPaddPricedVar()
- Parameters
-
void SCIPvarMarkNotDeletable |
( |
SCIP_VAR * |
var | ) |
|
marks the variable to be not deletable from the problem
returns whether variable is allowed to be deleted completely from the problem
returns whether variable is an active (neither fixed nor aggregated) variable
- Parameters
-
gets unique index of variable
- Parameters
-
int SCIPvarGetProbindex |
( |
SCIP_VAR * |
var | ) |
|
gets position of variable in problem, or -1 if variable is not active
- Parameters
-
gets transformed variable of ORIGINAL variable
- Parameters
-
gets column of COLUMN variable
- Parameters
-
returns whether the variable is a COLUMN variable that is member of the current LP
- Parameters
-
gets aggregation variable y of an aggregated variable x = a*y + c
- Parameters
-
gets aggregation scalar a of an aggregated variable x = a*y + c
- Parameters
-
gets aggregation constant c of an aggregated variable x = a*y + c
- Parameters
-
int SCIPvarGetMultaggrNVars |
( |
SCIP_VAR * |
var | ) |
|
gets number n of aggregation variables of a multi aggregated variable x = a0*y0 + ... + a(n-1)*y(n-1) + c
- Parameters
-
gets vector of aggregation variables y of a multi aggregated variable x = a0*y0 + ... + a(n-1)*y(n-1) + c
- Parameters
-
gets vector of aggregation scalars a of a multi aggregated variable x = a0*y0 + ... + a(n-1)*y(n-1) + c
- Parameters
-
gets aggregation constant c of a multi aggregated variable x = a0*y0 + ... + a(n-1)*y(n-1) + c
- Parameters
-
gets the negation of the given variable; may return NULL, if no negation is existing yet
- Parameters
-
var | negated problem variable |
gets the negation variable x of a negated variable x' = offset - x
- Parameters
-
var | negated problem variable |
gets the negation offset of a negated variable x' = offset - x
- Parameters
-
var | negated problem variable |
gets objective function value of variable
- Parameters
-
gets the unchanged objective function value of variable (ignoring temproray changes performed in probing mode)
- Parameters
-
gets original lower bound of original problem variable (i.e. the bound set in problem creation)
- Parameters
-
var | original problem variable |
gets original upper bound of original problem variable (i.e. the bound set in problem creation)
- Parameters
-
var | original problem variable |
gets the original hole list of an original variable
- Parameters
-
gets global lower bound of variable
- Parameters
-
gets global upper bound of variable
- Parameters
-
gets the global hole list of an active variable
- Parameters
-
gets best global bound of variable with respect to the objective function
- Parameters
-
gets worst global bound of variable with respect to the objective function
- Parameters
-
gets current lower bound of variable
- Parameters
-
gets current upper bound of variable
- Parameters
-
gets the current hole list of an active variable
- Parameters
-
gets best local bound of variable with respect to the objective function
- Parameters
-
gets worst local bound of variable with respect to the objective function
- Parameters
-
gets type (lower or upper) of best bound of variable with respect to the objective function
- Parameters
-
gets type (lower or upper) of worst bound of variable with respect to the objective function
- Parameters
-
gets lazy lower bound of variable
- Parameters
-
gets lazy upper bound of variable
- Parameters
-
gets the branch factor of the variable; this value can be used in the branching methods to scale the score values of the variables; higher factor leads to a higher probability that this variable is chosen for branching
- Parameters
-
int SCIPvarGetBranchPriority |
( |
SCIP_VAR * |
var | ) |
|
gets the branch priority of the variable; variables with higher priority should always be preferred to variables with lower priority
- Parameters
-
gets the preferred branch direction of the variable (downwards, upwards, or auto)
- Parameters
-
gets number of variable lower bounds x >= b_i*z_i + d_i of given variable x
- Parameters
-
gets array with bounding variables z_i in variable lower bounds x >= b_i*z_i + d_i of given variable x; the variable bounds are sorted by increasing variable index of the bounding variable z_i (see SCIPvarGetIndex())
- Parameters
-
gets array with bounding coefficients b_i in variable lower bounds x >= b_i*z_i + d_i of given variable x
- Parameters
-
gets array with bounding constants d_i in variable lower bounds x >= b_i*z_i + d_i of given variable x
- Parameters
-
gets number of variable upper bounds x <= b_i*z_i + d_i of given variable x
- Parameters
-
gets array with bounding variables z_i in variable upper bounds x <= b_i*z_i + d_i of given variable x; the variable bounds are sorted by increasing variable index of the bounding variable z_i (see SCIPvarGetIndex())
- Parameters
-
gets array with bounding coefficients b_i in variable upper bounds x <= b_i*z_i + d_i of given variable x
- Parameters
-
gets array with bounding constants d_i in variable upper bounds x <= b_i*z_i + d_i of given variable x
- Parameters
-
gets number of implications y <= b or y >= b for x == 0 or x == 1 of given active problem variable x, there are no implications for nonbinary variable x
- Parameters
-
var | active problem variable |
varfixing | FALSE for implications for x == 0, TRUE for x == 1 |
gets array with implication variables y of implications y <= b or y >= b for x == 0 or x == 1 of given active problem variable x, there are no implications for nonbinary variable x; the implications are sorted such that implications with binary implied variables precede the ones with non-binary implied variables, and as a second criteria, the implied variables are sorted by increasing variable index (see SCIPvarGetIndex())
- Parameters
-
var | active problem variable |
varfixing | FALSE for implications for x == 0, TRUE for x == 1 |
gets array with implication types of implications y <= b or y >= b for x == 0 or x == 1 of given active problem variable x (SCIP_BOUNDTYPE_UPPER if y <= b, SCIP_BOUNDTYPE_LOWER if y >= b), there are no implications for nonbinary variable x
- Parameters
-
var | active problem variable |
varfixing | FALSE for implications for x == 0, TRUE for x == 1 |
gets array with implication bounds b of implications y <= b or y >= b for x == 0 or x == 1 of given active problem variable x, there are no implications for nonbinary variable x
- Parameters
-
var | active problem variable |
varfixing | FALSE for implications for x == 0, TRUE for x == 1 |
Gets array with unique ids of implications y <= b or y >= b for x == 0 or x == 1 of given active problem variable x, there are no implications for nonbinary variable x. If an implication is a shortcut, i.e., it was added as part of the transitive closure of another implication, its id is negative, otherwise it is nonnegative.
- Parameters
-
var | active problem variable |
varfixing | FALSE for implications for x == 0, TRUE for x == 1 |
gets number of cliques, the active variable is contained in
- Parameters
-
var | active problem variable |
varfixing | FALSE for cliques containing x == 0, TRUE for x == 1 |
gets array of cliques, the active variable is contained in
- Parameters
-
var | active problem variable |
varfixing | FALSE for cliques containing x == 0, TRUE for x == 1 |
gets primal LP solution value of variable
- Parameters
-
gets primal NLP solution value of variable
- Parameters
-
return lower bound change info at requested position
- Parameters
-
var | problem variable |
pos | requested position |
int SCIPvarGetNBdchgInfosLb |
( |
SCIP_VAR * |
var | ) |
|
gets the number of lower bound change info array
- Parameters
-
return upper bound change info at requested position
- Parameters
-
var | problem variable |
pos | requested position |
int SCIPvarGetNBdchgInfosUb |
( |
SCIP_VAR * |
var | ) |
|
gets the number upper bound change info array
- Parameters
-
returns the value based history for the variable
- Parameters
-
gets primal LP solution value of variable
- Parameters
-
gets primal NLP solution value of variable
- Parameters
-
gets pseudo solution value of variable at current node
- Parameters
-
gets current LP or pseudo solution value of variable
- Parameters
-
var | problem variable |
getlpval | should the LP solution value be returned? |
returns the solution of the variable in the last root node's relaxation, if the root relaxation is not yet completely solved, zero is returned
- Parameters
-
returns the best solution (w.r.t. root reduced cost propagation) of the variable in the root node's relaxation, if the root relaxation is not yet completely solved, zero is returned
- Parameters
-
returns the best reduced costs (w.r.t. root reduced cost propagation) of the variable in the root node's relaxation, if the root relaxation is not yet completely solved, or the variable was no column of the root LP, SCIP_INVALID is returned
- Parameters
-
returns the best objective value (w.r.t. root reduced cost propagation) of the root LP which belongs the root reduced cost which is accessible via SCIPvarGetRootRedcost() or the variable was no column of the root LP, SCIP_INVALID is returned
- Parameters
-
set the given solution as the best root solution w.r.t. root reduced cost propagation in the variables
- Parameters
-
var | problem variable |
rootsol | root solution value |
rootredcost | root reduced cost |
rootlpobjval | objective value of the root LP |
returns a weighted average solution value of the variable in all feasible primal solutions found so far
- Parameters
-
returns the bound change information for the last lower bound change on given active problem variable before or after the bound change with the given index was applied; returns NULL, if no change to the lower bound was applied up to this point of time
- Parameters
-
var | active problem variable |
bdchgidx | bound change index representing time on path to current node |
after | should the bound change with given index be included? |
returns the bound change information for the last upper bound change on given active problem variable before or after the bound change with the given index was applied; returns NULL, if no change to the upper bound was applied up to this point of time
- Parameters
-
var | active problem variable |
bdchgidx | bound change index representing time on path to current node |
after | should the bound change with given index be included? |
returns the bound change information for the last lower or upper bound change on given active problem variable before or after the bound change with the given index was applied; returns NULL, if no change to the lower/upper bound was applied up to this point of time
- Parameters
-
var | active problem variable |
boundtype | type of bound: lower or upper bound |
bdchgidx | bound change index representing time on path to current node |
after | should the bound change with given index be included? |
returns lower bound of variable directly before or after the bound change given by the bound change index was applied
- Parameters
-
var | problem variable |
bdchgidx | bound change index representing time on path to current node |
after | should the bound change with given index be included? |
returns upper bound of variable directly before or after the bound change given by the bound change index was applied
- Parameters
-
var | problem variable |
bdchgidx | bound change index representing time on path to current node |
after | should the bound change with given index be included? |
returns lower or upper bound of variable directly before or after the bound change given by the bound change index was applied
- Parameters
-
var | problem variable |
boundtype | type of bound: lower or upper bound |
bdchgidx | bound change index representing time on path to current node |
after | should the bound change with given index be included? |
returns whether the binary variable was fixed at the time given by the bound change index
- Parameters
-
var | problem variable |
bdchgidx | bound change index representing time on path to current node |
after | should the bound change with given index be included? |
returns the last bound change index, at which the bounds of the given variable were tightened
- Parameters
-
int SCIPvarGetLastBdchgDepth |
( |
SCIP_VAR * |
var | ) |
|
returns the last depth level, at which the bounds of the given variable were tightened; returns -2, if the variable's bounds are still the global bounds returns -1, if the variable was fixed in presolving
- Parameters
-
returns whether the first binary variable was fixed earlier than the second one; returns FALSE, if the first variable is not fixed, and returns TRUE, if the first variable is fixed, but the second one is not fixed
- Parameters
-
var1 | first binary variable |
var2 | second binary variable |
returns whether first bound change index belongs to an earlier applied bound change than second one; if a bound change index is NULL, the bound change index represents the current time, i.e. the time after the last bound change was applied to the current node
- Parameters
-
bdchgidx1 | first bound change index, or NULL |
bdchgidx2 | second bound change index, or NULL |
returns whether first bound change index belongs to an earlier applied bound change than second one
- Parameters
-
bdchgidx1 | first bound change index |
bdchgidx2 | second bound change index |
returns old bound that was overwritten for given bound change information
- Parameters
-
bdchginfo | bound change information |
returns new bound installed for given bound change information
- Parameters
-
bdchginfo | bound change information |
returns variable that belongs to the given bound change information
- Parameters
-
bdchginfo | bound change information |
returns whether the bound change information belongs to a branching decision or a deduction
- Parameters
-
bdchginfo | bound change information |
returns whether the bound change information belongs to a lower or upper bound change
- Parameters
-
bdchginfo | bound change information |
returns depth level of given bound change information
- Parameters
-
bdchginfo | bound change information |
returns bound change position in its depth level of given bound change information
- Parameters
-
bdchginfo | bound change information |
returns bound change index of given bound change information
- Parameters
-
bdchginfo | bound change information |
returns inference variable of given bound change information
- Parameters
-
bdchginfo | bound change information |
returns inference constraint of given bound change information
- Parameters
-
bdchginfo | bound change information |
returns inference propagator of given bound change information, or NULL if no propagator was responsible
- Parameters
-
bdchginfo | bound change information |
returns inference user information of given bound change information
- Parameters
-
bdchginfo | bound change information |
returns inference bound of inference variable of given bound change information
- Parameters
-
bdchginfo | bound change information |
returns whether the bound change information belongs to a redundant bound change
- Parameters
-
bdchginfo | bound change information |
returns whether the bound change has an inference reason (constraint or propagator), that can be resolved
- Parameters
-
bdchginfo | bound change information |
for two bound change informations belonging to the same variable and bound, returns whether the first bound change has a tighter new bound as the second bound change
- Parameters
-
bdchginfo1 | first bound change information |
bdchginfo2 | second bound change information |
returns the new value of the bound in the bound change data
- Parameters
-
boundchg | bound change data |
returns the variable of the bound change in the bound change data
- Parameters
-
boundchg | bound change data |
returns the bound change type of the bound change in the bound change data
- Parameters
-
boundchg | bound change data |
returns the bound type of the bound change in the bound change data
- Parameters
-
boundchg | bound change data |
returns whether the bound change is redundant due to a more global bound that is at least as strong
- Parameters
-
boundchg | bound change data |
returns the number of bound changes in the domain change data
- Parameters
-
returns a particular bound change in the domain change data
- Parameters
-
domchg | domain change data |
pos | position of the bound change in the domain change data |
returns left bound of open interval in hole
- Parameters
-
holelist | hole list pointer to hole of interest |
returns right bound of open interval in hole
- Parameters
-
holelist | hole list pointer to hole of interest |
returns next hole in list or NULL
- Parameters
-
holelist | hole list pointer to hole of interest |
|