An approximate approach of global optimization for polynomial programming problems

Abstract Many methods for solving polynomial programming problems can only find locally optimal solutions. This paper proposes a method for finding the approximately globally optimal solutions of polynomial programs. Representing a bounded continuous variable x i as the addition of a discrete variable d i and a small variable ϵ i , a polynomial term x i x i can be expanded as the sum of d i x j , d j ϵ i ; and ϵ i ϵ j . A procedure is then developed to fully linearize d i x j and d j e i , and to approximately linearize ϵ i ϵ j with an error below a pre-specified tolerance. This linearization procedure can also be extended to higher order polynomial programs. Several polynomial programming examples in the literature are tested to demonstrate that the proposed method can systematically solve these examples to find the global optimum within a pre-specified error.

[1]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[2]  Pierre Hansen,et al.  A Framework for Algorithms in Globally Optimal Design , 1988 .

[3]  R. G. Fenton,et al.  A MIXED INTEGER-DISCRETE-CONTINUOUS PROGRAMMING METHOD AND ITS APPLICATION TO ENGINEERING DESIGN OPTIMIZATION , 1991 .

[4]  Han-Lin Li,et al.  A GLOBAL APPROACH FOR NONLINEAR MIXED DISCRETE PROGRAMMING IN DESIGN OPTIMIZATION , 1993 .

[5]  Han-Lin Li.  A GLOBAL APPROACH FOR GENERAL 0-1 FRACTIONAL-PROGRAMMING , 1994 .

[6]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[7]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[8]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[9]  Pierre Hansen,et al.  An analytical approach to global optimization , 1991, Math. Program..

[10]  Han-Lin Li,et al.  An approximate method for local optima for nonlinear mixed integer programming problems , 1992, Comput. Oper. Res..

[11]  G. T. Timmer,et al.  Stochastic global optimization methods part I: Clustering methods , 1987, Math. Program..

[12]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[13]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[14]  E. Sandgren,et al.  Nonlinear Integer and Discrete Programming in Mechanical Design Optimization , 1990 .

[15]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..