appends index \p i.

! \brief fetch the information corresponding to an operator \param op_index index for this operator [in] \param op [out] op code for this oper

set the section in the mps input structure to given section */

creates and captures a constraint of the given constraint handler * * @warning If a constraint is marked to be checked for feasibility but not to b

creates a sum expression */

returns the array of indices of the successor nodes; this array must not be changed from outside */

checks, if relative difference of val1 and val2 is not greater than feastol */

checks, if value is lower than -epsilon */

changes the value of an existing SCIP_Real parameter * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code i

returns the number of elements in IsList.

returns variable that belongs to a given node from the conflict graph */

gets heuristic, that found this solution or NULL if solution has type different than SCIP_SOLTYPE_HEUR */

remove locks of type @p locktype of variable with respect to the lock status of the constraint and its negation; * this method should be called when

Returns setup status.

returns whether the bound change information belongs to a lower or upper bound change */

frees the hash table */

creates a display column and includes it in SCIP */

get the number of non-zero entries of this column */

is id a row id?

returns variable that belongs to the given bound change information */

creates and captures an LP row without any coefficients from a constraint * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a

The default constructor creates a handle with a ``nullptr``-valued pointer

Objective coefficient value.

Transforms a given linear sum of variables, that is a_1*x_1 + ... + a_n*x_n + c into a corresponding linear sum of * active variables, that is b_1*y

creates a hash table */

sets interval to empty interval, which will be [1.0, -1.0] */

returns a random real between minrandval and maxrandval */

return the current value of field 2 */

creates an expression iterator */

creates and captures problem variable with optional callbacks and variable data set to NULL, which can be set * afterwards using SCIPvarSetDelorigDa

disables constraint's separation, enforcing, and propagation capabilities at the current node (and all subnodes); * if the method is called during p

frees an expression iterator */

sets initialization method of primal heuristic */

changes upper bound of variable in preprocessing or in the current node, if the new bound is tighter * (w.r.t. bound strengthening epsilon) than the

reads the next token from the input file into the token buffer; returns whether a token was read */

is id a column id?

creates and initializes SCIP data structures * * @note The SCIP default message handler is installed. Use the method SCIPsetMessagehdlr() to instal

returns whether an expression is a value expression */

gives name of nonlinear handler */

changes lower bound of variable in preprocessing or in the current node, if the new bound is tighter * (w.r.t. bound strengthening epsilon) than the

error handling method */

Computes the index of element [i][j] in a \c qreal matrix[3][4].

! Returns the position of the Frame, defined in the world coordinate system. See also orientation(), setPosition() and translation(). */

check data */

returns the next word in the handler's command buffer; if the buffer is empty, displays the given prompt or the * current dialog's path and asks the

returns objective sense of original problem * * @return objective sense of original problem * * @pre This method can be called if @p scip is in

returns, whether the LP was or is to be solved in the current node * * @return whether the LP was or is to be solved in the current node. * * @p

prints a message, acting like the printf() command */

installs default value for a single parameter */

outputs non-zero variables of solution in original problem space to the given file stream * * @return \ref SCIP_OKAY is returned if everything work

gets user data of reader */

appends extension to line and prints it to the give file stream if the * line exceeded the length given in the define PIP_PRINTLEN */

gives the data of a quadratic expression term * * For a term \f$a \cdot \text{expr}^2 + b \cdot \text{expr} + \sum_i (c_i \cdot \text{expr} \cdot \t

returns variable of given name in the problem, or NULL if not existing * * @return variable of given name in the problem, or NULL if not existing

gets the number of variables in the linear constraint */

gets corresponding transformed variable of a given variable; * returns NULL as transvar, if transformed variable is not yet existing * * @return

gets name of branching rule */

depending on SCIP's stage, changes upper bound of variable in the problem, in preprocessing, or in current node; * if possible, adjusts bound to int

gets variable for a variable event (var added, var deleted, var fixed, objective value or domain change) */

gets global primal bound (objective value of best solution or user objective limit) for the original problem * * @return the global primal bound (o

gets the array of variables in the linear constraint; the user must not modify this array! */

initializes the conflict analysis by clearing the conflict candidate queue; this method must be called before you * enter the conflict variables by

checks, if the given cut's efficacy is larger than the minimal cut efficacy * * @return TRUE if the given cut's efficacy is larger than the minimal

returns the next representable value of from in the direction of to */

gives the current number of variables */

get number of nonzero entries in row vector, that correspond to columns currently in the SCIP_LP; * * @warning This method is only applicable on ro

checks, if relative difference of val1 and val2 is not lower than -feastol */

checks, if value is integral within the feasibility bounds */

reads the next token from the input file into the token buffer; returns whether a token was read */

returns the SCIP instance for a given subproblem */

gives the coefficients and expressions that define a quadratic expression * * It can return the constant part, the number, arguments, and coefficien

swaps the addresses of two pointers */

returns whether the variable belongs to the original problem */

! Returns the viewer's qglviewer::ManipulatedFrame. This qglviewer::ManipulatedFrame can be moved with the mouse when the associated mouse bindin

-------------------------------- @name Access / modification */ @{ returns the type of the id.

return first child */

! \brief fetch an operator from the recording. \return the i-th operator in the recording. \param i the index of the operator in recording */

! \brief Fetch a parameter from the recording. \return the i-th parameter in the recording. \param i the index of the parameter in recording

creates a char parameter, sets it to its default value, and adds it to the parameter set * * @return \ref SCIP_OKAY is returned if everything worke

gets the constant of a summation expression */

return TRUE if conflict analysis is applicable; In case the function return FALSE there is no need to initialize the * conflict analysis since it wi

returns value treated as infinity in the LP solver */

get left-hand-side of row */

returns the number of elements in the queue */

maps transformed objective value into original space * * @return objective value into original space * * @pre This method can be called if SCIP

changes a single weight in knapsack constraint data */

---------------------------------------------------------------------- ! Increase the number of elements the end of this vector (existing elements a

depending on SCIP's stage, changes lower bound of variable in the problem, in preprocessing, or in current node; * if possible, adjusts bound to int

changes type of variable in the problem; * * @warning This type change might change the variable array returned from SCIPgetVars() and SCIPgetVarsD

frees a random number generator */