线性规划最优整数解的解法探析程序.doc

本科毕业论文（设计） 题 目 线性规划最优整数解的解法探析 院（系） 应用数学学院 专 业 数学与应用数学 学生姓名 费勤忠 学 号 指导教师 陈侃 职称 讲师 论文字数 6735 完成日期:2015年5月25日 巢湖学院本科毕业论文论文The solution to the optimal integer linear programming solution analysis abstract Linear programming is a linear function in the linear constraints of maximum (minimum) value problem, its solution is also different, this paper mainly introduces graphic method, simplex method, the big M method, the regular method that several solution methods of problem solving. To understand all kinds of solutions on the basis of gradually to verify the applicability of the various solutions for different problem and difficulty, need the problem solving condition, and analysis the method by comparing the results can effectively according to the actual situation choose the most practical methods to solve practical problems. This article obtains from the realistic problems, it is easier to study and reflect the characteristics of each method, the role of experience in the real life, at the same time make readers easier to understand. Keywords: linear programming，Hydrolysis characteristics，Applicability 目 录 引言.........................................................1 1 什么是线性规划............................................1 2 线性规划问题的解法........................................1 2.1图解法...................................................1 2.2单纯形法.................................................2 2.3大M法...................................................5 2.4正则形法.................................................8 3小结......................................................12 参考文献....................................................13 引言 线性规划是运筹学的一个重要分支，这门学科之所以会诞生是因为人们在日常生活中对于物品的利用率要求越来越高，从而产生这门作用十分强大的学科。1939年，前苏联数学家康托诺维奇在《生产组织与计划中的数学方法》一书中，最早提出和研究了线性规划问题。1947年，美国数学家丹泽格