Linearizing Geometric Programs
From MaRDI portal
Publication:5638138
DOI10.1137/1012043zbMath0229.90047OpenAlexW2057974838MaRDI QIDQ5638138
Publication date: 1970
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d825b7238d1ddec0060c29b03720f5231a72589c
Related Items (38)
An efficient convexification method for solving generalized geometric problems ⋮ Optimizing the number of tools and cutting parameters in multi-tool turning for multiple objectives through geometric programming ⋮ A moment-matching method to generate arbitrage-free scenarios ⋮ The complexity of routing in~hierarchical PNNI networks ⋮ Geometric compromise programming: application in portfolio selection ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ The proximity of (algebraic) geometric programming to linear programming ⋮ Convex analysis treated by linear programming ⋮ A review of deterministic optimization methods in engineering and management ⋮ An alternative linearization technique ⋮ Spherical Fuzzy Geometric Programming Problem ⋮ An alternative approach to the refined duality theory of geometric programming ⋮ Linear Programming Approach to Solve Geometric Programming Problem ⋮ On subsidiary problems in geometric programming ⋮ A condensation method for generalized geometric programming ⋮ Discrete solutions to engineering design problems ⋮ On a classification scheme for geometric programming and complementarity theorems†† ⋮ Computational aspects of cutting-plane algorithms for geometric programming problems ⋮ Temperature-aware floorplanning via geometric programming ⋮ 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 ⋮ Convexity of products of univariate functions and convexification transformations for geometric programming ⋮ Constrained maximization of posynomials by geometric programming ⋮ A monomial‐based method for non‐linear structural analysis ⋮ Condensing generalized polynomials ⋮ Condensing generalized polynomials ⋮ A tutorial on geometric programming ⋮ Some remarks on condensation methods for geometric programs ⋮ Posynomial geometric programming as a special case of semi-infinite linear programming ⋮ Geometric programming with signomials ⋮ A Lagrangian property for homogeneous programs ⋮ On solving a primal geometric program by partial dual optimization ⋮ Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems ⋮ A new algorithm for geometric programming based on the linear structure of its dual problem. ⋮ On geometric programming and complementary slackness
This page was built for publication: Linearizing Geometric Programs
