Reduced RLT representations for nonconvex polynomial programming problems
- 281 Downloads
This paper explores equivalent, reduced size Reformulation-Linearization Technique (RLT)-based formulations for polynomial programming problems. Utilizing a basis partitioning scheme for an embedded linear equality subsystem, we show that a strict subset of RLT defining equalities imply the remaining ones. Applying this result, we derive significantly reduced RLT representations and develop certain coherent associated branching rules that assure convergence to a global optimum, along with static as well as dynamic basis selection strategies to implement the proposed procedure. In addition, we enhance the RLT relaxations with v-semidefinite cuts, which are empirically shown to further improve the relative performance of the reduced RLT method over the usual RLT approach. We present computational results for randomly generated instances to test the different proposed reduction strategies and to demonstrate the improvement in overall computational effort when such reduced RLT mechanisms are employed.
KeywordsReformulation-Linearization Technique (RLT) Reduced basis techniques Polynomial programs Global optimization Semidefinite cuts BARON
Unable to display preview. Download preview PDF.
- 2.Cafieri, S., Hansen, P., Liberti, L., Letocart, L., Messine, F.: Tight and compact convex relaxations for polynomial programming problems. Manuscript, LIX, École Polytechnique, F-91128 Palaiseau, FranceGoogle Scholar
- 4.Dalkiran, E.: http://filebox.vt.edu/users/dalkiran/website/#ProblemRRLT (2011)
- 5.Dalkiran, E., Sherali, H. D.: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality. Manuscript, Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA (2011)Google Scholar
- 6.Floudas C.A., Visweswaran V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 217–270. Kluwer, Boston, MA (1995)Google Scholar
- 9.Liberti, L.: Effective RLT tightening in continuous bilinear programs. Internal Report 2003.18, Politecnico di Milano, 20133 Milano, ItalyGoogle Scholar
- 11.MATLAB: version 7.6.0 (R2008a). The MathWorks Inc., Natick, MA (2008)Google Scholar
- 13.Sahinidis, N.V., Tawarmalani, M.: BARON 9.0.6: Global optimization of mixed-integer nonlinear programs. User’s Manual (2010)Google Scholar
- 14.Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Boston, MA (1999)Google Scholar
- 15.Sherali, H.D., Dalkiran, E.: Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs. J. Glob. Optim. (2011). doi: 10.1007/s10898-010-9639-0
- 16.Sherali, H.D., Dalkiran, E., Desai, J.: Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts. Comput. Optim. Appl. (accepted for publication)Google Scholar