Courses:

Introduction to Mathematical Programming >> Content Detail



Study Materials



Readings





Help support MIT OpenCourseWare by shopping at Amazon.com! MIT OpenCourseWare offers direct links to Amazon.com to purchase the books cited in this course. Click on the book titles and purchase the book from Amazon.com, and MIT OpenCourseWare will receive up to 10% of all purchases you make. Your support will enable MIT to continue offering open access to MIT courses.

This section provides information on the assigned readings from the required textbook for the course: Bertsimas, D. and J. N. Tsitsiklis. Introduction to Linear Optimization . Athena Scientific, 1997. ISBN: 1886529191. (see http://www.athenasc.com/linoptbook.html for more information).

WEEK #DAY 1DAY 2
1Introduction
Ch. 1
2Polyhedra; Extreme Points
Sec. 2.-2.2
Degeneracy; Existence and Optimality of BFSs
Sec. 2.3-2.6
3Optimality Conditions; The Simplex Method
Sec. 3.1-3.2
Simplex Method Implementations
Sec. 3.2-3.3
4Anticycling, Phase I, Complexity
Sec. 3.4-3.5, 3.7
5Duality; Proof Based on Simplex
Sec. 4.7
Interpretation of Duality; Dual Simplex
Farkas Lemma
Sec. 4.4-4.6
6Separating Hyperplanes and Duality
Sec. 4.7
Cones, Rays, Representation of Polyhedra
Sec. 4.8-4.9
7Sensitivity Analysis
Sec. 5.1-5.2, 5.4
8Parametric Programming; Delayed Column Generation; Cutting Planes
Sec. 5.5, 6.1-6.3
Dantzig-Wolfe Decomposition
Sec. 6.4
9Interior Point Methods: Affine Scaling
Sec. 9.1-9.2
Other Interior Point Methods
Sec. 9.3-9.4
10Network Problems and the Simplex Method
Sec 7.1-7.3
Negative Cost Cycle Algorithm
Maximum Flow Problem
Sec. 7.4-7.5
11Duality in Networks; Shortest Path Problem
Sec. 7.6, 7.9
12Auction Algorithm
Sec. 7.8
13Integer Programming Formulations
Sec. 101-10.2
Cutting Plane Methods
Branch & Bound
Sec. 11.1-11.2
14Integer Programming Duality; Lagrangean Relaxation
Sec. 11.4
Integer Programming Techniques
Sec. 11.3, 11.5, 11.6
15Introduction to NP-Completeness
Sec. 11.8
 


 



 








© 2009-2020 HigherEdSpace.com, All Rights Reserved.
Higher Ed Space ® is a registered trademark of AmeriCareers LLC.