Linearizing Geometric Programs

Cited in

(39)

Current state of the art of algorithms and computer software for geometric programming
An alternative linearization technique
A Lagrangian property for homogeneous programs
On condensed geometric programming in structural optimisation
Some remarks on condensation methods for geometric programs
Linear Programming Approach to Solve Geometric Programming Problem
Constrained maximization of posynomials by geometric programming
Transcendental geometric programs
A condensation method for generalized geometric programming
Posynomial geometric programming as a special case of semi-infinite linear programming
A monomial‐based method for non‐linear structural analysis
A tutorial on geometric programming
On a classification scheme for geometric programming and complementarity theorems†^†
A moment-matching method to generate arbitrage-free scenarios
Optimal design of a dry-type natural-draft cooling tower by geometric programming
A comparison of computational strategies for geometric programs
Multi-parametric disaggregation technique for global optimization of polynomial programming problems
On geometric programming and complementary slackness
Temperature-aware floorplanning via geometric programming
Geometric compromise programming: application in portfolio selection
Convex analysis treated by linear programming
On solving a primal geometric program by partial dual optimization
Convexity of products of univariate functions and convexification transformations for geometric programming
Computational aspects of cutting-plane algorithms for geometric programming problems
A review of deterministic optimization methods in engineering and management
Geometric programming with signomials
Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems
An alternative approach to the refined duality theory of geometric programming
On subsidiary problems in geometric programming
A new algorithm for geometric programming based on the linear structure of its dual problem.
Spherical fuzzy geometric programming problem
The complexity of routing in~hierarchical PNNI networks
Discrete solutions to engineering design problems
The proximity of (algebraic) geometric programming to linear programming
An efficient convexification method for solving generalized geometric problems
Condensing generalized polynomials
Cutting planes for signomial programming
Condensing generalized polynomials
Optimizing the number of tools and cutting parameters in multi-tool turning for multiple objectives through geometric programming

This page was built for publication: Linearizing Geometric Programs

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