运用分枝定界法求解混合整数规划程序

各输入参数的含义：

min f*x

A*x<=b

Aeq*x=beq

iter_num_max:迭代次数的上限

lb:各变量的下限

ub:各变量的上限

x0:初值

ID:0、1变量，ID(k)=1,表示第k个变量为整数变量，ID(k)=0，表示第k个变量为非整数变量

ftemp_up:初始上界,无法找到初始上界，默认为无穷大

IP：初始可行解，无法找到初始可行解，默认为空

各输出参数的含义：

x:最优解

y:最优解对应的目标函数值

iter_num:整个分支定界过程的迭代次数

Time:运行本程序所耗费的时间-　　Use the branch and bound method for solving mixed integer programming procedures meaning of the　　of the input parameters: min f* x　A* x < = b　Aeq* x = beq　iter_num_max: maximum number of iterations　lb : each variable lower limit　UB: upper limit of the each variable　X0: Initial　ID: 0,1 variable, ID (k) = 1 indicates the variable k is an integer variable, ID (k) = 0, represents the k variable non-integer variable　ftemp_up: initial upper bound, unable to find the upper bound of the initial default is infinite　IP: initial feasible solution, the initial feasible solution can not be found, the default is the empty　　output parameters meaning:　x:　y: optimal solution of the objective function value corresponding to the optimal solution　time-consuming iter_num: the number of iterations of the entire branch and bound process　Time: Run this program