Duality Theory for Geometric Programming

DOI10.1137/0114105zbMATH Open0203.21902OpenAlexW2068677961MaRDI QIDQ5602033FDOQ5602033

Authors: Elmor L. Peterson, Richard J. Duffin 

Publication date: 1966

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0114105

Cited In (20)

• Global optimization for generalized geometric programming problems with discrete variables
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• Optimal value bounds in nonlinear programming with interval data
• Signomial dual Kuhn-Tucker intervals
• Geometric programming: A unified duality theory for quadratically constrained quadratic programs and 𝑙_{𝑝}-constrained 𝑙_{𝑝}-approximation problems
• On a classification scheme for geometric programming and complementarity theorems†^†
• A comparison of computational strategies for geometric programs
• A framework for globally optimizing mixed-integer signomial programs
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems
• Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
• Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
• A global optimization algorithm for signomial geometric programming problem
• Global optimization of mixed-integer signomial programming problems
• Convexity of products of univariate functions and convexification transformations for geometric programming
• A review of deterministic optimization methods in engineering and management
• Interval arithmetic in unidimensional signomial programming
• Effectiveness of a geometric programming algorithm for optimization of machining economics models
• A modified convace simplex algorithm for geometric programming
• Strong solvability of restricted interval systems and its applications in quadratic and geometric programming
• An efficient convexification method for solving generalized geometric problems

This page was built for publication: Duality Theory for Geometric Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5602033)