Abstract
Richard J. Duffin and Elmor L. Peterson introduced the term “signomial” in their original joint work general algebraic optimization, published in the late 1960s and early 1970s. An ongoing introductory exposition is optimization problems. In spite of the fact that nonlinear optimization problems with constraints and/or objectives defined by signomials are normally harder to unravel than those defined by posynomials (in light of the fact that not at all like posynomials, signomials are not ensured to be globally convex) but a signomial optimization problem, often give a substantially more accurate mathematical representation of present real-world, nonlinear optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Avriel, A.C. Williams, An extension of geometric programming with applications in engineering optimization. J. Eng. Math. 5(2), 187–194 (1971)
R.J. Duffin, E.L. Peterson, Duality theory for geometric programming. SIAM J. Appl. Math. 14, 1307–1349 (1966)
R.J. Duffin, E.L. Peterson, Geometric programming with signomials. J. Optim. Theory Appl. 11, 3–35 (1973)
R. Horst, H. Tuy, Global Optimization: Deterministic Approaches, 2nd edn. (Springer, Berlin, 1993)
R. Horst, P.M. Pardalos, N.V. Thoai, Introduction to Global Optimization (Kluwer Academic Publishers, Dordrecht, 2000)
T.R. Jefferson, C.H. Scott, Generalized geometric programming applied to problems of optimal control. I. Theory. J. Optim. Theory Appl. 26(1), 117–129 (1978)
C.D. Maranas, C.A. Floudas, Finding All Solutions of Nonlinearly Constrained Systems of Equations, J. Global Optim. 7, 143–182 (1995)
U. Passy, D.J. Wilde, Generalized polynomial optimization. SIAM J. Appl. Math. 15, 1344–1356 (1967)
S.-J. Qu, K.-C. Zhang, Y. Ji, A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation. Appl. Math. Comput. 184(2), 886–894 (2007)
M.J. Rijckaert, X.M. Martens, Comparison of generalized geometric programming algorithms. J. Optim. Theory Appl. 26, 205–241 (1978)
H.D. Sherali, Global optimization of nonconvex polynomial programming problems having rational exponents. J. Global Optim. 12(3), 267–283 (1998)
H.D. Sherali, C.H. Tuncbilek, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2(1), 101–112 (1992)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Islam, S., Mandal, W.A. (2019). Signomial Geometric Programming (GP) Problem. In: Fuzzy Geometric Programming Techniques and Applications. Forum for Interdisciplinary Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-13-5823-4_2
Download citation
DOI: https://doi.org/10.1007/978-981-13-5823-4_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-5822-7
Online ISBN: 978-981-13-5823-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)