-
-
Courses
Find courses by:
Collections
Cross-Disciplinary Topic Lists
Translated Courses
-
About
-
Donate
-
Featured Sites
 |
This lecture continues the discussion of curve fitting, emphasizing the interplay among theory, experimentation, and computation and addressing the problem of over-fitting. It then moves on to introduce the notion of an optimization problem, and illustrates it using the 0/1 knapsack problem. Image courtesy of kob42kob on Flickr. |
About this Video
Topics covered: Modeling, optimization, greedy algorithms, 0-1 knapsack problem.
Resources
What does an optimization problem consist of?
› View/hide answer
An optimization problem requires that an objective function be optimized, either by maximizing or minimizing the function. There may also be a set of constraints that must be accounted for.
What is problem reduction?
› View/hide answer
Taking a problem with an unknown solution and reducing it to a problem or problems with known solutions.
In this problem set, using Python and pylab you will design and implement a stochastic simulation of patient and virus population dynamics, and reach conclusions about treatment regimens based on the simulation results.
Problem set 9 is assigned in this session. The instructions and solutions can be found on the session page where it is due, Lecture 20 More Clustering.
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.
© 2001–2012
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
