【摘要】 本文介绍了网络计划线性工期成本优化的三种方法,即逐步压缩关键路线法;线性规划单纯形解法;应用最大流最小割原理的流量标记法。分析了逐步压缩关键路线法解题中的困难和所求解的近似性;分析了线性规划单纯形解法的缺点;然后根据网络计划工期成本优化的原始线性规划和对偶规划的互补松弛性质,推导出一种简便而精确的最大流最小割流量标记法。更多还原

【Abstract】 Three methods of the optimization of the linear cost-duration in activitynetworks are presented in this paper.They are the shortening C Pmethod,the simplex method in L P and the labeling method for finding themaximum flow and minimum cut in a network.We discuss the difficultiesmet in applying the shortening C P method and approximation of the obtainedsolution,and shortcomings in applying the simplex method in L P.Accordingto the complementary slackness between primal and dual L P of the optimi-zation of the linear cost-duration in activity networks,We obtain eventuallya simple and accurate method-the labeling method for finding maximumflow and minimum cut.更多还原