Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Dual to primal conversion in geometric programming (1978)
    Springer
    Journal of optimization theory and applications 26 (1978), S. 243-252 
    Details
    ISSN: 1573-2878
    Keywords: Geometric programming ; duality ; subsidiary problems ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The aim of this paper is not to derive new results, but rather to provide insight that will hopefully aid researchers involved in the design and coding of algorithms for geometric programs. The main contributions made here are: (i) a computationally useful interpretation of the Lagrange multipliers associated with the dual orthogonality constraints, (ii) a computationally useful interpretation of the Lagrange multiplier associated with the dual normality constraint, and (iii) an analysis of the much-avoided issue of subsidiary problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00933405
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Current state of the art of algorithms and computer software for geometric programming (1978)
    Springer
    Journal of optimization theory and applications 26 (1978), S. 149-183 
    Details
    ISSN: 1573-2878
    Keywords: Geometric programming ; state of the art ; signomial programhing ; nonlinear programming ; software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper attempts to consolidate over 15 years of attempts at designing algorithms for geometric programming (GP) and its extensions. The pitfalls encountered when solving GP problems and some proposed remedies are discussed in detail. A comprehensive summary of published software for the solution of GP problems is included. Also included is a numerical comparison of some of the more promising recently developed computer codes for geometric programming on a specially chosen set of GP test problems. The relative performance of these codes is measured in terms of their robustness as well as speed of computation. The performance of some general nonlinear programming (NLP) codes on the same set of test problems is also given and compared with the results for the GP codes. The paper concludes with some suggestions for future research.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00933402
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...