毕业论文-线性规划问题的解法【定稿】.docVIP

本科毕业论文（设计）模板 本科毕业论文(设计) 论文题目： 线性规划问题的解法 学生姓名： 学 号： 1004970101 专 业： 数学与应用数学 班 级： 数学 1001 指导教师： 张 健 完成日期： 2014年5月20日  内 容 摘 要 线性规划，是在运筹学的研究历程中涉及早、发展快、应用广的一个核心部分，它是帮助人类进行科学管理的一种数学方法,是研究线性约束条件下线性目标函数的极值问题的数学理论和方法，英文缩写LP。为合理地利用有限的人力、物力、财力等资源作出的最优决策提供科学的依据。 ，线性目标函数在约束条件下的最大值最小值的问题，统称为线性规划问题。求解线性规划问题的基本方法是单纯形法为了提高，又有、对偶单纯形法。对于只有两个变量的简单的线性规划问题，也可采用图解法求解。 Abstract Linear programming, is a core part which involved in the earlier, rapid development,wide application in the course of operations research study. It is a kind of mathematical method that it can help people to make scientific management . It also is mathematical theory and method that research linear objective function extremum problems under the condition of linear constraints,English abbreviation is LP. It makes the optimal decision and provides scientific basis for reasonable use of the limited manpower, material resources and financial resources,etc. Generally, the maximum and minimum value problems about linear objective function in the corresponding conditions referred to as linear programming problem. The basic method to solve the linear programming problem is simples method. Now it has had standard software of simples method, such as MATLAB. We can take advantage of computer to solve linear programming problem . In order to improve the efficiency of solving, the solutions of linear programming also have artificial variable method, dual simplex method. It also has graphic method to solve linear programming problem which only has two variables. This thesis focused on summarize and improvements which the general solution and special solution of linear programming problems. Simultaneously briefly discusses commonly used linear programming model and application. Key words：linear programming linear objective function