XPRSprob Methods

Allows columns to be added to the matrix after passing it to the Optimizer using the input routines.

Allows columns to be added to the matrix after passing it to the Optimizer using the input routines.

Adds cuts directly to the matrix at the current node. Any cuts added to the matrix at the current node and not deleted at the current node will be automatically added to the cut pool. The cuts added to the cut pool will be automatically restored at descendant nodes.

Adds cuts directly to the matrix at the current node. Any cuts added to the matrix at the current node and not deleted at the current node will be automatically added to the cut pool. The cuts added to the cut pool will be automatically restored at descendant nodes.

Adds one or more general constraints to the problem. Each general constraint y = f(x1, ..., xn, c1, ..., cn) consists of one or more (input) columns xi, zero or more constant values ci and a resultant (output column) y, different from all xi. General constraints include maximum and minimum (arbitrary number of input columns of any type and arbitrary number of input values, at least one total), and and or (at least one binary input column, no constant values, binary resultant) and absolute value (exactly one input column of arbitrary type, no constant values).

Adds one or more general constraints to the problem. Each general constraint y = f(x1, ..., xn, c1, ..., cn) consists of one or more (input) columns xi, zero or more constant values ci and a resultant (output column) y, different from all xi. General constraints include maximum and minimum (arbitrary number of input columns of any type and arbitrary number of input values, at least one total), and and or (at least one binary input column, no constant values, binary resultant) and absolute value (exactly one input column of arbitrary type, no constant values).

Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer.

Add the given row or column names to the problem.

Adds one or more piecewise linear constraints to the problem. Each piecewise linear constraint y = f(x) consists of an (input) column x, a (different) resultant (output column) y and a piecewise linear function f. The piecewise linear function f is described by at least two breakpoints, which are given as combinations of x- and y-values. Discontinuous piecewise linear functions are supported, in this case both the left and right limit at a given point need to be entered as breakpoints. To differentiate between left and right limit, the breakpoints need to be given as a list with non-decreasing x-values.

Adds one or more piecewise linear constraints to the problem. Each piecewise linear constraint y = f(x) consists of an (input) column x, a (different) resultant (output column) y and a piecewise linear function f. The piecewise linear function f is described by at least two breakpoints, which are given as combinations of x- and y-values. Discontinuous piecewise linear functions are supported, in this case both the left and right limit at a given point need to be entered as breakpoints. To differentiate between left and right limit, the breakpoints need to be given as a list with non-decreasing x-values.

Adds a new quadratic matrix into a row defined by triplets.

Adds a new quadratic matrix into a row defined by triplets.

Allows rows to be added to the matrix after passing it to the Optimizer using the input routines.

Allows rows to be added to the matrix after passing it to the Optimizer using the input routines.

Allows rows to be added to the matrix after passing it to the Optimizer using the input routines.

Allows rows to be added to the matrix after passing it to the Optimizer using the input routines.

Add the given set names to the problem.

Allows sets to be added to the problem after passing it to the Optimizer using the input routines.

Allows sets to be added to the problem after passing it to the Optimizer using the input routines.

Alters or changes matrix elements, right hand sides and constraint senses in the current problem.

Calculates the condition number of the current basis after solving the LP relaxation. *@deprecated

Calculates various measures for the stability of the current basis, including the basis condition number.

Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds. If the bounds are varied within these ranges the current basis remains optimal and feasible.

Post-multiplies a (row) vector provided by the user by the inverse of the current basis.

Calculates the objective value of a given solution.

Calculates the reduced cost values for a given (row) dual solution.

Calculates the row slack values for a given solution.

Calculates the required property of a solution, like maximum infeasibility of a given primal and dual solution.

Used to change the bounds on columns in the matrix.

Used to change a single coefficient in the matrix. If the coefficient does not already exist, a new coefficient will be added to the matrix. If many coefficients are being added to a row of the matrix, it may be more efficient to delete the old row of the matrix and add a new row.

Used to change semi-continuous or semi-integer lower bounds, or upper limits on partial integers.

Used to change multiple coefficients in the matrix. If any coefficient does not already exist, it will be added to the matrix. If many coefficients are being added to a row of the matrix, it may be more efficient to delete the old row of the matrix and add a new one.

Used to change multiple coefficients in the matrix. If any coefficient does not already exist, it will be added to the matrix. If many coefficients are being added to a row of the matrix, it may be more efficient to delete the old row of the matrix and add a new one.

Used to change multiple quadratic coefficients in the objective function. If any of the coefficients does not exist already, new coefficients will be added to the objective function.

Used to change multiple quadratic coefficients in the objective function. If any of the coefficients does not exist already, new coefficients will be added to the objective function.

Used to change the objective function coefficients.

Changes the problem's objective function sense to minimize or maximize.

Used to change a single quadratic coefficient in the objective function corresponding to the variable pair (objqcol1,objqcol2) of the Hessian matrix.

Changes a single quadratic coefficient in a row.

Used to change right—hand side values of the problem.

Used to change the range for a row of the problem matrix.

Used to change the type of a row in the matrix.

Resets the search for Irreducible Infeasible Sets (IIS).

Clears extra information attached to a range of rows.

Create a copy of the problem, including controls and callbacks.

Copy callbacks to this XPRSprob from another

Copies controls defined for one problem to another.

Create a copy of the problem.

Create a copy of the problem with the given name.

Provides a basic optimal solution for a given solution of an LP problem. This function behaves like the crossover after the barrier algorithm.

Delete columns from a matrix.

During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using DelCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using DelCPCuts.

During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using DelCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using DelCPCuts.

During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using DelCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using DelCPCuts.

During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. These cuts may be removed from a given node using DelCuts, but if this is to be applied in a large number of cases, it may be preferable to remove the cut completely from the cut pool. This is achieved using DelCPCuts.

Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using AddCuts or LoadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.

Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using AddCuts or LoadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.

Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using AddCuts or LoadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.

Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using AddCuts or LoadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.

Deletes cuts from the matrix at the current node. Cuts from the parent node which have been automatically restored may be deleted as well as cuts added to the current node using AddCuts or LoadCuts. The cuts to be deleted can be specified in a number of ways. If a cut is ruled out by any one of the criteria it will not be deleted.

Delete general constraints from a problem.

Delete indicator constraints. This turns the specified rows into normal rows (not controlled by indicator variables).

Delete piecewise linear constraints from a problem.

Deletes the quadratic part of a row or of the objective function.

Delete rows from a matrix.

Delete sets from a problem.

Destroy the problem, freeing all native resources used. Equivalent to calling Dipose().

Displays the list of controls and their current value for those controls that have been set to a non default value.

Performs a dual side range sensitivity analysis, i.e. calculates estimates for the possible ranges for dual values.

Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem.

Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem.

Fixes all the global entities to the values of the last found MIP solution. This is useful for finding the reduced costs for the continuous variables after the global variables have been fixed to their optimal values.

Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix.

Accesses the id number and the type information of an attribute given its name. An attribute name may be for example XPRS_ROWS. Names are case-insensitive and may or may not have the XPRS_ prefix. The id number is the constant used to identify the attribute for calls to functions such as GetIntAttrib. The type information returned will be one of the below integer constants defined in the xprs.h header file. The function will return an id number of 0 and a type value of XPRS_TYPE_NOTDEFINED if the name is not recognized as an attribute name. Note that this will occur if the name is a control name and not an attribute name.

Returns the current basis into the user's data arrays.

Returns the current basis status for a specific column or row.

Returns a single coefficient in the constraint matrix.

Returns a single coefficient in the constraint matrix.

Returns the nonzeros in the constraint matrix for the columns in a given range.

Returns the nonzeros in the constraint matrix for the columns in a given range.

Returns the nonzeros in the constraint matrix for the columns in a given range.

Returns the nonzeros in the constraint matrix for the columns in a given range.

Returns the column types for the columns in a given range.

Accesses the id number and the type information of a control given its name. A control name may be for example XPRS_PRESOLVE. Names are case-insensitive and may or may not have the XPRS_ prefix. The id number is the constant used to identify the control for calls to functions such as GetIntControl. The function will return an id number of 0 and a type value of XPRS_TYPE_NOTDEFINED if the name is not recognized as a control name. Note that this will occur if the name is an attribute name and not a control name.

Returns a list of cut indices from the cut pool.

Returns a list of cut indices from the cut pool.

Returns a list of cut indices from the cut pool.

Returns cuts from the cut pool. A list of cut pointers in the array rowind must be passed to the routine. The columns and elements of the cut will be returned in the regions pointed to by the colind and cutcoef parameters. The columns and elements will be stored contiguously and the starting point of each cut will be returned in the region pointed to by the start parameter.

Returns cuts from the cut pool. A list of cut pointers in the array rowind must be passed to the routine. The columns and elements of the cut will be returned in the regions pointed to by the colind and cutcoef parameters. The columns and elements will be stored contiguously and the starting point of each cut will be returned in the region pointed to by the start parameter.

Retrieves a list of cut pointers for the cuts active at the current node.

Retrieves a list of cut pointers for the cuts active at the current node.

Retrieves a list of cut pointers for the cuts active at the current node.

Used to return in which rows a list of cuts are currently loaded into the Optimizer. This is useful for example to retrieve the duals associated with active cuts.

Used to calculate the slack value of a cut with respect to the current LP relaxation solution. The slack is calculated from the cut itself, and might be requested for any cut (even if it is not currently loaded into the problem).

Enables users to retrieve the values of various double problem attributes. Problem attributes are set during loading and optimization of a problem.

Enables users to retrieve the values of various double problem attributes. Problem attributes are set during loading and optimization of a problem.

Retrieves the value of a given double control parameter.

Retrieves the value of a given double control parameter.

Used to return the directives that have been loaded into a matrix. Priorities, forced branching directions and pseudo costs can be returned. If called after presolve, GetDirs will get the directives for the presolved problem.

Used to return the directives that have been loaded into a matrix. Priorities, forced branching directions and pseudo costs can be returned. If called after presolve, GetDirs will get the directives for the presolved problem.

Used to return the directives that have been loaded into a matrix. Priorities, forced branching directions and pseudo costs can be returned. If called after presolve, GetDirs will get the directives for the presolved problem.

Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible.

Returns the general constraints y = f(x1, ..., xn, c1, ..., cm) in a given range.

Returns the general constraints y = f(x1, ..., xn, c1, ..., cm) in a given range.

Retrieves global information about a problem. It must be called before MipOptimize if the presolve option is used.

Retrieves global information about a problem. It must be called before MipOptimize if the presolve option is used.

Retrieves global information about a problem. It must be called before MipOptimize if the presolve option is used.

Retrieves global information about a problem. It must be called before MipOptimize if the presolve option is used.

Returns information for an Irreducible Infeasible Set: size, variables (row and column vectors) and conflicting sides of the variables, duals and reduced costs.

Returns the index for a specified row or column name.

Returns the index for a specified row or column name.

Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range.

Returns a list of infeasible primal and dual variables.

Enables users to recover the values of various integer problem attributes. Problem attributes are set during loading and optimization of a problem.

Enables users to recover the values of various integer problem attributes. Problem attributes are set during loading and optimization of a problem.

Enables users to recover the values of various integer control parameters

Enables users to recover the values of various integer control parameters

Used to obtain the last barrier solution values following optimization that used the barrier solver.

Returns the error message corresponding to the last error encountered by a library function.

Returns the error message corresponding to the last error encountered by a library function.

Returns the lower bounds for the columns in a given range.

Enables users to recover the values of various integer problem attributes. Problem attributes are set during loading and optimization of a problem.

Enables users to recover the values of various integer problem attributes. Problem attributes are set during loading and optimization of a problem.

Enables users to recover the values of various integer control parameters

Enables users to recover the values of various integer control parameters

Used to obtain the LP solution values following optimization.

Used to obtain the LP solution values following optimization.

Used to obtain a single LP solution value following optimization.

Retrieves the current suppression status of a message.

Retrieves the current suppression status of a message.

Used to obtain the solution values of the last MIP solution that was found.

Used to obtain the solution values of the last MIP solution that was found.

Used to obtain a single solution value of the last MIP solution that was found.

Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency, GetMQObj returns the lower triangular part of this matrix only.

Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency, GetMQObj returns the lower triangular part of this matrix only.

Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency, GetMQObj returns the lower triangular part of this matrix only.

Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. To achieve maximum efficiency, GetMQObj returns the lower triangular part of this matrix only.

Get the given row, column or set names for the given range.

Get the given row, column or set names for the given range.

Get the given row, column or set names for the given range.

Get the given row, column or set names for the given range.

Returns the objective function coefficients for the columns in a given range.

Function to access the type name of an object referenced using the generic Optimizer object pointer XPRSobject.

Returns the pivot order of the basic variables.

Returns a list of potential leaving variables if a specified variable enters the basis.

Returns the current basis from memory into the user's data areas. If the problem is presolved, the presolved basis will be returned. Otherwise the original basis will be returned.

Returns the mapping of the row and column numbers from the presolve problem back to the original problem.

Returns the solution for the presolved problem from memory.

Returns the solution for the presolved problem from memory.

Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded.

Returns the current problem name.

Returns the current problem name.

Returns the piecewise linear constraints y = f(x) in a given range.

Returns the piecewise linear constraints y = f(x) in a given range.

Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix.

Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix.

Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint.

Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint.

Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range. To achieve maximum efficiency, GetQRowQMatrix returns the lower triangular part of this matrix only.

Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range. To achieve maximum efficiency, GetQRowQMatrix returns the lower triangular part of this matrix only.

Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients). To achieve maximum efficiency, GetQRowQMatrixTriplets returns the lower triangular part of this matrix only.

Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients). To achieve maximum efficiency, GetQRowQMatrixTriplets returns the lower triangular part of this matrix only.

Returns the list indices of the rows that have quadratic coefficients.

Returns the list indices of the rows that have quadratic coefficients.

Returns the list indices of the rows that have quadratic coefficients.

Returns the right hand side elements for the rows in a given range.

Returns the right hand side range values for the rows in a given range.

Retrieve if a range of rows have been set up as special rows.

Returns the nonzeros in the constraint matrix for the rows in a given range.

Returns the nonzeros in the constraint matrix for the rows in a given range.

Returns the nonzeros in the constraint matrix for the rows in a given range.

Returns the nonzeros in the constraint matrix for the rows in a given range.

Returns the row types for the rows in a given range.

Returns a list of scaled infeasible primal and dual variables for the original problem. If the problem is currently presolved, it is postsolved before the function returns.

Get the current value of a string attribute

Get the current value of a string attribute

Get the current value of a string control

Get the current value of a string control

Gets the Type of the current instance.

Returns the upper bounds for the columns in a given range.

Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a matrix is primal or dual unbounded respectively.

Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a matrix is primal or dual unbounded respectively.

Starts the global search for an integer solution after solving the LP relaxation with Maxim (MAXIM) or Minim (MINIM) or continues a global search if it has been interrupted. *@deprecated

Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem.

Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS).

Returns statistics on the Irreducible Infeasible Sets (IIS) found so far by FirstIIS (IIS), NextIIS (IIS-n) or IISAll (IIS-a).

Reinitializes the global tree search. By default if a global search is interrupted and called again the global search will continue from where it left off. If InitGlobal is called after the first call to MipOptimize, the global search will start from the top node when MipOptimize is called again. *@deprecated

Interrupts the Optimizer algorithms.

Interrupts the Optimizer algorithms.

Loads a basis from the user's areas.

Loads directives into the current problem to specify which global entities the Optimizer should continue to branch on when a node solution is global feasible.

Loads cuts from the cut pool into the matrix. Without calling LoadCuts the cuts will remain in the cut pool but will not be active at the node. Cuts loaded at a node remain active at all descendant nodes unless they are deleted using DelCuts.

Loads cuts from the cut pool into the matrix. Without calling LoadCuts the cuts will remain in the cut pool but will not be active at the node. Cuts loaded at a node remain active at all descendant nodes unless they are deleted using DelCuts.

Loads cuts from the cut pool into the matrix. Without calling LoadCuts the cuts will remain in the cut pool but will not be active at the node. Cuts loaded at a node remain active at all descendant nodes unless they are deleted using DelCuts.

Specifies that a set of rows in the matrix will be treated as delayed rows during a global search. These are rows that must be satisfied for any integer solution, but will not be loaded into the active set of constraints until required.

Loads directives into the matrix.

Used to load a global problem in to the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.

Used to load a global problem in to the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.

Enables the user to pass a matrix directly to the Optimizer, rather than reading the matrix from a file.

Enables the user to pass a matrix directly to the Optimizer, rather than reading the matrix from a file.

Loads an LP solution for the problem into the Optimizer.

Loads a starting MIP solution for the problem into the Optimizer.

Loads a starting MIP solution for the problem into the Optimizer.

Specifies that a set of rows in the matrix will be treated as model cuts.

Loads a presolved basis from the user's areas.

Loads directives into the presolved matrix.

Used to load a quadratic problem with quadratic side constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints.

Used to load a quadratic problem with quadratic side constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints.

Used to load a global, quadratic problem with quadratic side constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.

Used to load a global, quadratic problem with quadratic side constraints into the Optimizer data structure. Such a problem may have quadratic terms in its objective function as well as in its constraints. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.

Used to load a global problem with quadratic objective coefficients in to the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.

Used to load a global problem with quadratic objective coefficients in to the Optimizer data structures. Integer, binary, partial integer, semi-continuous and semi-continuous integer variables can be defined, together with sets of type 1 and 2. The reference row values for the set members are passed as an array rather than specifying a reference row.

Used to load a quadratic problem into the Optimizer data structure. Such a problem may have quadratic terms in its objective function, although not in its constraints.

Used to load a quadratic problem into the Optimizer data structure. Such a problem may have quadratic terms in its objective function, although not in its constraints.

Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the matrix.

This function begins a search for the optimal continuous (LP) solution. The direction of optimization is given by OBJSENSE. The status of the problem when the function completes can be checked using LPSTATUS. Any global entities in the problem will be ignored.

This function begins a search for the optimal continuous (LP) solution. The direction of optimization is given by OBJSENSE. The status of the problem when the function completes can be checked using LPSTATUS. Any global entities in the problem will be ignored.

Begins a search for the optimal LP solution. *@deprecated

Begins a search for the optimal LP solution. *@deprecated

Creates a shallow copy of the current Object.

This function begins a global search for the optimal MIP solution. The direction of optimization is given by OBJSENSE. The status of the problem when the function completes can be checked using MIPSTATUS.

This function begins a global search for the optimal MIP solution. The direction of optimization is given by OBJSENSE. The status of the problem when the function completes can be checked using MIPSTATUS.

Continues the search for further Irreducible Infeasible Sets (IIS), or calls FirstIIS (IIS) if no IIS has been identified yet.

Continues the search for further Irreducible Infeasible Sets (IIS), or calls FirstIIS (IIS) if no IIS has been identified yet.

Returns upper and lower sensitivity ranges for specified objective function coefficients. If the objective coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.

Performs a simplex pivot by bringing variable enter into the basis and removing leave.

Postsolve the current matrix when it is in a presolved state.

Presolves a row formulated in terms of the original variables such that it can be added to a presolved matrix.

Instructs the Optimizer to read in a previously saved basis from a file.

Instructs the Optimizer to read in a previously saved basis from a file.

Instructs the Optimizer to read in a previously saved basis from a file.

Reads a solution from a binary solution file.

Reads a solution from a binary solution file.

Reads a solution from a binary solution file.

Reads a directives file to help direct the global search.

Reads a directives file to help direct the global search.

Reads an (X)MPS or LP format matrix from file.

Reads an (X)MPS or LP format matrix from file.

Reads an ASCII solution file [.slx] created by the WriteSlxSol function.

Reads an ASCII solution file [.slx] created by the WriteSlxSol function.

Reads an ASCII solution file [.slx] created by the WriteSlxSol function.

Executes the MIP solution refiner. *@deprecated

Provides a simplified interface for RepairWeightedInfeas.

By relaxing a set of selected constraints and bounds of an infeasible problem, it attempts to identify a 'solution' that violates the selected set of constraints and bounds minimally, while satisfying all other constraints and bounds. Among such solution candidates, it selects one that is optimal regarding to the original objective function. For the console version, see REPAIRINFEAS.

An extended version of RepairWeightedInfeas that allows for bounding the level of relaxation allowed.

Restores the Optimizer's data structures from a file created by Save (SAVE). Optimization may then recommence from the point at which the file was created.

Restores the Optimizer's data structures from a file created by Save (SAVE). Optimization may then recommence from the point at which the file was created.

Restores the Optimizer's data structures from a file created by Save (SAVE). Optimization may then recommence from the point at which the file was created.

Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients. If the RHS coefficients are varied within these ranges the current basis remains optimal and the reduced costs remain valid.

Saves the current data structures, i.e. matrices, control settings and problem attribute settings to file and terminates the run so that optimization can be resumed later.

Re-scales the current matrix.

Specifies the bounds previously stored using StoreBounds that are to be applied in order to branch on a user global entity. This routine can only be called from the user separate callback function, AddCbSepnode.

Specifies the pointers to cuts in the cut pool that are to be applied in order to branch on a user global entity. This routine can only be called from the user separate callback function, AddCbSepnode.

Sets the value of a given double control parameter.

Set a default control value.

Sets all controls to their default values. Must be called before the problem is read or loaded by ReadProb, LoadGlobal, LoadLP, LoadQGlobal, LoadQP.

Specifies that a set of rows in the matrix will be treated as indicator constraints during a global search. An indicator constraint is made of a condition and a constraint. The condition is of the type "bin = value", where bin is a binary variable and value is either 0 or 1. The constraint is any matrix row (may be linear, quadratic or general nonlinear). During global search, a row configured as an indicator constraint is enforced only when condition holds, that is only if the indicator variable bin has the specified value. Note that every row may only get assigned a single indicator variable and term. If a row needs to be activated by multiple different terms, the row needs to be duplicated so that each term can be assigned to a distinct row. If the indicator variable should be changed, the old term needs to be deleted first (by calling DelIndicators or by calling this function with a comps argument of 0) before assigning a new one.

Sets the value of a given integer control parameter.

This directs all Optimizer output to a log file.

Sets the value of a given integer control parameter.

Manages suppression of messages.

Sets the current default problem name. This command is rarely used.

Used to set the value of a given string control parameter.

Stores bounds for node separation using user separate callback function.

Stores bounds for node separation using user separate callback function.

Stores cuts into the cut pool, but does not apply them to the current node. These cuts must be explicitly loaded into the matrix using LoadCuts or SetBranchCuts before they become active.

Stores cuts into the cut pool, but does not apply them to the current node. These cuts must be explicitly loaded into the matrix using LoadCuts or SetBranchCuts before they become active.

Performs strong branching iterations on all specified bound changes. For each candidate bound change, StrongBranch performs dual simplex iterations starting from the current optimal solution of the base LP, and returns both the status and objective value reached after these iterations.

Performs strong branching iterations on all specified bound changes. For each candidate bound change, StrongBranchCB performs dual simplex iterations starting from the current optimal solution of the base LP, and returns both the status and objective value reached after these iterations.

Returns a String that represents the current Object.

This function begins a tuner session for the current problem. The tuner will solve the problem multiple times while evaluating a list of control settings and promising combinations of them. When finished, the tuner will select and set the best control setting on the problem. Note that the direction of optimization is given by OBJSENSE.

This function loads a user defined tuner method from the given file.

This function writes the current tuner method to a given file or prints it to the console.

Writes the current basis to a file for later input into the Optimizer.

Writes the current basis to a file for later input into the Optimizer.

Writes the current basis to a file for later input into the Optimizer.

Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.

Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.

Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.

Writes the global search directives from the current problem to a directives file.

Writes the global search directives from the current problem to a directives file.

Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS). If 0 is passed as the IIS number parameter, the initial infeasible subproblem is written.

Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS). If 0 is passed as the IIS number parameter, the initial infeasible subproblem is written.

Writes the current problem to an MPS or LP file.

Writes the current problem to an MPS or LP file.

Writes the current problem to an MPS or LP file.

Writes the current solution to a fixed format ASCII file, problem_name.prt.

Writes the current solution to a fixed format ASCII file, problem_name.prt.

Writes the current solution to a fixed format ASCII file, problem_name.prt.

Creates an ASCII solution file (.slx) using a similar format to MPS files. These files can be read back into the Optimizer using the ReadSlxSol function.

Creates an ASCII solution file (.slx) using a similar format to MPS files. These files can be read back into the Optimizer using the ReadSlxSol function.

Creates an ASCII solution file (.slx) using a similar format to MPS files. These files can be read back into the Optimizer using the ReadSlxSol function.

Writes the current solution to a CSV format ASCII file, problem_name.asc (and .hdr).

Writes the current solution to a CSV format ASCII file, problem_name.asc (and .hdr).