Abstract
This paper studies the global optimization of polynomial programming problems using Reformulation-Linearization Technique (RLT)-based linear programming (LP) relaxations. We introduce a new class of bound-grid-factor constraints that can be judiciously used to augment the basic RLT relaxations in order to improve the quality of lower bounds and enhance the performance of global branch-and-bound algorithms. Certain theoretical properties are established that shed light on the effect of these valid inequalities in driving the discrepancies between RLT variables and their associated nonlinear products to zero. To preserve computational expediency while promoting efficiency, we propose certain concurrent and sequential cut generation routines and various grid-factor selection rules. The results indicate a significant tightening of lower bounds, which yields an overall reduction in computational effort for solving a test-bed of polynomial programming problems to global optimality in comparison with the basic RLT procedure as well as the commercial software BARON.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gill P.E., Murray W., Saunders M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99–131 (2005)
McCormick G.P.: Computability of global solutions to factorable nonconvex programs: part I—convex underestimating problems. Math. Program. 10(1), 147–175 (1976)
Paulavičius R., Žilinskas J., Grothey A.: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2), 173–183 (2010)
Sahinidis, N.V., Tawarmalani, M.: BARON 9.0.6: global optimization of mixed-integer nonlinear programs. User’s manual. In: http://www.gams.com/dd/docs/solvers/baron.pdf (2010)
Sherali, H.D., Dalkiran, E., Desai, J.: Enhancing RLT-Based Relaxations for Polynomial Programming Problems Via a New Class of v-Semidefinite Cuts. Manuscript, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic and State University, Blacksburg, VA
Sherali H.D., Tuncbilek C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2(1), 101–112 (1992)
Sherali H.D., Tuncbilek C.H.: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems. J. Global Optim. 10(4), 381–390 (1997)
Sherali H.D., Tuncbilek C.H.: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1), 1–9 (1997)
Sherali H.D., Wang H.: Global optimization of nonconvex factorable programming problems. Math. Program. 89(3), 459–478 (2001)
Shor N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25, 163–168 (1990)
Tawarmalani M., Sahinidis N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99(3), 563–591 (2004)
Tawarmalani M., Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225–249 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sherali, H.D., Dalkiran, E. Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs. J Glob Optim 51, 377–393 (2011). https://doi.org/10.1007/s10898-010-9639-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-010-9639-0