<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-02T17:22:31Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/8369" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/8369</identifier><datestamp>2026-02-03T12:22:18Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Unit Commitment with Load Uncertainty by Joint Chance-Constrained Programming</dc:title>
   <dc:creator>Peralta, Jacobo</dc:creator>
   <dc:creator>Pérez-Ruiz, Juan</dc:creator>
   <dc:creator>De-la-Torre-Fazio, Sebastián Bienvenido</dc:creator>
   <dc:subject>Ingeniería electrica</dc:subject>
   <dcterms:abstract>This paper presents an algorithm to solve a unit&#xd;
commitment problem that takes into account the uncertainty in&#xd;
the demand. This uncertainty is included in the optimization&#xd;
problem as a joint chance constraint that bounds the minimum&#xd;
value of the probability to jointly meet the deterministic power&#xd;
balance constraints. The demand is modeled as a multivariate,&#xd;
normally distributed, random variable and the correlation&#xd;
among different time periods is also considered. A deterministic&#xd;
mixed-integer linear programming problem is sequentially&#xd;
solved until it converges to the solution of the chanceconstrained&#xd;
optimization problem. Different approaches are&#xd;
presented to update the z-value used to transform the joint&#xd;
chance constraint into a set of deterministic constraints. Results&#xd;
from a realistic size case study are presented and the values&#xd;
obtained for the multivariate normal distribution probability&#xd;
are compared with the ones obtained by using a Monte Carlo&#xd;
simulation procedure</dcterms:abstract>
   <dcterms:dateAccepted>2014-11-05T12:50:46Z</dcterms:dateAccepted>
   <dcterms:available>2014-11-05T12:50:46Z</dcterms:available>
   <dcterms:created>2014-11-05T12:50:46Z</dcterms:created>
   <dcterms:issued>2014-11-05</dcterms:issued>
   <dc:type>conference output</dc:type>
   <dc:identifier>http://hdl.handle.net/10630/8369</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Powertech 2013</dc:relation>
   <dc:relation>Grenoble, Francia</dc:relation>
   <dc:relation>16 de junio de 2013</dc:relation>
   <dc:rights>open access</dc:rights>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>