0


线性规划

Linear Programming
课程网址: http://oer.avu.org/handle/123456789/17  
主讲教师: David K. J.; Mtetwa
开课单位: 非洲虚拟大学
开课时间: 信息不详。欢迎您在右侧留言补充。
课程语种: 英语
中文简介:
该模块向学习者介绍了一种分析现实生活活动的特殊数学方法,这种方法侧重于在受约束的情况下做出具体决定。这里提出的方法称为线性规划,其重点是欣赏所产生的数学报表的思维方式和解释,而不是计算能力本身,这是留给适当和现成的ICT软件包例程。这个模块从单元一开始,包含两个主要活动。活动1,线性规划问题的提法,是对所考虑的问题情况的数学描述,而活动2,几何方法考虑对问题情况的可行解的可视化描述。因此,单元1应该引导学习者去欣赏现实生活中的活动情景,这些活动情景可以被建模为线性规划问题。单元2有3个主要活动,它考虑计算算法,为单元1中描述的类型的线性规划问题寻找合理的最优解。活动3考察了解决方案的最优性条件,这实际上是关于识别一个人什么时候在前进,并得到一个候选的和最好的解决方案。活动4讨论了攻击的计算代数方法的中心部分,即著名的单纯形算法。本模块主要讨论算法的逻辑,以及对偶性、简并性和效率等有用的定性性质。最后讨论了约束条件和目标函数中特定输入或输出因子变化时所得到的最优解的稳定性问题。这种所谓的后最优性或敏感性分析仅在对所采用的分析策略的评价水平上提出。
课程简介: 'This module introduces the learner to a particular mathematical approach to analysing real life activity that focuses on making specific decisions in constrained situations. The approach, called linear programming, is presented here with an emphasis on appreciation of the style of thinking and interpretation of mathematical statements generated, rather than on computational competency per se, which is left to appropriate and readily available ICT software package routines.The module begins with Unit One that consists of 2 main Activities. Activity 1, formulation of a linear programming problem, is on a mathematical description of the problematic situation under consideration, and Activity 2, the geometrical approach considers a visual description of a plausable solution to the problem situation. Unit 1 therefore should move the learner towards an appreciation of real-life activity situations that can be modelled as linear programming problems.With 3 main activities, Unit 2 considers computational algorithms for finding plausible optimal solutions to the linear programming problem situations of the type formulated in Unit 1. Activity 3 examines conditions for optimality of a solution, which is really about recognising when one is moving towards and arrives at a candidate and best solution. Activity 4 discusses the centre piece of computational algebraic methods of attack, the famed Simplex algorithm. This module focuses on the logic of the algorithm and the useful associated qualitative properties of duality, degeneracy, and efficiency. The final Activity touches on the problem of stability of obtained optimal solutions in relation to variations in specific input or output factors in the constraints and objective functions. This so called post optimality or sensitivity analysis is presented here only at the level of appreciation of the analytic strategies employed.'
关 键 词: 线性规划; 单纯形算法; 后最优性; 灵敏度分析
课程来源: 非洲虚拟大学公开课
最后编审: 2020-05-23:杨雨(课程编辑志愿者)
阅读次数: 107