returns supremum of interval */

links a primal solution to the current LP solution * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is

gives the current number of constraints */

returns the left hand side of a nonlinear row */

sets separating parameters to * * - SCIP_PARAMSETTING_DEFAULT which are the default values of all separating parameters * - SCIP_PARAMSETTING_FAS

gets original lower bound of original problem variable (i.e. the bound set in problem creation) */

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 va

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

------------------------------------ @name Control */ @{ initialize timer

----------------------------------- @name Modification */ @{

! Constructor from rotation axis (non null) and angle (in radians). See also * setAxisAngle(). */

returns whether strong dual reductions are allowed during propagation and presolving * * @note A reduction is called strong dual, if it may discard

returns whether an expression is a variable expression */

gets the constant coefficient of a product expression */

returns the estimated number of bytes used by external software, e.g., the LP solver * * @return the estimated number of bytes used by external sof

returns the number of currently available NLPIs */

gets number of variables in AND-constraint */

creates a constraint handler and includes it in SCIP. All non-fundamental (or optional) callbacks will be set to NULL. * Optional callbacks can be s

returns whether the LP is in diving mode */

get column based start pointer of row indices */

gets expression */

gets the dual LP solution of a row */

gets objective value of primal CIP solution in transformed problem */

solves the LP at the current probing node (cannot be applied at preprocessing stage); * no separation or pricing is applied * * The LP has to be

extracts tokens from strings - wrapper method for strtok_r() */

returns, whether the LP was or is to be solved in the focus node */

gets primal NLP solution value of variable */

gets the unchanged objective function value of a variable (ignoring temproray changes performed in probing mode) */

clone function for polymorphism

generic heap management */

return the current value of field 4 */

returns number of rows

if a real parameter exits with the given parameter name it is set to the new value */

------------------------------------------------------------------------ ! Add an element to theh back of this vector \param e is the element we a

Resets \ref soplex::DVectorBase "DVectorBase"'s dimension to \p newdim.

sets integer parameter value; returns true on success

gets name of Benders' decomposition */

changes left hand side of linear constraint */

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

gets current number of columns in LP */

prints an error message containing of the given string followed by a string describing the current system error * * Prefers to use the strerror_r m

rounds value to the nearest integer with epsilon tolerance */

sets the measured time of a clock to the given value in seconds * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable e

sets copy method of both the constraint handler and each associated constraint * * @return \ref SCIP_OKAY is returned if everything worked. Otherwi

sets relaxation enforcement method of the constraint handler * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable erro

sets parameters to deactivate separators and heuristics that use auxiliary SCIP instances; should be called for * auxiliary SCIP instances to avoid

starts the time measurement of a clock * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See

stops the time measurement of a clock * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \

gets the branch priority of the variable; variables with higher priority should always be preferred to variables * with lower priority */

! Post an element for delayed addition to a set. \param i is the index for this set in the vector of sets. \param element is the value of the e

Returns array values.

returns SOS1 index of variable or -1 if variable is not part of the SOS1 conflict graph */

returns the adjusted (i.e. rounded, if the given variable is of integral type) lower bound value; * does not change the bounds of the variable * *

returns the adjusted (i.e. rounded, if the given variable is of integral type) upper bound value; * does not change the bounds of the variable * *

returns TRUE iff all columns, i.e. every variable with non-empty column w.r.t. all ever created rows, are present * in the LP, and FALSE, if there a

returns buffer memory for short living temporary objects * * @return the buffer memory for short living temporary objects */

gets number of variables in the cliques */

gets array with coefficients of nonzero entries */

returns TRUE iff constraint is belonging to original space */

creates a child node of the focus node * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See

drops a global event (stops to track event) * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed.

injects a change of variable's bounds into current probing node to fix the variable to the specified value; * the same can also be achieved with a c

gets a binary variable that is equal to the given binary variable, and that is either active, fixed, or * multi-aggregated, or the negated variable

gets the number of new best primal feasible solutions found by this heuristic */

returns value of int parameter */

returns the time point for given position of the resource profile */

sets destructor method of constraint handler * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed

adjust lower bound to integral value, if variable is integral */

adjust upper bound to integral value, if variable is integral */

changes global lower bound of variable; if possible, adjusts bound to integral value; * updates local lower bound if the global bound is tighter */

changes global upper bound of variable; if possible, adjusts bound to integral value; * updates local upper bound if the global bound is tighter */

gets number n of aggregation variables of a multi aggregated variable x = a0*y0 + ... + a(n-1)*y(n-1) + c */

gets the variable's pseudo cost value for the given step size "solvaldelta" in the variable's LP solution value */

id of \p i 'th covector. The \p i 'th #coId() is the \p i 'th SPxColId for a rowwise and the * \p i 'th SPxRowId for a columnwise basis represena

CppAD callback function that indicates whether we are running in parallel mode */

insert \p n uninitialized elements before \p i 'th element. * * You must not! use realloc, memcpy or memmove, because some data element points

Returns \ref soplex::DVectorBase "DVectorBase"'s memory size.

output two strings in columns 1 (width 2) and 2 (width 8) */

Returns the optimization sense.

catches a global (not variable or row dependent) event * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code

changes right hand side of linear constraint */

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

finds and returns the component identifier of this \p element */

processes event or adds event to the event queue */

gives the data of a bilinear expression term * * For a term a*expr1*expr2, returns expr1, expr2, a, and * the position of the quadratic expression

returns the node selector of the given name, or NULL if not existing */

returns fractional part of value, i.e. x - floor(x) in epsilon tolerance */

gets number of variables in set partitioning / packing / covering constraint */

creates a reader and includes it in SCIP. All non-fundamental (or optional) callbacks will be set to NULL. * Optional callbacks can be set via speci

depending on SCIP's stage, fixes binary variable in the problem, in preprocessing, or in current node; * the given inference constraint is stored, s

gets the number of rows in the LP */