In this course, we introduce discrete optimization and expose students to some of the most fundamental concepts, techniques and algorithms in the field. It covers linear optimization, integer and mixed programming, network optimization, goal programming, multi-criteria decision analysis, constraint programming, and game theory. The techniques and algorithms will be applied to complex practical problems in areas such as scheduling, network security, social network, vehicle routing, supply-chain optimization, and resource allocation. Students will do a project on an application of their choice. Prerequisite: MATH 3400
In this course, we introduce discrete optimization and expose students to some of the most fundamental concepts, techniques and algorithms in the field. It covers linear optimization, integer and mixed programming, network optimization, goal programming, multi-criteria decision analysis, constraint programming, and game theory. The techniques and algorithms will be applied to complex practical problems in areas such as scheduling, network security, social network, vehicle routing, supply-chain optimization, and resource allocation. Students will do a project on an application of their choice. Prerequisite: MATH 3400
