文件名称:L01p_e
介绍说明－－下载内容均来自于网络，请自行研究使用
[x,f]= L01p_e(c,A,b,N)用枚举法求解下列
0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式，N= 0时可以省略。 返回结果x是最优解，f是最优解处的函数值。 -[X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.
0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式，N= 0时可以省略。 返回结果x是最优解，f是最优解处的函数值。 -[X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
L01p_e.m