CE 377K

Optimization Techniques in Transportation Engineering

Spring 2015

This course is designed to teach students the basics of optimization problems, particularly in transportation engineering. Notes, homeworks, and practice exams will be posted here as the semester progresses.

Syllabus.

Practice midterm and practice final.

Project information and grading rubric.

Homeworks

Homework 1 - Due February 12. Solutions with C code.
Homework 2 - Due March 5. Solutions with C code and resulting output.
Homework 3 - Due April 16. Solutions with C code and simplex tableaux for each iteration.
homework 4 - Due May 7. Solutions

Notes

Lecture Slides

January 20 - Introduction to course, components of an optimization problem
January 22 - Examples of optimization formulations
January 27 - Unconstrained optimization
January 29 - Line search techniques
February 3 - Simulated annealing
February 5 - Genetic algorithms
February 10 - Network terminology and definitions
February 12 - Algorithms and complexity
February 17 - Minimum spanning trees
February 19 - Dijkstra's algorithm for shortest paths
February 24 - Bellman-Ford algorithm for shortest paths
February 26 - Augmenting path algorithm for max flow
March 3 - Capacity scaling for max flow
March 10 - Minimum cost flow problem
March 24 - Linear programming: introduction and geometry
March 26 - Linear programming: algebra
March 31 - Simplex method
April 2 - Simplex tableau
April 7 - Linear programming odds and ends
April 9 - LP sensitivity analysis; nonlinear standard form
April 14 - Convex sets and functions
April 16 - Lagrange multipliers
April 21 - KKT conditions
April 23 - Descent methods, target selection
April 28 - More on descent methods
April 30 - Step size selection, review

Back to teaching or the main page.