Linear Optimization & Game Theory - MAT00050H

« Back to module search

  • Department: Mathematics
  • Module co-ordinator: Prof. Jacco Thijssen
  • Credit value: 10 credits
  • Credit level: H
  • Academic year of delivery: 2019-20

Related modules

Co-requisite modules

  • None

Prohibited combinations

  • None

Module will run

Occurrence Teaching cycle
A Spring Term 2019-20

Module aims

The module aims to provide students with knowledge and skills to solve a wide variety of optimization problems, such as is commonly encountered in operations research, biological sciences, finance and economics.

The first part of the module is an introduction to linear optimization and solution methods. Emphasis is placed on examples with a realistic flavour such as network flow problems and problems from operations research. The second part of the module is an introduction to the related theory of games, with emphasis on solution methods based on linear optimization as well as examples arising from biological sciences, finance and economics.

Module learning outcomes

After successful completion, the student is able to

 

Linear optimization

  • State and describe the basic terminology and results concerning linear optimization and linear programming
  • Write a linear program in standard form.
  • Describe duality and its implications for the solutions of linear programs.
  • Use the basic simplex method to solve linear programs and prove its convergence to a solution.

 

Game theory

  • Describe the basic terminology concerning non-cooperative and cooperative games.
  • State and prove Nash's theorem and use it to solve simple two-player non-cooperative games.
  • State and prove the Core non-emptiness theorem and use it to solve simple cooperative games.

 

Academic and graduate skills

  • Formulate real-world problems in mathematical terms, solve them using appropriate methods, and interpret the solutions in terms of the original problems.

Critically assess assumptions necessary to draw certain conclusions.

Assessment

Task Length % of module mark
University - closed examination
Linear Optimization & Game Theory
2 hours 100

Special assessment rules

None

Reassessment

Task Length % of module mark
University - closed examination
Linear Optimization & Game Theory
2 hours 100

Module feedback

  • Marked coursework returned and discussed in examples classes.
  • Examination result delivered in Week 10 of SuT, with model solutions and examiner’s comments available earlier.

 

Indicative reading

Full printed notes will be provided. The following might be useful for background or additional reading.

  • Luenberger, D.G. and Y. Ye (2008), Linear and Non-Linear Programming, 3rd edition, Springer.
  • Maschler, M., E. Solan, and S. Zamir (2013), Game Theory, Cambridge University Press.
  • Osborne, M. and A. Rubinstein (1994), A Course in Game Theory, MIT Press.

 



The information on this page is indicative of the module that is currently on offer. The University is constantly exploring ways to enhance and improve its degree programmes and therefore reserves the right to make variations to the content and method of delivery of modules, and to discontinue modules, if such action is reasonably considered to be necessary by the University. Where appropriate, the University will notify and consult with affected students in advance about any changes that are required in line with the University's policy on the Approval of Modifications to Existing Taught Programmes of Study.