Duality Theory for Geometric Programming

Cited in

(20)

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

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)