In this problem set you will write a solution to an optimization problem on how to find the shortest route from one building to another on the MIT campus given that you wish to constrain the amount of time you will spend walking outdoors (because generally speaking, the nocturnal beaver… err, um, the nocturnal MIT engineer… hates the sun).
Note: Solutions are not available for this assignment.