Lecture 5: Stochastic Programming
published: July 21, 2010, recorded: April 2008, views: 6613
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
By the way, if fi of x omega is less than or equal to some – if that constraint represents something like a resource usage, it means this is the expected over-utilization. Something like that. It can be all sorts of things. If it is a timing constraint, saying something has to be done by a certain amount, this is called the expected tardiness. If your basic inequality said this job has to be finished by this time, that’s the expected tardiness. That works because the plus function is non-decreasing and convex and so on. Now another one would be this, you could take the expected value of the maximum of all the constraints, and this is the expected worst violation. ...
See the whole transcript at Convex Optimization II - Lecture 05
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !