Column methods Detailed DescriptionFunction Documentation
sorts column entries such that LP rows precede non-LP rows and inside both parts lower row indices precede higher ones
gets best bound of column with respect to the objective function
gets the primal LP solution of a column
gets the minimal LP solution value, this column ever assumed
gets the maximal LP solution value, this column ever assumed
gets the basis status of a column in the LP solution; only valid for LPs with status SCIP_LPSOLSTAT_OPTIMAL and with SCIPisLPSolBasic(scip) == TRUE; returns SCIP_BASESTAT_ZERO for columns not in the current SCIP_LP
gets variable this column represents
gets unique index of col
returns whether the associated variable is of integral type (binary, integer, implicit integer)
returns TRUE iff column is removable from the LP (due to aging or cleanup)
gets position of column in current LP, or -1 if it is not in LP
gets depth in the tree where the column entered the LP, or -1 if it is not in LP
returns TRUE iff column is member of current LP
get number of nonzero entries in column vector
get number of nonzero entries in column vector, that correspond to rows currently in the SCIP_LP;
gets array with rows of nonzero entries
gets array with coefficients of nonzero entries
gets node number of the last node in current branch and bound run, where strong branching was used on the given column, or -1 if strong branching was never applied to the column in current run
gets number of times, strong branching was applied in current run on the given column
gets opposite bound type of given bound type
|