<?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-05-31T15:15:07Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/23914" metadataPrefix="rdf">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/23914</identifier><datestamp>2026-02-03T11:10:07Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
   <ow:Publication rdf:about="oai:riuma.uma.es:10630/23914">
      <dc:title>Cost-driven screening of network constraints for the unit commitment problem</dc:title>
      <dc:creator>Porras, Álvaro</dc:creator>
      <dc:creator>Pineda-Morente, Salvador</dc:creator>
      <dc:creator>Morales-González, Juan Miguel</dc:creator>
      <dc:creator>Jiménez-Cordero, María Asunción</dc:creator>
      <dc:subject>Circuitos de interfaces</dc:subject>
      <dc:subject>Circuitos lógicos</dc:subject>
      <dc:subject>Ingeniería - Estimación de costes</dc:subject>
      <dc:subject>Optimización combinatoria</dc:subject>
      <dc:subject>Energía - Consumo</dc:subject>
      <dc:description>In an attempt to speed up the solution of the unit commitment (UC) problem, both machine-learning and optimization-based methods have been proposed to lighten the full UC formulation by removing as many superfluous line-flow constraints as possible. While the elimination strategies based on machine learning are fast and typically delete more constraints, they may be over-optimistic and result in infeasible UC solutions. For their part, optimization-based methods seek to identify redundant &#xd;
constraints in the full UC formulation by exploring the feasibility region of an LP-relaxation. In doing so, these methods only get rid of line-flow constraints whose removal leaves the feasibility region of the original UC problem unchanged. In this paper, we propose a procedure to substantially increase the line-flow constraints that are filtered out by optimization-based methods without jeopardizing their appealing ability of preserving feasibility. Our approach is based on tightening the LP-relaxation that the optimization-based method uses with a valid inequality related to the objective function of the UC problem and hence, of an economic nature. The result is that the so strengthened optimization-based method identifies not only redundant line-flow &#xd;
constraints but also inactive ones, thus leading to more reduced UC formulations.</dc:description>
      <dc:date>2022-04-05T07:41:34Z</dc:date>
      <dc:date>2022-04-05T07:41:34Z</dc:date>
      <dc:date>2022-04-04</dc:date>
      <dc:date>2022-03-16</dc:date>
      <dc:type>journal article</dc:type>
      <dc:identifier>Porras, A., Pineda, S., Morales, J. M. &amp; Jiménez Cordero, A. Cost-driven screening of network constraints for the unit commitment problem. En IEEE Transactions on Power Systems.https://dx.doi.org/10.1109/TPWRS.2022.3160016</dc:identifier>
      <dc:identifier>https://hdl.handle.net/10630/23914</dc:identifier>
      <dc:identifier>10.1109/TPWRS.2022.3160016</dc:identifier>
      <dc:language>eng</dc:language>
      <dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
      <dc:rights>open access</dc:rights>
      <dc:rights>Atribución 4.0 Internacional</dc:rights>
      <dc:publisher>The Institute of Electrical and Electronics Engineers (IEEE)</dc:publisher>
   </ow:Publication>
</rdf:RDF>
</metadata></record></GetRecord></OAI-PMH>