BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:http://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20110101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20120705T160000
DTEND;TZID=UTC:20120705T160000
DTSTAMP:20260418T060353
CREATED:20170124T102147Z
LAST-MODIFIED:20170124T102147Z
UID:599-1341504000-1341504000@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: A decision rule approach to medium-term hydropower scheduling under uncertainty
DESCRIPTION:Title: A decision rule approach to medium-term hydropower scheduling under uncertaintySpeaker: Paula RochaAffiliation: Department of Computing – Imperial College LondonLocation: CPSE seminar room (C615 Roderic Hill)Time: 4:00pm \nAbstract. We present a multistage stochastic optimisation model for the medium-term scheduling of a cascaded hydropower system. Electricity spot prices change on a much shorter time scale than the hydrological dynamics of the reservoirs in the cascade. We exploit this property to reduce computational complexity: we partition the planning horizon into hydrological macroperiods\, and we account for intra-stage price variability by using price duration curves. Moreover\, we restrict the space of recourse decisions to those affine in the observable data\, thereby obtaining a tractable approximate problem. \nAbout the speaker.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-a-decision-rule-approach-to-medium-term-hydropower-scheduling-under-uncertainty/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20120705T163000
DTEND;TZID=UTC:20120705T163000
DTSTAMP:20260418T060353
CREATED:20170124T102146Z
LAST-MODIFIED:20170124T102146Z
UID:598-1341505800-1341505800@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Robust Pricing of Monopolistic Cloud Computing Services with Service Level Agreements
DESCRIPTION:Title: Robust Pricing of Monopolistic Cloud Computing Services with Service Level AgreementsSpeaker: Vladimir RoitchAffiliation: Department of Computing – Imperial College LondonLocation: CPSE seminar room (C615 Roderic Hill)Time: 4:30pm \nAbstract. Cloud Computing is a new computing paradigm that gives end-users on-demand access to computing resources of companies that maintain large data centres. Here\, we address the optimal pricing of cloud computing services from the perspective of a monopolistic service provider that needs to manage demand responsiveness and uncertainty. We formulate the pricing problem for on-demand services as a multi-stage stochastic program and model service level agreements via chance constraints. Under weak assumptions about the demand uncertainty we show that the resulting model can be reduced to an equivalent two-stage stochastic program. As cloud computing is only just emerging\, it is impossible to reliably estimate demand distributions from historical data. Indeed\, such data may even be difficult to collect. We address this type of model uncertainty by adopting a distributionally robust approach\, assuming that only information about the location\, size and support (but not the shape) of the demand distribution is available. We show that the arising robust model can be reformulated as a second-order cone program\, and we analytically derive the worst-case distributions. Several extensions of the basic model are discussed. First\, we study generalized models in which higher-order moments of the demand distribution are known. Next\, we include multiple products and account for different product qualities. Finally\, we investigate the possibility of selling unused capacity (if any) on a spot market. \nAbout the speaker.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-robust-pricing-of-monopolistic-cloud-computing-services-with-service-level-agreements/
END:VEVENT
END:VCALENDAR