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]) |  |  |
Load a problem into Symphony
sym_loadProblem(nbVar,nbConstr,varLB,varUB,objCoeff,isInt,objSense,conMatrix,conLB,conUB)
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.
Number of variables
Number of constraints
Matrix containing lower bounds of the variables (must have size 1 row and nbVar columns). Bound can be negative infinity
Matrix containing upper bounds of the variables (must have size 1 row and nbVar columns). Bound can be infinity
Matrix containing coefficients of the variables in the objective (must have size 1 row and nbVar columns)
Boolean matrix representing wether a variable is constrained to be an integer (must have size 1 row and nbVar columns)
The sense (maximization/minimization) of the objective. Use sym_minimize or sym_maximize here
Sparse matrix representing the constraint matrix (must have size nbConstr rows and nbVar columns)
Matrix containing lower bounds of the constraints (must have size nbConstr rows and 1 column)
Matrix containing upper bounds of the constraints (must have size nbConstr rows and 1 column)
Returns 0 if the problem was successfully loaded into Symphony
sym_loadProblem(2,2,[0,0],[%inf,%inf],[1,1],[%t,%t],sym_maximize,sparse([1,2;2,1]),[0;0],[7;6.5]) | | |