<?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-07-18T10:04:40Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/64185" metadataPrefix="mods">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/64185</identifier><datestamp>2025-02-10T19:11:38Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_17</setSpec></header><metadata><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Álvarez González, Francisco</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Cerdá Tena, Emilio Jaime</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2023-06-21T01:37:26Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2023-06-21T01:37:26Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">1997</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="uri">https://hdl.handle.net/20.500.14352/64185</mods:identifier>
   <mods:identifier type="relatedurl">http://www.ucm.es/icae</mods:identifier>
   <mods:abstract>We present a soIution method to find the closed fonu optimal solution for a class of learning by doing models when multiplicative uncertainty is introduced in the cost reduction function, which is assumed to be piecewice linear. Previous literature does not study the case with uncertainty in this function. We consider a monopolist, facing a linear demand function. The optimal policy for the resulting problem is piecewise linear. Furthennore, the optimal output increases with unit cost for certain values of the latter. Numerical examples are provided.</mods:abstract>
   <mods:abstract>Se presenta un método que permite encontrar la solución óptima en bucle cerrado para una familia de modelos learning by doing, cuando se introduce incertidumbre multiplicativa en la función de reducción de costes, que se supone lineal a trozos. En la literatura previa no se estudia el caso de incertidumbre en esta función. Se considera un monopolista, con una función de demanda lineal La política óptima para el problema resultante es lineal a trozos. Además, el output óptimo crece con el coste unitario para ciertos valores del mismo. Se proporcionan ejemplos numéricos.</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">https://creativecommons.org/licenses/by-nc-sa/3.0/es/</mods:accessCondition>
   <mods:accessCondition type="useAndReproduction">open access</mods:accessCondition>
   <mods:accessCondition type="useAndReproduction">Atribución-NoComercial-CompartirIgual 3.0 España</mods:accessCondition>
   <mods:titleInfo>
      <mods:title>A solution method for a class of learning by doing models with multiplicative uncertainty</mods:title>
   </mods:titleInfo>
   <mods:genre>technical report</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>