Linearizing Geometric Programs

Cited in

(39)

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