<!doctype html public "-//W3C//DTD W3 HTML//EN">
<html><head><style type="text/css"><!--
blockquote, dl, ul, ol, li { padding-top: 0 ; padding-bottom: 0 }
--></style><title>Sloan Courses</title></head><body>
<div>Email from: James B. Olin</div>
<div><br></div>
<blockquote type="cite" cite><br>
<b>15.053 Introduction to Optimization</b><br>
<br>
Prereq: <a href="">18.06</a> or permission of instructor<br>
Units: 4-0-8<br>
<br>
Introduces students to the theory, algorithms, and applications of
optimization. The optimization methodologies include linear
programming, network optimization, integer programming, decision
analysis, and dynamic programming. Applications to logistics,
manufacturing, engineering, E-commerce, project management, finance,
and more.<br>
<i>J. B. Orlin</i><br>
<br>
<b>Times<br>
</b>Tuesdays and Thursdays 10:00 to 11:30<br>
or Tuesdays and Thursdays 2:30 to 4.<br>
There are a choice of four recitation times on Friday.<br>
<br>
<b>Notes<br>
</b>Based on requests from last year, we have expanded the section
sizes so that the total is 200. This means that 60 to 90
non-Sloan students will be able to preregister. To preregister,
you must use the Sloan bidding system. If you are closed out of
the class, you will be put on a waiting list. If you are on the
top 25 on the waiting list, there is a good chance that you will be
able to add the subject.<br>
<br>
The prerequisite of 18.06 can be waived for anyone who is very
comfortable with elementary properties of matrices. Very little
linear algebra is used in 15.053. It is also waived for anyone
taking 18.06 concurrently.</blockquote>
<div><br></div>
</body>
</html>