Geometric Programming
Wiley Encyclopedia of Electrical and Electronics EngineeringPublished 27 December 1999
Elmor L. Peterson, Gerhard Plenert
Citations14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Abstract The sections in this article are An Elementary Example: the Optimal Design of a Power Line Generalized Polynomials Traditional Calculus and Numerical Approaches The Geometric Programming Approach Unconstrained Posynomial Minimization VIA Geometric Programming: The General Case An Important Example: Entropy Optimization in Information Theory, Thermodynamics, and Statistical Mechanics
Keywords
MathematicsPhysics and Astronomy
SIAM Journal on Applied MathematicsComplementary Geometric Programming
195 Citations1970Mordecai Avriel, Adrian Williams
Journal of Optimization Theory and ApplicationsGeometric programming with signomials
134 Citations1973R. J. Duffin, Elmor L. Peterson
Proceedings of the National Academy of SciencesA MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
71 Citations1961Clarence Zener
Mathematical Problems in EngineeringEngineering Design by Geometric Programming
68 Citations2013Chia-Hui Huang
This study proposes an optimization approach to convert all signomial terms in GP into convex and concave terms and shows that the proposed method is much more efficient and faster than the conventional one, especially when the number of break points becomes large.
Journal of the Society for Industrial and Applied MathematicsDual Programs and Minimum Cost
37 Citations1962R. J. Duffin
SIAM Journal on Applied MathematicsSymmetric Duality for Generalized Unconstrained Geometric Programming
36 Citations1970Elmor L. Peterson
Operations ResearchCost Minimization Problems Treated by Geometric Means
35 Citations1962R. J. Duffin
Proceedings of the National Academy of SciencesA FURTHER MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
28 Citations1962Clarence Zener
Mathematical ProgrammingThe proximity of (algebraic) geometric programming to linear programming
13 Citations1972R. J. Duffin, Elmor L. Peterson
This note reduces algebraic programming to geometric programming with (posy)binomials, which is known to be synonomous with linear programming.
The Journal of Physical ChemistryGeometric programming and the Darwin-Fowler method in statistical mechanics
11 Citations1970R. J. Duffin, Clarence Zener
Proceedings of the National Academy of SciencesGEOMETRIC PROGRAMMING, CHEMICAL EQUILIBRIUM, AND THE ANTI-ENTROPY FUNCTION
11 Citations1969R. J. Duffin, Clarence Zener
A direct proof of (2) is given by the duality theorem of geometric programming states that minimum cost = maximum anti-cost, which is equivalent to minimum F = maximum F(*), where F is the Helmholtz function for free energy and F(*) is an anti-Helmholtzfunction.
Proceedings of the National Academy of SciencesMINIMIZATION OF SYSTEM COSTS IN TERMS OF SUBSYSTEM COSTS
11 Citations1964Clarence Zener
IEEE Transactions on Military ElectronicsAn Example of Design for Minimum Total Cost, Counter-Flow Heat Exchangers
4 Citations1964Clarence Zener
Journal of Applied PhysicsOptimization and insight by geometric programming
4 Citations1986R. J. Duffin, Elmor L. Peterson
The main ideas of geometric programming are introduced via elementary examples drawn from engineering design, operations research, chemical equilibrium, entropy maximization, and statistical inference.