checks, if value is (positive) infinite */

returns the name of the variable * * @note to change the name of a variable, use SCIPchgVarName() from scip.h */

gets current lower bound of variable */

gets current upper bound of variable */

prints a message */

returns value treated as infinity */

returns the name of the constraint * * @note to change the name of a constraint, use SCIPchgConsName() from scip.h */

safe version of snprintf */

gets status of variable */

returns the constraint data field of the constraint */

checks, if value is (positive) infinite */

return the number of elements.

gets global lower bound of variable */

gets type of variable */

gets global upper bound of variable */

checks, if values are in range of epsilon */

gets name of constraint handler */

returns value of variable in primal CIP solution, or in current LP/pseudo solution * * @return value of variable in primal CIP solution, or in curr

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

prints a message into a file, acting like the fprintf() command */

checks, if value is in range epsilon of 0.0 */

number of elements currently in this vector.

gets user data of constraint handler */

prints a dialog message that requests user interaction or is a direct response to a user interactive command */

gets position of variable in problem, or -1 if variable is not active */

gets objective function value of variable */

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

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 inte

returns current stage of SCIP * * @return the current SCIP stage * * See \ref SCIP_Stage "SCIP_STAGE" for a complete list of all possible solvin

--------------------------------------- @name Access */ @{ access \p n 'th index.

gives the children of an expression (can be NULL if no children) */

returns whether variable is an active (neither fixed nor aggregated) variable */

returns the constraint handler of the constraint */

gets number of active problem variables * * @return the number of active problem variables * * @pre This method can be called if @p scip is in o

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

Returns number of columns in LP.

checks, if relative difference of values is in range of feasibility tolerance */

gives the number of children of an expression */

returns TRUE iff constraint is modifiable (subject to column generation) */

returns block memory to use at the current time * * @return the block memory to use at the current time. */

! Number of arguments for a specified operator. \return Number of arguments corresponding to the specified operator. \param op Operator for which we

decreases usage counter of constraint, if the usage pointer reaches zero the constraint gets freed * * @return \ref SCIP_OKAY is returned if everyt

prints a message depending on the verbosity level */

Returns number of rows in LP.

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

! Number of variables resulting from the specified operation. \param op Operator for which we are fecching the number of results. \par NumResTable t

returns value treated as infinity */

gets user data of primal heuristic */

prints a warning message via the message handler */

checks, if value is in range feasibility tolerance of 0.0 */

checks, if val1 is not (more than epsilon) greater than val2 */

returns the constraint handler of the given name, or NULL if not existing */ returns the constraint handler of the given name, or NULL if not existing

Return number of steps.

add an element to the back of this vector

checks whether an image to the given origin exists in the hash map */

gets unique index of variable */

adds constraint to the problem; if constraint is only valid locally, it is added to the local subproblem of the * current node (and all of its subno

checks, if val1 is (more than epsilon) greater than val2 */

Absolute.

returns TRUE iff constraint is active in the current node */

checks, if val1 is (more than epsilon) lower than val2 */

Consistency check.

Gets lower bound.

globally removes constraint from all subproblems; removes constraint from the constraint set change data of the * node, where it was added, or from

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

gets the type of the node */

change the number of elements in this vector.

checks, if value is greater than epsilon */

releases an expression (decrements usage count and possibly frees expression) */

Gets upper bound.

gets name of primal heuristic */

checks, if val1 is not (more than epsilon) lower than val2 */

Left-hand side value.

retrieves image of given origin from the hash map, or NULL if no image exists */

checks, if values are in range of epsilon */

The following method resizes all vectors and arrays of |SoPlex| (excluding inherited vectors). */

Right-hand side value.

returns the number of the element with DataKey \p k in DataSet or -1, if it doesn't exist.

---------------------------------------------------------------------- current number of elements in this vector.

gets depth of current node, or -1 if no current node exists; in probing, the current node is the last probing node, * such that the depth includes t

checks, if value is integral within epsilon */

returns the current solver status

returns status of row \p i.

frees the hash map */

This function serves for using a Vector in an C-style * function. It returns a pointer to the first value of the array. */

creates and includes dialog * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref *

releases a dialog * * @return \ref SCIP_OKAY is returned if everything worked. otherwise a suitable error code is passed. see \ref * SCIP

adds a sub dialog to the given dialog as menu entry and captures it * * @return \ref SCIP_OKAY is returned if everything worked. otherwise a suitab

returns TRUE iff a dialog entry matching exactly the given name is existing in the given dialog */

gets the depth of the node */

returns TRUE iff constraint should be checked for feasibility */

get a const C pointer to the data.