I E 589
Dynamic Optimization and Differential Games (3) Dynamic optimization and dynamic non-cooperative games emphasizing industrial applications.
I E 589 Dynamic Optimization and Differential Games (3)
This course provides an introduction to dynamic optimization and dynamic noncooperative games from the perspective of infinite dimensional mathematical programming and differential variational inequalities in topological vector spaces. The objective of this course is to give a working knowledge of computational methods for and applications of dynamic games. It builds on two prerequisite courses - introduction to operations research and linear programming - and also on co-requisite course in non linear programming. Coverage includes descent, projection and penalty algorithms for infinite dimensional mathematical programming and their extension to differential variational inequalities and dynamic games. Cournot-Nash-Bertrand and Stackelberg dynamic games are then studied from the point of view of differential variational inequalities and optimal control problems constrained by differential variational inequalities. Manufacturing and service engineering applications are employed to illustrate the tools developed in the course.
Students will be evaluated on the basis of a set of assigned problems (30%), a semester paper (30%), and a final examination (40%).
Note : Class size, frequency of offering, and evaluation methods will vary by location and instructor. For these details check the specific course syllabus.