Correcting Convexity Proofs for Two Signomial Functions in Geometric Programming
Open Access
- 18 April 2025
- journal article
- Published by Mesopotamian Academic Press in Applied Data Science and Analysis
- Vol. 2025, 125-131
Abstract
Geometric programming (GP) is a powerful framework for optimizing posynomial and signomial functions, which are widely used in engineering design, economics, and other fields. A critical aspect of solving geometric programs efficiently lies in understanding the convexity properties of the functions involved, as convexity ensures that local minima are also global minima. This work focuses on correcting and verifying the convexity proofs for two specific signomial functions in geometric programming: f 1 (x)=x 1 2 x 2 −1 +x 2 3 −x 1 x 2 and f₂(x) = x₁³x₂⁻² + x₁⁻¹x₂² - x₁x₂⁻¹. Through a detailed analysis, we demonstrate that f1(x) is **not convex** over the domain (x1,x2)> 0, as its Hessian matrix fails to be positive semi-definite for all positive values of x1and x2. For f2(x), the convexity **cannot be conclusively determined** based on the analysis, as the logarithmic transformation does not universally preserve convexity for signomial functions with negative coefficients. Specific cases suggest local convexity, but a general proof for all (x1,x2)> 0 remains elusive. These results highlight the challenges in analyzing signomial functions and emphasize the importance of rigorous convexity verification in geometric programming. The findings have significant implications for optimization feasibility and modeling considerations, particularly in applications where signomial functions with negative coefficients arise. This work provides a foundation for further research into advanced techniques for analyzing and optimizing such functions, ensuring more robust and reliable solutions in geometric programming.Keywords
This publication has 5 references indexed in Scilit:
- On generalized geometric programming problems with non-positive variablesEuropean Journal of Operational Research, 2007
- An optimization approach for solving signomial discrete programming problems with free variablesComputers & Chemical Engineering, 2006
- Treating Free Variables in Generalized Geometric Global Optimization ProgramsJournal of Global Optimization, 2005
- Global optimization for signomial discrete programming problems in engineering designEngineering Optimization, 2002
- Finding all solutions of nonlinearly constrained systems of equationsJournal of Global Optimization, 1995