大型项目中的支付调度问题

在大规模复杂的项目投资和调度方面，对如何在满足项目的预定目标下使净现值达到最大的问题，首先引入AoA网络并建立一个具有线性约束和非凹目标函数的支付调度问题的数学模型；然后证明问题可以变换为等价的线性规划问题；最后给出了模型的有效求解方法和经济上的解释，并附以一个具体的例子。

A Study on the Problems of Payment Scheduling in Large-Scale Projects

Discussion on the investment and scheduling of large scale complex project is the focus of this paper. In this respect, how to maxmize the NPV when satisfying the schedule aim based on the construction of logistics project is being discussed. AoA is firstly introduced and a mathematic model of payment scheduling problem which is a nonlinear program with linear constraint and nonconcave objective function is established. Then, the question that the program can be transformed into a linear program equal in value is proved. In the end, an effective method to solve the model and the explanation in economy are proposed with a specific example.