| Linear Programming建模研讨 |
| |
| 引用本文： | 宋占奎,於全收,范光,燕嬿,胡杰军.Linear Programming建模研讨[J].西安文理学院学报,2007,10(4):46-49. |
| |
| 作者姓名： | 宋占奎 於全收 范光 燕嬿 胡杰军 |
| |
| 作者单位： | 湖北十堰职业技术学院 湖北十堰442000 |
| |
| 摘 要： | 研究用图解法、simplex method和匈牙利法建立Linear Programming的数学模型并求得了最优解.结果表明:对仅有两个变量的Linear Programming,既可通过图解法求得最优解;也可用单纯形表简便地求得最优解;而对任务和人数不等的assignment problem,则用匈牙利法求最优解.
|
| 关 键 词： | 图解法 可行域 匈牙利法 |
| 文章编号： | 1008-5564（2007）04-0046-04 |
| 修稿时间： | 2007-06-02 |
Modeling of Linear Programming |
| |
| SONG Zhan-kui,YU Quan-shou,FAN Guang,YAN Yan,HU Jie-jun.Modeling of Linear Programming[J].Journal of Xi‘an University of Arts & Science:Natural Science Edition,2007,10(4):46-49. |
| |
| Authors: | SONG Zhan-kui YU Quan-shou FAN Guang YAN Yan HU Jie-jun |
| |
| Institution: | Department of Mathematics, Shiyan Vocational Technical College, Shiyan 442000, China |
| |
| Abstract: | Aim: To discuss the optimal solution of the modeling of Linear Programming.Methods: graphic method;simplex method;Hungary method.Results: to establish modeling of Linear Programming and get the optimal solution.Conclusion: through the graphic method to get the optimal solution of Linear Programming that has only two variables.Also the simplex reflects all the information of the Linear Programming,so it can be very easy to get the optimal solution through simplex method.And to the assignment problem that has different assignments and person numbers,the optimal solution can be got through Hungary method. |
| |
| Keywords: | Linear Programming simplexmethod |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
