<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445878207</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145534.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11081-010-9113-3</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11081-010-9113-3</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Optimizing financial and physical assets withchance-constrained programming intheelectricalindustry</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Riadh Zorgati, Wim van Ackooij]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper deals with a Chance-Constrained Programming formulation and approximate resolution of an offer-demand equilibrium problem in the context of electricity markets. First, we state the probabilistic model. Computing the coefficients of the problem matrix is easy for financial assets, but a challenging task for physical assets. By introducing maximal production capacities, the computation becomes tractable for thermal plants but still leads to a combinatorial problem for hydraulic production. The obtained problem matrix is sparse, large scale and with random coefficients describing underlying uncertainty factors affecting the available power of assets. Second, we suggest some ways for approximately solving the obtained combinatorial chance-constrained program, which is in fact a stochastic multi-knapsack problem. A formal link between joint and individual chance constraints is exhibited and may lead to a simplified processing of the problem. Finally we illustrate our approximate algorithm on a stylized example.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Unit commitment</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Hedging</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Chance-constrained programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zorgati</subfield>
   <subfield code="D">Riadh</subfield>
   <subfield code="u">OSIRIS 1, EDF R&amp;D, avenue du Général de Gaulle, 92141, Clamart Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">van Ackooij</subfield>
   <subfield code="D">Wim</subfield>
   <subfield code="u">OSIRIS 1, EDF R&amp;D, avenue du Général de Gaulle, 92141, Clamart Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Optimization and Engineering</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">12/1-2(2011-03-01), 237-255</subfield>
   <subfield code="x">1389-4420</subfield>
   <subfield code="q">12:1-2&lt;237</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">11081</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11081-010-9113-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11081-010-9113-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Zorgati</subfield>
   <subfield code="D">Riadh</subfield>
   <subfield code="u">OSIRIS 1, EDF R&amp;D, avenue du Général de Gaulle, 92141, Clamart Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">van Ackooij</subfield>
   <subfield code="D">Wim</subfield>
   <subfield code="u">OSIRIS 1, EDF R&amp;D, avenue du Général de Gaulle, 92141, Clamart Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Optimization and Engineering</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">12/1-2(2011-03-01), 237-255</subfield>
   <subfield code="x">1389-4420</subfield>
   <subfield code="q">12:1-2&lt;237</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">11081</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
