Last modified: 27 Feb 2018 19:45
Linear optimisation is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. It is widely used in business and economics, and is also utilised for some engineering problems. Industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. It has proved useful in modeling diverse types routing, scheduling, assignment, and design.
|Session||First Sub Session||Credit Points||15 credits (7.5 ECTS credits)|
|Campus||Old Aberdeen||Sustained Study||No|
In many eal life problems one is required to find optimal solutions, namely a solution which, generally speaking, either minimises cost or maximises gain. To do so, one models the problem mathematically, and then applies the appropriate mathematical techniques to find the optimal solution. In this course students will learn how to formulate optimisation problems mathematically and study the relevant techniques from analysis and algebra which are useful in solving them, for example the Simplex Algorithm developed by Dantzing in 1947. Applications to â€œreal lifeâ€ problems and the use of computer software to solve them will also be discussed.
Intended Learning Outcomes
1.Understand the concept of "optimization problem"
2.Be able to formulate a concrete optimization problem in mathematical terms.
3.Be familiar with the technique of Lagrange Multipliers nd be able to apply it.
4.Understand the Simplex algorithm and be to apply it.
5.Understand and be able to apply the techniques of Linear Programming.
This course alternates with MX4087 Financial Mathematics.
Sorry, we don't have that information available.