<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://bc.itl.waw.pl/style/common/xsl/oai-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-18T18:23:35Z</responseDate>
	<request identifier="oai:bc.itl.waw.pl:531" metadataPrefix="oai_dc" verb="GetRecord">
	https://bc.itl.waw.pl/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:bc.itl.waw.pl:531</identifier>
	    <datestamp>2026-02-25T10:56:08Z</datestamp>
		  <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:072:0721</setSpec> 	      <setSpec>dLibraDigitalLibrary</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:071:PPIL</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:072</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:071</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="pl"><![CDATA[Direct method of hierarchical nonlinear optimization - reassessment after 30 years, Journal of Telecommunications and Information Technology, 2004, nr 3]]></dc:title>
<dc:creator><![CDATA[Karbowski, Andrzej]]></dc:creator>
<dc:subject xml:lang="pl"><![CDATA[decomposition]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[distributed com-putations]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Benders method]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[hierarchical optimization]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[the directmethod]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[cutting plane method]]></dc:subject>
<dc:description xml:lang="pl"><![CDATA[We consider the optimization problems which may be solved by the direct decomposition method. It is possible when the performance index is a monotone function of other performance indices, which depend on two subsets of decision variables: an individual for every inner performance index and a common one for all. Such problems may be treated as a generalization of separable problems with the additive cost and constraints functions. In the paper both the underlying theory and the basic numerical techniques are presented and compared. A special attention is paid to the guarantees of convergence in different classes of problems and to the effectiveness of calculations.]]></dc:description>
<dc:publisher><![CDATA[Instytut Łączności - Państwowy Instytut Badawczy, Warszawa]]></dc:publisher>
<dc:date><![CDATA[2004, nr 3]]></dc:date>
<dc:type xml:lang="pl"><![CDATA[artykuł]]></dc:type>
<dc:format xml:lang="pl"><![CDATA[application/pdf]]></dc:format>
<dc:identifier><![CDATA[http://bc.itl.waw.pl/Content/531/JTIT-2004_3_3.pdf]]></dc:identifier>
<dc:identifier><![CDATA[https://bc.itl.waw.pl/dlibra/publication/edition/531/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:bc.itl.waw.pl:531]]></dc:identifier>
<dc:source xml:lang="pl"><![CDATA[Journal of Telecommunications and Information Technology]]></dc:source>
<dc:language><![CDATA[ang]]></dc:language>
<dc:relation><![CDATA[oai:bc.itl.waw.pl:publication:593]]></dc:relation>
<dc:rights xml:lang="pl"><![CDATA[Biblioteka Naukowa Instytutu Łączności]]></dc:rights>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
