cbcintlinprog Solves a mixed integer linear programming constrained optimization problem in intlinprog format. xopt = cbcintlinprog(c,intcon,A,b) xopt = cbcintlinprog(c,intcon,A,b,Aeq,beq) xopt = cbcintlinprog(c,intcon,A,b,Aeq,beq,lb,ub) xopt = cbcintlinprog(c,intcon,A,b,Aeq,beq,lb,ub,options) xopt = cbcintlinprog('path_to_mps_file') xopt = cbcintlinprog('path_to_mps_file',options) [xopt,fopt,status,output] = cbcintlinprog( ... ) c : a vector of double, contains coefficients of the variables in the objective intcon : Vector of integer constraints, specified as a vector of positive integers. The values in intcon indicate the components of the decision variable x that are integer-valued. intcon has values from 1 through number of variable. A : A matrix of doubles, containing the coefficients of linear inequality constraints of size (m X n) where 'm' is the number of linear inequality constraints. b : A vector of doubles, related to 'A' and containing the the Right hand side equation of the linear inequality constraints of size (m X 1). Aeq : A matrix of doubles, containing the coefficients of linear equality constraints of size (m1 X n) where 'm1' is the number of linear equality constraints. beq : A vector of doubles, related to 'Aeq' and containing the the Right hand side equation of the linear equality constraints of size (m1 X 1). lb : A vector of doubles, containing the lower bounds of the variables of size (1 X n) or (n X 1) where 'n' is the number of variables. ub : A vector of doubles, containing the upper bounds of the variables of size (1 X n) or (n X 1) where 'n' is the number of variables. options : A list, containing the option for user to specify. See below for details. xopt : A vector of doubles, containing the computed solution of the optimization problem. fopt : A double, containing the the function value at x. status : An integer, containing the flag which denotes the reason for termination of algorithm. See below for details. output : A structure, containing the information about the optimization. See below for details. Search the minimum or maximum of a constrained mixed integer linear programming optimization problem specified by : \begin{eqnarray} &\mbox{min}_{x} & C^T⋅x \\ & \text{Subjected to:} & A⋅x \leq b \\ & & Aeq⋅x = beq \\ & & lb \leq x \leq ub \\ & & x_i \in \!\, \mathbb{Z}, i \in \!\, intcon\\ \end{eqnarray} CBC, an optimization library written in C++, is used for solving the linear programming problems. The options allow the user to set various parameters of the Optimization problem. The syntax for the options is given by: options= list("IntegerTolerance", [---], "MaxNodes",[---], "MaxIter", [---], "AllowableGap",[---] "CpuTime", [---],"gradobj", "off", "hessian", "off" ); IntegerTolerance : A Scalar, a number with that value of an integer is considered integer. MaxNodes : A Scalar, containing the maximum number of nodes that the solver should search. MaxTime : A scalar, specifying the maximum amount of CPU Time in seconds that the solver should take. AllowableGap : A scalar, that specifies the gap between the computed solution and the the objective value of the best known solution stop, at which the tree search can be stopped. The default values for the various items are given as: options = list('integertolerance',1d-06,'maxnodes',2147483647,'cputime',1d10,'allowablegap') The exitflag allows the user to know the status of the optimization which is returned by OSI-CBC. The values it can take and what they indicate is described below: 0 : Optimal Solution Found 1 : Converged to a point of primal infeasibility. 2 : Solution Limit is reached 3 : Node Limit is reached. Output may not be optimal. 4 : Numerical Difficulties. 5 : Maximum amount of CPU Time exceeded. 6 : Continuous Solution Unbounded. 7 : Converged to a point of dual infeasibility. For more details on exitflag, see the Bonmin documentation which can be found on http://www.coin-or.org/Cbc A few examples displaying the various functionalities of cbcintlinprog have been provided below. You will find a series of problems and the appropriate code snippets to solve them. Here we solve a simple objective function, subjected to three linear inequality constraints. Find x in R^8 such that it minimizes: \begin{eqnarray} \mbox{min}_{x}\ f(x) = 1750x_{1} + 990x_{2} + 1240x_{3} + 1680x_{4} + 500x_{5} + 450x_{6} + 400x_{7} + 100x_{8} \\ \end{eqnarray}\\ \text{Subjected to:}\\ \begin{eqnarray} \hspace{70pt} &6x_{1} + 4.25x_{2} + 5.5x_{3} + 7.75x_{4} + 3x_{5} + 3.25x_{6} + 3.5x_{7} + 3.75x_{8}&\leq 100\\ \hspace{70pt} &1.25x_{1} + 1.37x_{2} + 1.7x_{3} + 1.93x_{4} + 2.08x_{5} + 2.32x_{6} + 2.56x_{7} + 2.78x_{8}&\leq 205\\ \hspace{70pt} &1.15x_{1} + 1.34x_{2} + 1.66x_{3} + 1.99x_{4} + 2.06x_{5} + 2.32x_{6} + 2.58x_{7} + 2.84x_{8}&\leq 409\\ \end{eqnarray}\\ \text{With integer constraints as: } \begin{eqnarray} \begin{array}{cccccc} [1 & 2 & 3 & 4] \\ \end{array} \end{eqnarray} Here we build up on the previous example by adding upper and lower bounds to the variables. We add the following bounds to the problem specified above: \begin{eqnarray} 0 &\leq x_{1} &\leq 1\\ 0 &\leq x_{2} &\leq 1\\ 0 &\leq x_{3} &\leq 1\\ 0 &\leq x_{4} &\leq 1\\ 0 &\leq x_{5} &\leq \infty\\ 0 &\leq x_{6} &\leq \infty\\ 0 &\leq x_{7} &\leq \infty\\ 0 &\leq x_{8} &\leq \infty \end{eqnarray} In this example, we proceed to add the linear equality constraints to the objective function. \begin{eqnarray} &5x_{1} + 3x_{2} + 4x_{3} + 6x_{4} + x_{5} + x_{6} + x_{7} + x_{8}&= 25\\ &0.25x_{1} + 0.12x_{2} + 0.2x_{3} + 0.18x_{4} + 0.08x_{5} + 0.07x_{6} + 0.06x_{7} + 0.03x_{8}&= 1.25\\ &0.15x_{1} + 0.09x_{2} + 0.16x_{3} + 0.24x_{4} + 0.06x_{5} + 0.07x_{6} + 0.08x_{7} + 0.09x_{8}&= 1.25\\ \end{eqnarray} Primal Infeasible Problems: Find x in R^8 such that it minimizes: Find x in R^8 such that it minimizes: \begin{eqnarray} \mbox{min}_{x}\ f(x) = 1750x_{1} + 990x_{2} + 1240x_{3} + 1680x_{4} + 500x_{5} + 450x_{6} + 400x_{7} + 100x_{8} \\ \end{eqnarray}\\ \text{Subjected to:}\\ \begin{eqnarray} \hspace{70pt} &6x_{1} + 4.25x_{2} + 5.5x_{3} + 7.75x_{4} + 3x_{5} + 3.25x_{6} + 3.5x_{7} + 3.75x_{8}&\leq 26.333\\ \hspace{70pt} &1.25x_{1} + 1.37x_{2} + 1.7x_{3} + 1.93x_{4} + 2.08x_{5} + 2.32x_{6} + 2.56x_{7} + 2.78x_{8}&\leq 3.916\\ \hspace{70pt} &1.15x_{1} + 1.34x_{2} + 1.66x_{3} + 1.99x_{4} + 2.06x_{5} + 2.32x_{6} + 2.58x_{7} + 2.84x_{8}&\leq 5.249\\ \end{eqnarray}\\ \text{With integer constraints as: } \begin{eqnarray} \begin{array}{cccc} [1 & 2 & 3 & 4] \end{array} \end{eqnarray} Unbounded Problems. Find x in R^8 such that it minimizes: \begin{eqnarray} \mbox{min}_{x}\ f(x) = 1750x_{1} + 990x_{2} + 1240x_{3} + 1680x_{4} + 500x_{5} + 450x_{6} + 400x_{7} + 100x_{8} \\ \end{eqnarray}\\ \text{Subjected to:}\\ \begin{eqnarray} \hspace{70pt} &5x_{1} + 3x_{2} + 4x_{3} + 6x_{4} + x_{5} + x_{6} + x_{7} + x_{8}&= 25\\ \hspace{70pt} &0.25x_{1} + 0.12x_{2} + 0.2x_{3} + 0.18x_{4} + 0.08x_{5} + 0.07x_{6} + 0.06x_{7} + 0.03x_{8}&= 1.25\\ \hspace{70pt} &0.15x_{1} + 0.09x_{2} + 0.16x_{3} + 0.24x_{4} + 0.06x_{5} + 0.07x_{6} + 0.08x_{7} + 0.09x_{8}&= 1.25\\ \end{eqnarray}\\ \text{With integer constraints as: } \begin{eqnarray} \begin{array}{cccccc} [1 & 2 & 3 & 4] \\ \end{array} \end{eqnarray} Akshay Miterani and Pranav Deshpande