Dynamic and Integer Programming and Game Theory (P00704)

? Credit Points : 10 ? SCQF Level : 11 ? Acronym : MAT-P-DIP

Dynamic Programming: Sequential decision processes. Principle of optimality. Applications: network, inventory, option pricing, knapsack problems. Stochastic problems;

Integer programming: modelling, relaxations, unimodularity, Branch and Bound, Gomory cuts, knapsack problems.

Game theory: optimal strategies in face of uncertainty (minimax and maximin). 2-person zero sum games, dominated strategies, saddle points, non-zero sum games, reaction curves and Nash equilibria, evolutionary games.

Entry Requirements

? Pre-requisites : PGs only

Subject Areas

Home subject area

Operational Research, (School of Mathematics, Schedule P)

Delivery Information

? Normal year taken : Postgraduate

? Delivery Period : Semester 1 (Blocks 1-2)

? Contact Teaching Time : 2 hour(s) per week for 10 weeks

Summary of Intended Learning Outcomes

Ability to formulate and solve a sequential decision optimization problem. Ability to formulate and solve optimization problems with integer variables. Ability to apply game theory to analyse problems in competitive commercial situations.