Integer Program Combination Optimization OpenCourseWare: A Free MIT Graduate Level Course on Integer Optimization

Published Jan 15, 2009

RSS Feed

'Integer Program Combination Optimization' is a Massachusetts Institute of Technology (MIT) graduate course that is now available free to Internet users through OpenCourseWare. 'Integer Program Combination Optimization' was designed for students working toward their master's degree in Computation for Design and Optimization at the MIT Sloan School of Management. 'Integer Program Combination Optimization' students learn about topics like ideal formulations, duality and lattices.

Integer Program Combination Optimization: Course Specifics

Degree Level Free Audio Video Downloads
Graduate Yes No No Yes

Lectures/Notes Study Materials Tests/Quizzes
Yes Yes Yes

Integer Program Combination Optimization: Course Description

'Integer Program Combination Optimization' was a lecture cours etaught in MIT's Sloan School of Management by Professor Dimitris Bertsimas. The course was an elective option for student's obtaining their master's degree in Computation for Design and Optimization. Graduate students in this course learned theories, algorithms and applications for integer optimization. 'Integer Program Combination Optimization' began by familiarizing students with formulations and relaxations that are used for integer optimization, and then moved on to cover integer optimization algebra and geometry. Professor Bertsimas' course culminated with a focus on algorithms for and extensions of integer optimization.

'Integer Program Combination Optimization' OpenCourseWare users can access lecture notes, problem sets and a midterm exam for the course. If you're interested in learning more about MIT's 'Integer Program Combination Optimization' course, you can do so at the integer optimization course page.

Featured School Choices: