Description

Loads a MIP problem into Symphony. All the necessary data can be given through a single function call.

The type of constraint is automatically deduced from the constraint bounds.

Arguments

nbVar

Number of variables

nbConstr

Number of constraints

varLB

Matrix containing lower bounds of the variables (must have size 1 row and nbVar columns). Bound can be negative infinity

varUB

Matrix containing upper bounds of the variables (must have size 1 row and nbVar columns). Bound can be infinity

objCoeff

Matrix containing coefficients of the variables in the objective (must have size 1 row and nbVar columns)

isInt

Boolean matrix representing wether a variable is constrained to be an integer (must have size 1 row and nbVar columns)

objSense

The sense (maximization/minimization) of the objective. Use sym_minimize or sym_maximize here

conMatrix

Sparse matrix representing the constraint matrix (must have size nbConstr rows and nbVar columns)

conLB

Matrix containing lower bounds of the constraints (must have size nbConstr rows and 1 column)

conUB

Matrix containing upper bounds of the constraints (must have size nbConstr rows and 1 column)

Return value

Returns 0 if the problem was successfully loaded into Symphony

Examples

sym_loadProblem(2,2,[0,0],[%inf,%inf],[1,1],[%t,%t],sym_maximize,sparse([1,2;2,1]),[0;0],[7;6.5])

Authors

• Keyur Joshi