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)
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. (English) Zbl 0787.90088
Summary: This paper is concerned with the development of an algorithm to solve continuous polynomial programming problems for which the objective function and the constraints are specified polynomials. A linear programming relaxation is derived for the problem based on a Reformulation Linearization Technique (RLT), which generates nonlinear (polynomial) implied constraints to be included in the original problem, and subsequently linearizes the resulting problem by defining new variables, one for each distinct polynomial term. This construct is then used to obtain lower bounds in the context of a proposed branch and bound scheme, which is proven to convergence to a global optimal solution. A numerical example is presented to illustrate the proposed algorithm.

MSC:
90C30Nonlinear programming
90-08Computational methods (optimization)
WorldCat.org
Full Text: DOI
References:
[1] Al-Khayyal, F.A. and J.E., Falk (1983), Jointly Constrained Biconvex Programming, Math. of Oper. Res. 8, 273-286. · Zbl 0521.90087 · doi:10.1287/moor.8.2.273
[2] Al-Khayyal, F.A. (1990), Generalized Bilinear Programming: Part I. Models, Applications and Linear Programming Relaxation, Working Paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332. · Zbl 0784.90051
[3] Balas, E. and J.B., Mazzola (1984a), Nonlinear 0-1 Programming: I. Linearization Techniques, Math. Progr. 30, 1-21. · Zbl 0553.90067 · doi:10.1007/BF02591796
[4] Balas, E. and J.B., Mazzola (1984b), Nonlinear 0-1 Programming: II. Dominance Relations and Algorithms, Math. Progr. 30, 22-45. · Zbl 0553.90068 · doi:10.1007/BF02591797
[5] Floudas, C.A. and V., Visweswaran (1991), A Primal-Relaxed Dual Global Optimization Approach, Working Paper, Department of Chemical Engineering, Princeton University, Princeton, N.J. 08544-5263.
[6] Hansen, P., B., Jaumard, and V., Mathon (1989), Constrained Nonlinear 0-1 Programming, Working paper, EUTCOR, Rutgers University, Rutgers, New Jersey. · Zbl 0777.90033
[7] Horst, R. (1986), A General Class of Branch-and-Bound Methods in Global Optimization with Some New Approaches for Concave Minimization, JOTA 51, 271-291. · Zbl 0581.90073 · doi:10.1007/BF00939825
[8] Horst, R. (1990), Deterministic Methods in Constrained Global Optimization: Some Recent Advances and New Fields of Application, Naval Research Logistics Quarterly 37, 433-471. · Zbl 0709.90093 · doi:10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2
[9] Horst, R. and H., Tuy (1990), Global Optimization: Deterministic Approaches, Springer-Verlag, Berlin, Germany. · Zbl 0704.90057
[10] Pardalos, P.M. and J.B., Rosen (1987), Constrained Global Optimization: Algorithms and Applications, Springer-Verlag, Berlin. · Zbl 0638.90064
[11] Sherali, H.D. and W.P., Adams (1990), A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems, SIAM Journal on Discrete Mathematics 3, 411-430. · Zbl 0712.90050 · doi:10.1137/0403036
[12] Sherali, H.D. and W.P., Adams (1989), A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems, Working Paper, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061.
[13] Sherali, H.D. and A.R., Alameddine (1990), A New Reformulation-Linearization Technique for the Bilinear Programming and Related Problems, with Applications to Risk Management, Working Paper, Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061.
[14] Shor, N.Z. (1990), Dual Estimates In Multiextremal Problems, Working Paper, Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev 252207, USSR. (Presented at the IIASA Workshop on Global Optimization, Sopron, Hungary (1990)).
[15] Zikan, K. (1990), Track Initialization and Multiple Object Tracking Problem, Working Paper, Department of Operations Research, Stanford University, Stanford, California 94305.