verifies in debug mode that ranged row information is consistent */

Check whether heap is valid. * * @note Sift up/down do not use order, only for the last the changed one is entered. */

gets current basis

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

Returns array indices.

marks the current LP to be unsolved */

marks the current LP to be unsolved */

marks the current LP to be unsolved */

get number of iterations of current solution.

returns the current section */

returns successor of \p elem or 0, if \p elem is the last element.

if not already existing, adds row to global cut pool * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code i

get data of this bandit algorithm */

return number of actions of this bandit algorithm */

returns whether the bound change information belongs to a redundant bound change */

changes (column) variable's objective value during probing mode * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable e

increases usage counter of constraint */

returns if the constraint was already added to a SCIP instance */

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

creates empty problem and initializes all solving data structures (the objective sense is set to MINIMIZE) * If the problem type requires the use of

gets value for a variable in the debug solution * * if no value is stored for the variable, gives 0.0 */

clears the input command buffer of the dialog handler */

gets the capacity of the knapsack constraint */

method to collect the number of variables of a constraint * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error c

returns efficacy of the cut with respect to the given primal solution or the current LP solution: * e = -feasibility/norm * * @return the efficac

gets left hand side of variable bound constraint lhs <= x + c*y <= rhs */

gets right hand side of variable bound constraint lhs <= x + c*y <= rhs */

marks constraint to be propagated * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref

gets unique index of row */

gets Euclidean norm of row vector */

adds constant term to rowprep * * Substracts constant from side. */

sets method of constraint handler to initialize LP with relaxations of "initial" constraints * * @return \ref SCIP_OKAY is returned if everything w

sets propagation conflict resolving method of constraint handler * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable

sets all separation related callbacks/parameters of the constraint handler * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a

rounds value - feasibility tolerance up to the next integer in feasibility tolerance */

gets aggregation scalar a of an aggregated variable x = a*y + c */

gets number of variable lower bounds x >= b_i*z_i + d_i of given variable x */

gets array with bounding coefficients b_i in variable lower bounds x >= b_i*z_i + d_i of given variable x */

adds a node of the branch and bound tree to the reoptimization tree */

deletes coefficient at given position from linear constraint data */

gets number of variables in linear constraint */

returns number of basis changes since last \ref soplex::SPxBasis::load() "load()".

sets parameter of type int in LP solver, ignoring unknown parameters */

return opttol set by SCIPlpiSetRealpar(), which might be tighter than what SoPlex accepted */

returns real parameter value

Returns the inequality type of the \p i'th LPRow.

return next sibling */

returns \c true iff a >= b + eps

creates and captures an expression with given expression data and children */

returns whether aggregation of variables is not allowed */

gives the value of directional derivative from the last evaluation of a directional derivative of * expression (or SCIP_INVALID if there was an error

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

returns copy of the source constraint; if there already is a copy of the source constraint in the constraint hash * map, it is just returned as targ

returns maximal absolute value of row vector's non-zero coefficients * * @return maximal absolute value of row vector's non-zero coefficients * *

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

gets the array of weights in the knapsack constraint; the user must not modify this array! */

removes all entries in a hash map. */

checks whether an element exists in the hash set */

creates a presolver and includes it in SCIP with its fundamental callback. All non-fundamental (or optional) * callbacks as, e.g., init and exit cal

multiplies operand1 with operand2 and stores result in resultant */

parses the given string for a variable name and stores the variable in the corresponding pointer if such a variable * exits and returns the position

transforms and presolves problem * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref

gets problem variables */

computes a hashcode for double precision floating point values containing * 15 significant bits, the sign and the exponent */

returns name of rowprep (feel free to modify) */

returns debug solution data */

sets solving process initialization method of primal heuristic */

sets copy method of separator */

gets number of variable upper bounds x <= b_i*z_i + d_i of given variable x */

gets array with bounding coefficients b_i in variable upper bounds x <= b_i*z_i + d_i of given variable x */

outputs the variable name to the file stream * * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed

Testing all values of #coPvec# against its bounds. If $i$, say, is violated the violation is saved as negative value in |theCoTest[i]|. */

creates new data element in DataSet. @return Pointer to the newly created element. */

generic heap management */

error handling method */

get the name of a column or construct one

get the name of a column or construct one

gets value of given variable in debugging solution */

marks the current LP to be unsolved */

marks the current LP to be unsolved */

marks the current LP to be unsolved */

prints message about numerical trouble * * If message has verblevel at most high and display/verblevel is not full, * then the message is not print

return the current value of field 5 */