English subtitles

← 04-23 Linear Ramp

Get Embed Code
1 Language

Showing Revision 2 created 10/24/2012 by Amara Bot.

  1. Finding the best value for a single parameter is a pretty easy thing to be doing.
  2. Let's try something more difficult--optimizing the linear ramp,
  3. that is finding the best value for the point of time at we which we start ramping out the value.
  4. the start may be earlier, the end may be earlier,
  5. the end maybe later, the start maybe later, and so on.
  6. We want to find out which of this curves would produce the highest output.
  7. Not every combination of these two parameters make sense.
  8. We do not want this start time to be larger than the end time.
  9. That won't really work, so in this diagram the combinations
  10. below the diagram now are forbidden, and what our program will be doing,
  11. it will be varying both parameters between 0 and 10 years only in the allowed region
  12. and it will put dots in that region that show the total amount of harvest
  13. for all of these combinations of parameters.
  14. this blue dot would mean that this specific combination of parameters
  15. leads to a rather large total amount, and this smaller dot would mean
  16. that this combination of parameters leads to a smaller total amount and so on.
  17. The stepping of these two parameters that control the ramp process is already done.
  18. Your job is to compute the total amount of harvest and return it in this variable.