首页 | 本学科首页   官方微博 | 高级检索  
     检索      

用线性规划方法求网络计划的最低成本日程
引用本文:梁云,左小德,薛声家.用线性规划方法求网络计划的最低成本日程[J].数学的实践与认识,1999,29(3):56-61.
作者姓名:梁云  左小德  薛声家
作者单位:暨南大学企业管理系,广州,510632
摘    要:网络计划优化的一个重要内容是研究项目的最低成本日程。本文假定工序在可压缩范围内,直接成本呈线性变化的前提下,以线性规范为工具,提出了一种最低成本日程的优化方法。当借助计算机求解时,该方法更加简单实用。

关 键 词:网络计划  最低成本日程  线性规划
修稿时间:1998-6-5

Search the Agent of the Lowest Budget of Network Project with Linear Programming
Liang Yun,Zuo Xiaode,Xue Shengjia.Search the Agent of the Lowest Budget of Network Project with Linear Programming[J].Mathematics in Practice and Theory,1999,29(3):56-61.
Authors:Liang Yun  Zuo Xiaode  Xue Shengjia
Abstract: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.
Keywords:network project  agent of the lowest budget  linear programming  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号