针对处理任务分配，将其建模为二次0 - 1规划问题，并提出了分布式逐层优化分配算法oall。
The processing task assignment is formulated as a quadratic 0-1 programming problem, and a distributed OALL algorithm (optimizing assignment layer by layer) is proposed.
二次规划(QP)为NP完全问题。
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
应用推荐