symphony Solves a mixed integer linear programming constrained optimization problem. xopt = symphony(nbVar,nbCon,objCoef,isInt,LB,UB,conMatrix,conLB,conUB) xopt = symphony(nbVar,nbCon,objCoef,isInt,LB,UB,conMatrix,conLB,conUB,objSense) xopt = symphony(nbVar,nbCon,objCoef,isInt,LB,UB,conMatrix,conLB,conUB,objSense,options) [xopt,fopt,status,output] = symphony( ... ) nbVar : a double, number of variables. nbCon : a double, number of constraints. objCoeff : a 1 x n matrix of doubles, where n is number of variables, represents coefficients of the variables in the objective. isInt : a vector of boolean, represents wether a variable is constrained to be an integer. LB : a vector of doubles, represents lower bounds of the variables. UB : a vector of doubles, represents upper bounds of the variables. conMatrix : a matrix of doubles, represents matrix representing the constraint matrix. conLB : a vector of doubles, represents lower bounds of the constraints. conUB : a vector of doubles, represents upper bounds of the constraints objSense : The sense (maximization/minimization) of the objective. Use 1(sym_minimize ) or -1 (sym_maximize) here. options : a a list containing the the parameters to be set. xopt : a vector of doubles, the computed solution of the optimization problem. fopt : a double, the function value at x. status : status flag from symphony. output : The output data structure contains detailed informations about the optimization process. Search the minimum or maximum of a constrained mixed integer linear programming optimization problem specified by : find the minimum or maximum of f(x) such that \begin{eqnarray} &\mbox{min}_{x} & f(x) \\ & \text{subject to} & conLB \leq C(x) \leq conUB \\ & & lb \leq x \leq ub \\ \end{eqnarray} We are calling SYMPHONY written in C by gateway files for the actual computation. SYMPHONY was originally written by ​Ted Ralphs, ​Menal Guzelsoy and ​Ashutosh Mahajan. Keyur Joshi, Saikiran, Iswarya, Harpreet Singh