Duality Theory for Geometric Programming

DOI10.1137/0114105zbMath0203.21902OpenAlexW2068677961MaRDI QIDQ5602033

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

Related Items

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