<?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-27T22:46:00Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/57349" metadataPrefix="mets">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/57349</identifier><datestamp>2024-07-08T15:45:46Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><mets xmlns="http://www.loc.gov/METS/" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" ID="&#xa;&#x9;&#x9;&#x9;&#x9;DSpace_ITEM_20.500.14352-57349" TYPE="DSpace ITEM" PROFILE="DSpace METS SIP Profile 1.0" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd" OBJID="&#xa;&#x9;&#x9;&#x9;&#x9;hdl:20.500.14352/57349">
   <metsHdr CREATEDATE="2026-06-28T00:46:00Z">
      <agent ROLE="CUSTODIAN" TYPE="ORGANIZATION">
         <name>Docta Complutense</name>
      </agent>
   </metsHdr>
   <dmdSec ID="DMD_20.500.14352_57349">
      <mdWrap MDTYPE="MODS">
         <xmlData xmlns:mods="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
            <mods:mods xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
               <mods:name>
                  <mods:role>
                     <mods:roleTerm type="text">author</mods:roleTerm>
                  </mods:role>
                  <mods:namePart>Alonso Morón, Manuel</mods:namePart>
               </mods:name>
               <mods:name>
                  <mods:role>
                     <mods:roleTerm type="text">author</mods:roleTerm>
                  </mods:role>
                  <mods:namePart>Romero López, Carlos</mods:namePart>
               </mods:name>
               <mods:name>
                  <mods:role>
                     <mods:roleTerm type="text">author</mods:roleTerm>
                  </mods:role>
                  <mods:namePart>Romero Ruiz Del Portal, Francisco</mods:namePart>
               </mods:name>
               <mods:extension>
                  <mods:dateAccessioned encoding="iso8601">2023-06-20T16:53:34Z</mods:dateAccessioned>
               </mods:extension>
               <mods:extension>
                  <mods:dateAvailable encoding="iso8601">2023-06-20T16:53:34Z</mods:dateAvailable>
               </mods:extension>
               <mods:originInfo>
                  <mods:dateIssued encoding="iso8601">1996</mods:dateIssued>
               </mods:originInfo>
               <mods:identifier type="citation">Alonso Morón, M., Romero López, C., Romero Ruiz Del Portal, F. «Generating Well-Behaved Utility Functions for Compromise Programming». Journal of Optimization Theory and Applications, vol. 91, n.o 3, diciembre de 1996, pp. 643-49. DOI.org (Crossref), https://doi.org/10.1007/BF02190125.</mods:identifier>
               <mods:identifier type="issn">0022-3239</mods:identifier>
               <mods:identifier type="doi">10.1007/BF02190125</mods:identifier>
               <mods:identifier type="uri">https://hdl.handle.net/20.500.14352/57349</mods:identifier>
               <mods:identifier type="officialurl">https//doi.org/10.1007/BF02190125</mods:identifier>
               <mods:identifier type="relatedurl">http://www.springerlink.com/content/u514831p35p6h551/</mods:identifier>
               <mods:abstract>The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.</mods:abstract>
               <mods:language>
                  <mods:languageTerm authority="rfc3066"/>
               </mods:language>
               <mods:accessCondition type="useAndReproduction"/>
               <mods:titleInfo>
                  <mods:title>Generating well-behaved utility functions for compromise programming</mods:title>
               </mods:titleInfo>
               <mods:genre>journal article</mods:genre>
            </mods:mods>
         </xmlData>
      </mdWrap>
   </dmdSec>
   <structMap LABEL="DSpace Object" TYPE="LOGICAL">
      <div TYPE="DSpace Object Contents" ADMID="DMD_20.500.14352_57349"/>
   </structMap>
</mets></metadata></record></GetRecord></OAI-PMH>