An efficient global approach for posynomial geometric programming problems
From MaRDI portal
Publication:2899141
DOI10.1287/IJOC.1100.0403zbMATH Open1243.90181OpenAlexW2125221547MaRDI QIDQ2899141FDOQ2899141
Authors: Jung-Fa Tsai, Ming-Hua Lin 
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1100.0403
Recommendations
- Solving posynomial geometric programming problems via generalized linear programming
- An approximate algorithm for global solution of generalized geometric programming
- A new global optimization algorithm for solving generalized geometric programming
- A new global optimization algorithm for solving generalized geometric programming
- Global optimization of generalized geometric programming
- A deterministic global optimization algorithm for generalized geometric programming
- Geometric Programming for Optimal Positive Linear Systems
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- scientific article; zbMATH DE number 2052076
- Global optimization of signomial geometric programming problems
global optimizationsignomial geometric programmingpiecewise linear functionconvex underestimationposynomial geometric programming
Cited In (14)
- A global interior point method for nonconvex geometric programming
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- Structural optimization using single-term posynomial geometric programming
- Global optimization of signomial geometric programming problems
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- A reformulation framework for global optimization
- Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
- A review of deterministic optimization methods in engineering and management
- Convex relaxation for solving posynomial programs
- Finding all global optima of engineering design problems with discrete signomial terms
- Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
- An efficient convexification method for solving generalized geometric problems
- Branch-reduction-bound algorithm for generalized geometric programming
This page was built for publication: An efficient global approach for posynomial geometric programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899141)
