Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems

DOI10.1023/A:1008237515535zbMATH Open0881.90109MaRDI QIDQ1361075FDOQ1361075

Authors: Hanif D. Sherali, Cihan H. Tuncbilek 

Publication date: 19 February 1998

Published in: Journal of Global Optimization (Search for Journal in Brave)

Recommendations

• On linear programming relaxations for solving polynomial programming problems
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming

zbMATH Keywords

constrained global optimizationpolynomial programmingreformulation-linearization techniqueouter-approximationslinear programming relaxations

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (13)

• A dynamic inequality generation scheme for polynomial programming
• An iterative scheme for valid polynomial inequality generation in binary polynomial programming
• A new two-level linear relaxed bound method for geometric programming problems
• Reduced RLT representations for nonconvex polynomial programming problems
• Global optimization of general non-convex problems with intermediate bilinear substructures
• A reformulation-linearization based algorithm for the smallest enclosing circle problem
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
• On linear programming relaxations for solving polynomial programming problems
• A global optimization RLT-based approach for solving the fuzzy clustering problem
• Global optimization of general nonconvex problems with intermediate polynomial substructures
• On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology
• Global optimality conditions and optimization methods for polynomial programming problems

This page was built for publication: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361075)