cplex与matalb函数实例.doc

function cplexbilpex % Use the function cplexbilp to solve a binary integer programming problem % % The bilp problem solved in this example is % Maximize x1 + 2 x2 + 3 x3 + x4 % Subject to % - x1 + x2 + x3 + 10 x4 = 20 % x1 - 3 x2 + x3 = 30 % x2 - 3.5x4 = 0 % Binary Integer % x1 x2 x3 x4 % --------------------------------------------------------------------------- % File: cplexbilpex.m % Version 12.5 % --------------------------------------------------------------------------- % Licensed Materials - Property of IBM % 5725-A06 5725-A29 5724-Y48 5724-Y49 5724-Y54 5724-Y55 5655-Y21 % Copyright IBM Corporation 2008, 2012. All Rights Reserved. % % US Government Users Restricted Rights - Use, duplication or % disclosure restricted by GSA ADP Schedule Contract with IBM Corp. % --------------------------------------------------------------------------- try % Since cplexbilp solves minimization problems and the problem % is a maximization problem, negate the objective f = [-1 -2 -3 -1]; Aineq = [-1 1 1 10; 1 -3 1 0]; bineq = [20 30]; Aeq = [0 1 0 -3.5]; beq = 0; options = cplexoptimset; options.Diagnostics = on; [x, fval, exitflag, output] = cplexbilp (f, Aineq, bineq, Aeq, beq, ... [ ], options); fprintf (\nSolution status = %s\n, output.cplexstatusstring); fprintf (Solution value = %d\n, fval); disp (Values = ); disp (x); catch m disp(m.message); end end function cplexlpex % Use the function cplexlp to solve a linear programming problem % % The LP problem solved in this example is % Maximize x1 + 2 x2 + 3 x3 % Subject to % - x1 + x2 + x3 = 20 % x1 - 3 x2 + x3 = 30 % Bounds % 0 = x1 = 40 % 0 = x2 % 0 = x3 % --------------------------------------------------------------------------- % File: cplexlpex.m % Version 12.5 % -----------------------------------------------------------------------