THE UNIVERSITY of EDINBURGH

DEGREE REGULATIONS & PROGRAMMES OF STUDY 2016/2017

University Homepage
DRPS Homepage
DRPS Search
DRPS Contact
DRPS : Course Catalogue : School of Mathematics : Mathematics

Undergraduate Course: Fundamentals of Operational Research (MATH10065)

Course Outline
SchoolSchool of Mathematics CollegeCollege of Science and Engineering
Credit level (Normal year taken)SCQF Level 10 (Year 4 Undergraduate) AvailabilityAvailable to all students
SCQF Credits10 ECTS Credits5
SummaryThis course covers some core areas of Operational Research, namely
Dynamic Optimisation, Integer Optimisation and Game Theory. Emphasis
will be placed both on the mathematical techniques and on problem
formulation through examples from applications.
Course description Dynamic Optimisation is a neat way of solving sequential decision
problems based on recursion. Its power comes from the fact that some
important classes of optimisation problems that "ought to be
difficult" can be reformulated as a recursive optimisation problem and
thus made tractable. Examples are network optimisation problems,
allocation problems and inventory problems.

Integer Optimisation provides a general method of solving problems
with logical or integrality constraints. Solution methods include
Branch-and-Bound and Gomory Cuts. Much emphasis will be placed on how
to express various types of restrictions that may appear in
optimisation problems (like logical conditions) can be expressed using
integer variables.

Game Theory is concerned with mathematical modelling of behaviour and
optimal decision making in competitive strategic situations in which
the success of strategic choices of one individual (person, company,
server, ...) depends on the choices of other (intelligent) "players"
that each have their own (possibly conflicting) agenda.

Note that Dynamic Optimisation and Integer Optimisation were
historically called "Dynamic Programming" and "Integer Programming"
respectively (the term "programming" in these words did not mean "computer
programming" but rather decision making).

Dynamic Optimisation
Multistage decision processes; principle of optimality. Applications: network problems; inventory problem; resource allocation problem; knapsack problem; stochastic problems.

Integer Optimisation
Modelling: set=up costs, batch production, limited number of production methods. Logical constraints; set covering problems; systematic conversion of logical expression to IP constraints. Solution techniques: branch and bound; Gomory pure integer cuts.

Game Theory
Optimal strategies in face of uncertainty (minimax and maximin). Two=person zero sum games, dominated strategies, saddle points, non=zero sum games, reaction curves and Nash equilibria.

Entry Requirements (not applicable to Visiting Students)
Pre-requisites Co-requisites
Prohibited Combinations Other requirements Student must not have taken :
MATH09002 Discrete Programming & Game Theory or MATH11089 Dynamic and Integer Programming.

There are no specific pre-requisites, but some previous exposure to optimisation (such as Linear Programming/Simplex algorithm) may be useful.
Information for Visiting Students
Pre-requisitesNone
High Demand Course? Yes
Course Delivery Information
Academic year 2016/17, Available to all students (SV1) Quota:  None
Course Start Semester 1
Timetable Timetable
Learning and Teaching activities (Further Info) Total Hours: 100 ( Lecture Hours 22, Seminar/Tutorial Hours 5, Summative Assessment Hours 2, Programme Level Learning and Teaching Hours 2, Directed Learning and Independent Learning Hours 69 )
Assessment (Further Info) Written Exam 80 %, Coursework 20 %, Practical Exam 0 %
Additional Information (Assessment) Coursework 20%, Examination 80%
Feedback Not entered
Exam Information
Exam Diet Paper Name Hours & Minutes
Main Exam Diet S1 (December)MATH10065 Fundamentals of Operational Research2:00
Academic year 2016/17, Part-year visiting students only (VV1) Quota:  None
Course Start Semester 1
Timetable Timetable
Learning and Teaching activities (Further Info) Total Hours: 100 ( Lecture Hours 22, Seminar/Tutorial Hours 5, Summative Assessment Hours 2, Programme Level Learning and Teaching Hours 2, Directed Learning and Independent Learning Hours 69 )
Assessment (Further Info) Written Exam 80 %, Coursework 20 %, Practical Exam 0 %
Additional Information (Assessment) Coursework 20%, Examination 80%
Feedback Not entered
Exam Information
Exam Diet Paper Name Hours & Minutes
Main Exam Diet S1 (December)MATH10065 Fundamentals of Operational Research2:00
Learning Outcomes
On completion of this course, the student will be able to:
  1. Ability to formulate and solve a sequential decision optimization problem
  2. Ability to formulate and solve optimization problems with logical constraints
  3. Ability to find optimal and equilibrium strategies for zero- and nonzero-sum 2x2 matrix games
  4. Mastery of the theory underlying the solution methods.
Reading List
Introduction to Operations Research, F. S. Hillier and G. Lieberman, McGraw-Hill Higher Education, 9th edition. ISBN-10: 0071267670
Additional Information
Graduate Attributes and Skills Not entered
KeywordsFuOR
Contacts
Course organiserDr Andreas Grothey
Tel: (0131 6)50 5747
Email: Andreas.Grothey@ed.ac.uk
Course secretaryMrs Alison Fairgrieve
Tel: (0131 6)50 5045
Email: Alison.Fairgrieve@ed.ac.uk
Navigation
Help & Information
Home
Introduction
Glossary
Search DPTs and Courses
Regulations
Regulations
Degree Programmes
Introduction
Browse DPTs
Courses
Introduction
Humanities and Social Science
Science and Engineering
Medicine and Veterinary Medicine
Other Information
Combined Course Timetable
Prospectuses
Important Information
 
© Copyright 2016 The University of Edinburgh - 3 February 2017 4:42 am