Duality Theory for Geometric Programming

From MaRDI portal
Revision as of 03:55, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5602033

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 (19)

An efficient convexification method for solving generalized geometric problemsGlobal Optimization of Mixed-Integer Signomial Programming ProblemsA general algorithm for solving generalized geometric programming with nonpositive degree of difficultyIndicator of power convex and exponential transformations for solving nonlinear problems containing posynomial termsSignomial dual Kuhn-Tucker intervalsA framework for globally optimizing mixed-integer signomial programsMulti-parametric disaggregation technique for global optimization of polynomial programming problemsOptimal value bounds in nonlinear programming with interval dataA review of deterministic optimization methods in engineering and managementA global optimization algorithm for signomial geometric programming problemA modified convace simplex algorithm for geometric programmingOn a classification scheme for geometric programming and complementarity theorems†Interval arithmetic in unidimensional signomial programmingA comparison of computational strategies for geometric programsConvexity of products of univariate functions and convexification transformations for geometric programmingGeometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)Effectiveness of a geometric programming algorithm for optimization of machining economics modelsGlobal optimization for generalized geometric programming problems with discrete variablesGeometric programming: A unified duality theory for quadratically constrained quadratic programs and 𝑙_{𝑝}-constrained 𝑙_{𝑝}-approximation problems







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