Geometric programming with signomials
From MaRDI portal
Publication:2553387
DOI10.1007/BF00934288zbMATH Open0238.90069OpenAlexW2051572921MaRDI QIDQ2553387FDOQ2553387
Authors: Richard J. Duffin, Elmor L. Peterson 
Publication date: 1973
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934288
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linearizing Geometric Programs
- Duality and stability in extremum problems involving convex functions
- Generalized Polynomial Optimization
- Title not available (Why is that?)
- A MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
- A FURTHER MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS
- Symmetric Duality for Generalized Unconstrained Geometric Programming
- Title not available (Why is that?)
- Condensing generalized polynomials
- Use of Geometric Programming to Maximize Reliability Achieved by Redundancy
- Constrained maximization of posynomials by geometric programming
- Title not available (Why is that?)
- A CONVEX APPROXIMANT METHOD FOR NONCONVEX EXTENSIONS OF GEOMETRIC PROGRAMMING
Cited In (56)
- Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions
- Algebraic Perspectives on Signomial Optimization
- Real tropicalization and negative faces of the Newton polytope
- Geometry of the signed support of a multivariate polynomial and Descartes' rule of signs
- An alternative linearization technique
- Current state of the art of algorithms and computer software for geometric programming
- Global optimization for generalized geometric programming problems with discrete variables
- On condensed geometric programming in structural optimisation
- Some remarks on condensation methods for geometric programs
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
- Range division and contraction algorithm for a class of global optimization problems
- Relative entropy relaxations for signomial optimization
- A condensation method for generalized geometric programming
- An interval programming approach for developing economic order quantity model with imprecise exponents and coefficients
- A monomial‐based method for non‐linear structural analysis
- Impossibility of extending Pólya's theorem to ``forms with arbitrary real exponents
- Global solutions to fractional programming problem with ratio of nonconvex functions
- Signomial dual Kuhn-Tucker intervals
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- Global optimization for special reverse convex programming
- Quality assurance and stage dynamics in multi-stage manufacturing. Part II
- Selected applications of all-quadratic programming
- Optimal design of a dry-type natural-draft cooling tower by geometric programming
- Economic dispatch of thermal power systems using geometric programming
- Global optimization for a class of fractional programming problems
- A comparison of computational strategies for geometric programs
- Posynomial parametric geometric programming with interval valued coefficient
- Global optimization of generalized geometric programming
- Comparison of generalized geometric programming algorithms
- A framework for globally optimizing mixed-integer signomial programs
- Duality of a nonconvex sum of ratios
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- The dual of the dual as an approximation of the primal
- La programacion geometrica en la economia de las producciones ganaderas
- A global optimization algorithm for signomial geometric programming problem
- Convexity of products of univariate functions and convexification transformations for geometric programming
- A geometric programming approach to the Van der Waerden conjecture on doubly stochastic matrices
- An efficient method for solving multi-objective signomial programming problems in real life
- On generalizing Descartes' rule of signs to hypersurfaces
- Solving geometric programming problems with normal, linear and zigzag uncertainty distributions
- A review of deterministic optimization methods in engineering and management
- Virtuous smoothing for global optimization
- Approximation of multivariate function by using new multivariate Bernstein \(\alpha\)-polynomials
- A nonisolated optimal solution for special reverse convex programming problems
- Posynomial geometric programming with parametric uncertainty
- Un nuevo algoritmo en programacion signomial
- Nonlinear programming: Global use of the Lagrangian
- Credal networks
- A modified convace simplex algorithm for geometric programming
- The proximity of (algebraic) geometric programming to linear programming
- A computational study of methods for solving polynomial geometric programs
- An efficient convexification method for solving generalized geometric problems
- Reversed geometric programming: A branch-and-bound method involving linear subproblems
- A comparison of the monomial method and the S-system method for solving systems of algebraic equations
- A deterministic global optimization algorithm for generalized geometric programming
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
This page was built for publication: Geometric programming with signomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553387)
