Find your future
at our Open Days
Book nowat our Open Days
Formulation/Mathematical modelling of optimisation problems
Linear Optimisation: Graphical method, Simplex method, Phase I method, Dual problems,
Transportation problem.
Non-linear Optimisation: Unconstrained one dimensional problems, Unconstrained high dimensional problems, Constrained optimisation.
Total contact hours: 42
Private study hours: 108
Total study hours: 150
Assessment 1 Exercises, requiring on average between 10 and 15 hours to complete. 20%
Assessment 2 Exercises, requiring on average between 10 and 15 hours to complete 20%
Examination 2 hours 60%
Guenin, B., Konemann J., and Tuncel, L., A gentle introduction to optimisation, Cambridge University Press, 2004
Winston, W. L., Operations Research: Applications and Algorithms, 4th Edition, Cengage, 2004
Calafiore,G.C., El Ghaoui, L., Optimisation models, Cambridge University Press, 2014
Luenberger D.G, and Yinyu Y., Linear and Nonlinear Programming 4th Edition, Springer 2016
See the library reading list for this module (Canterbury)
The intended subject specific learning outcomes. On successfully completing the module students will be able to:
1 demonstrate knowledge and critical understanding of the well-established principles within linear and non-linear programming;
2 demonstrate the capability to use a range of established techniques and a reasonable level of skill in calculation and manipulation of the material to solve problems in the
following areas: linear programming, non-linear programming, approximation methods;
3 apply the concepts and principles in linear and non-linear programming in well-defined contexts beyond those in which they were first studied, showing the ability to
evaluate critically the appropriateness of different tools and techniques;
4 make appropriate use of suitable software.
University of Kent makes every effort to ensure that module information is accurate for the relevant academic session and to provide educational services as described. However, courses, services and other matters may be subject to change. Please read our full disclaimer.