该参数优化算法可在对偶松弛凸可分规划算法的主循环之外，通过少量参数化扩展得到。
Based on dual relaxation method to extend a special convex separable programming algorithm, this tracking algorithm was constructed by parametric analysis.
文中介绍了模型的建立和可分规划法的计算步骤，并以一个实例说明模型和求解程序的可行性。
In this paper, establishment of the model and computational procedure of SP are described. It is indicated by a case study that the model and computer program are available.
应用推荐