COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING

An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programmin...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Bradley, John [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2011

Übergeordnetes Werk:	Enthalten in: Engineering optimization - London : Taylor & Francis, 1974, 3(1978), 3, Seite 121-145
Übergeordnetes Werk:	number:3 ; volume:3 ; year:1978 ; pages:121-145

Links:	Link aufrufen

DOI / URN:	10.1080/03052157808902386

Katalog-ID:	NLEJ252827481

Internformat


LEADER	01000naa a22002652 4500
001	NLEJ252827481
003	DE-627
005	20231206143405.0
007	cr uuu---uuuuu
008	231206s2011 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1080/03052157808902386 \|2 doi
035			\|a (DE-627)NLEJ252827481
035			\|a (TFO)771644063
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
100	1		\|a Bradley, John \|e verfasserin \|4 aut
245	1	0	\|a COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING
264		1	\|c 2011
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently.
773	0	8	\|i Enthalten in \|t Engineering optimization \|d London : Taylor & Francis, 1974 \|g 3(1978), 3, Seite 121-145 \|h Online-Ressource \|w (DE-627)NLEJ252821750 \|w (DE-600)2029191-7 \|w (DE-576)273879715 \|x 1029-0273 \|7 nnns
773	1	8	\|g number:3 \|g volume:3 \|g year:1978 \|g pages:121-145
856	4	0	\|u https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad \|x Digitalisierung \|z Deutschlandweit zugänglich
912			\|a ZDB-1-TFO
912			\|a GBV_NL_ARTICLE
951			\|a AR
952			\|e 3 \|d 3 \|j 1978 \|h 121-145

Indexfelder

author_variant	j b jb
matchkey_str	article:10290273:2011----::opttoaapcsfemtipormigpln
hierarchy_sort_str	2011
publishDate	2011
allfields	10.1080/03052157808902386 doi (DE-627)NLEJ252827481 (TFO)771644063 DE-627 ger DE-627 rda eng Bradley, John verfasserin aut COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently. Enthalten in Engineering optimization London : Taylor & Francis, 1974 3(1978), 3, Seite 121-145 Online-Ressource (DE-627)NLEJ252821750 (DE-600)2029191-7 (DE-576)273879715 1029-0273 nnns number:3 volume:3 year:1978 pages:121-145 https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 3 3 1978 121-145
spelling	10.1080/03052157808902386 doi (DE-627)NLEJ252827481 (TFO)771644063 DE-627 ger DE-627 rda eng Bradley, John verfasserin aut COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently. Enthalten in Engineering optimization London : Taylor & Francis, 1974 3(1978), 3, Seite 121-145 Online-Ressource (DE-627)NLEJ252821750 (DE-600)2029191-7 (DE-576)273879715 1029-0273 nnns number:3 volume:3 year:1978 pages:121-145 https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 3 3 1978 121-145
allfields_unstemmed	10.1080/03052157808902386 doi (DE-627)NLEJ252827481 (TFO)771644063 DE-627 ger DE-627 rda eng Bradley, John verfasserin aut COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently. Enthalten in Engineering optimization London : Taylor & Francis, 1974 3(1978), 3, Seite 121-145 Online-Ressource (DE-627)NLEJ252821750 (DE-600)2029191-7 (DE-576)273879715 1029-0273 nnns number:3 volume:3 year:1978 pages:121-145 https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 3 3 1978 121-145
allfieldsGer	10.1080/03052157808902386 doi (DE-627)NLEJ252827481 (TFO)771644063 DE-627 ger DE-627 rda eng Bradley, John verfasserin aut COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently. Enthalten in Engineering optimization London : Taylor & Francis, 1974 3(1978), 3, Seite 121-145 Online-Ressource (DE-627)NLEJ252821750 (DE-600)2029191-7 (DE-576)273879715 1029-0273 nnns number:3 volume:3 year:1978 pages:121-145 https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 3 3 1978 121-145
allfieldsSound	10.1080/03052157808902386 doi (DE-627)NLEJ252827481 (TFO)771644063 DE-627 ger DE-627 rda eng Bradley, John verfasserin aut COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently. Enthalten in Engineering optimization London : Taylor & Francis, 1974 3(1978), 3, Seite 121-145 Online-Ressource (DE-627)NLEJ252821750 (DE-600)2029191-7 (DE-576)273879715 1029-0273 nnns number:3 volume:3 year:1978 pages:121-145 https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 3 3 1978 121-145
language	English
source	Enthalten in Engineering optimization 3(1978), 3, Seite 121-145 number:3 volume:3 year:1978 pages:121-145
sourceStr	Enthalten in Engineering optimization 3(1978), 3, Seite 121-145 number:3 volume:3 year:1978 pages:121-145
format_phy_str_mv	Article
institution	findex.gbv.de
isfreeaccess_bool	false
container_title	Engineering optimization
authorswithroles_txt_mv	Bradley, John @@aut@@
publishDateDaySort_date	1978-01-01T00:00:00Z
hierarchy_top_id	NLEJ252821750
id	NLEJ252827481
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">NLEJ252827481</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231206143405.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231206s2011 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03052157808902386</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ252827481</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(TFO)771644063</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bradley, John</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Engineering optimization</subfield><subfield code="d">London : Taylor & Francis, 1974</subfield><subfield code="g">3(1978), 3, Seite 121-145</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ252821750</subfield><subfield code="w">(DE-600)2029191-7</subfield><subfield code="w">(DE-576)273879715</subfield><subfield code="x">1029-0273</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">number:3</subfield><subfield code="g">volume:3</subfield><subfield code="g">year:1978</subfield><subfield code="g">pages:121-145</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad</subfield><subfield code="x">Digitalisierung</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-TFO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="e">3</subfield><subfield code="d">3</subfield><subfield code="j">1978</subfield><subfield code="h">121-145</subfield></datafield></record></collection>
author	Bradley, John
spellingShingle	Bradley, John COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING
authorStr	Bradley, John
ppnlink_with_tag_str_mv	@@773@@(DE-627)NLEJ252821750
format	electronic Article
delete_txt_mv	keep
author_role	aut
collection	NL
remote_str	true
illustrated	Not Illustrated
issn	1029-0273
topic_title	COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Engineering optimization
hierarchy_parent_id	NLEJ252821750
hierarchy_top_title	Engineering optimization
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)NLEJ252821750 (DE-600)2029191-7 (DE-576)273879715
title	COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING
ctrlnum	(DE-627)NLEJ252827481 (TFO)771644063
title_full	COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING
author_sort	Bradley, John
journal	Engineering optimization
journalStr	Engineering optimization
lang_code	eng
isOA_bool	false
recordtype	marc
publishDateSort	2011
contenttype_str_mv	txt
container_start_page	121
author_browse	Bradley, John
container_volume	3
format_se	Elektronische Aufsätze
author-letter	Bradley, John
doi_str_mv	10.1080/03052157808902386
title_sort	computational aspects of geometric programming 2. polynomial programming
title_auth	COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING
abstract	An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently.
abstractGer	An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently.
abstract_unstemmed	An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently.
collection_details	ZDB-1-TFO GBV_NL_ARTICLE
container_issue	3
title_short	COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING
url	https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad
remote_bool	true
ppnlink	NLEJ252821750
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1080/03052157808902386
up_date	2024-07-05T21:58:12.590Z
_version_	1803777938650300416
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">NLEJ252827481</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231206143405.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231206s2011 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03052157808902386</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ252827481</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(TFO)771644063</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bradley, John</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">An attempt is made to examine the computational aspects of Geometric Programming within a systematic framework. The many numerical algorithms, which have been proposed, and used extensively on practical optimization problems, are considered in relation to developments in general Nonlinear Programming. An effort is made to provide explanations for some of the computational results reported in the literature for specific Polynomial Programming codes and general conclusions on the question of computational efficiency are drawn. The restricted case of “Posynomial“ Programming is considered in detail first, since it forms the core of algorithms used to solve the general Signomial case, which is dealt with subsequently.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Engineering optimization</subfield><subfield code="d">London : Taylor & Francis, 1974</subfield><subfield code="g">3(1978), 3, Seite 121-145</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ252821750</subfield><subfield code="w">(DE-600)2029191-7</subfield><subfield code="w">(DE-576)273879715</subfield><subfield code="x">1029-0273</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">number:3</subfield><subfield code="g">volume:3</subfield><subfield code="g">year:1978</subfield><subfield code="g">pages:121-145</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tib.eu/de/suchen/id/tandf%3A37a99331016a0f1e97676d662f21e20539e1e7ad</subfield><subfield code="x">Digitalisierung</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-TFO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="e">3</subfield><subfield code="d">3</subfield><subfield code="j">1978</subfield><subfield code="h">121-145</subfield></datafield></record></collection>
score	7.400222

Nicht das Richtige dabei?

Schreiben Sie uns!

COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 2. POLYNOMIAL PROGRAMMING

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?