用线性规划方法求网络计划的最低成本日程

Search the Agent of the Lowest Budget of Network Project with Linear Programming

网络计划优化的一个重要内容是研究项目的最低成本日程。本文假定工序在可压缩范围内,直接成本呈线性变化的前提下,以线性规范为工具,提出了一种最低成本日程的优化方法。当借助计算机求解时,该方法更加简单实用。

The most one important content of network project optimization is to search the agent of the lowest budget. Adopted the method of linear programming, an algorithm to search the agent of the lowest budget of network is presented under the assumpton of linear variation of the direct cost within the crashed time. With the help of computer, it is very easy to get the solution of the problem.