zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Global optimization of signomial geometric programming using linear relaxation. (English) Zbl 1053.90112
Summary: Various local optimization approaches have been developed for solving Signomial Geometric Programming (SGP) problems. But up to now, less work has been devoted to solving global optimization of SGP due to the inherent difficulty. This paper considers the global minimum of SGP that arise in various practice problems. By utilizing an exponential variable transformation and tangential hypersurfaces and convex envelop approximations a linear relaxation of SGP is then obtained. Thus initial nonconvex nonlinear problem SGP is reduced to a sequence of linear programming problems through the successive refinement of a linear relaxation of feasible region of the objective function. The proposed algorithm is convergent to the global minimum of SGP by means of the subsequent solutions of a series of linear programming problems. Test results indicate that the proposed algorithm is extremely robust and can be used successfully to solve global minimum of SGP on a microcomputer.

MSC:
90C26Nonconvex programming, global optimization
90C57Polyhedral combinatorics, branch-and-bound, branch-and-cut
WorldCat.org
Full Text: DOI
References:
[1] Horst, R.; Tuy, H.: Global optimization: deterministic approaches. (1993) · Zbl 0704.90057
[2] Floudas, C. A.; Visweswaran, V.: Quadratic optimization. Handbook of global optimization, nonconvex optimization and its applications, 217-270 (1995) · Zbl 0833.90091
[3] Ecker, J. G.: Geometric programming: methods, computations and applications. SIAM review 22, 338-362 (1980) · Zbl 0438.90088
[4] Avriel, M.; Williams, A. C.: An extension of geometric programming with applications in engineering optimization. Journal of engineering mathematics 5, No. 3, 187-199 (1971)
[5] Jefferson, T. R.; Scott, C. H.: Generalized geometric programming applied to problems of optimal control: I. Theory. Journal of optimization theory and applications 26, 117-128 (1978) · Zbl 0369.90120
[6] Sui, Y. -K: The expansion of functions under transformation and its application to optimization. Computer methods in applied mechanics and engineering 113, 253-262 (1994) · Zbl 0847.73076
[7] Das, K.; Roy, T. K.; Maiti, M.: Multi-item inventory model with under imprecise objective and restrictions: a geometric programming approach. Production planning & control 11, No. 8, 781-788 (2000)
[8] Hansen, P.; Jaumard, B.: Reduction of indefinite quadratic programs to bilinear programs. Journal of global optimization 2, No. 1, 41-60 (1992) · Zbl 0786.90050
[9] Beightler, C. S.; Phillips, D. T.: Applied geometric programming. (1976) · Zbl 0344.90034
[10] Passy, U.: Generalized weighted mean programming. SIAM journal on applied mathematics 20, 763-778 (1971) · Zbl 0233.90021
[11] Passy, U.; Wilde, D. J.: Generalized polynomial optimization. Journal on applied mathematics 15, No. 5, 1344-1356 (1967) · Zbl 0171.18002
[12] Kortanek, K. O.; Xu, X.; Ye, Y.: An infeasible interior-point algorithm for solving primal and dual geometric programs. Math. program. 76, 155-181 (1997) · Zbl 0881.90106
[13] Sherali, H. D.; Tuncbilek, C. H.: A global optimization algorithm for polynomial programming problems using a reformulation--linearzation technique. Journal of global optimization 2, 101-112 (1992) · Zbl 0787.90088
[14] Sherali, H. D.; Tuncbilek, C. H.: A reformulation--convexification approach for solving nonconvex quadratic programming problems. Journal of global optimization 7, 1-31 (1995) · Zbl 0844.90064
[15] Maranas, C. D.; Floudas, C. A.: Global optimization in generalized geometric programming. Computers and chemical engineering 21, No. 4, 351-369 (1997)
[16] Sherali, H. D.: Global optimization of nonconvex polynomial programming problems having rational exponents. Journal of global optimization 12, 267-283 (1998) · Zbl 0905.90146
[17] Horst, R.: Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization. Journal of optimization theory and applications 58, No. 1, 11-37 (1988) · Zbl 0621.90064
[18] Tuy, H.: Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms. Journal of global optimization 1, No. 1, 23-36 (1991) · Zbl 0744.90083
[19] Rijckaert, M. J.; Martens, X. M.: Comparison of generalized geometric programming algorithms. Journal of optimization theory and application 26, 205-241 (1978) · Zbl 0369.90112