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

DOI10.1023/A:1008237515535MaRDI QIDQ1361075zbMATH OpenFDO

Authors Hanif D. Sherali, Cihan H. Tuncbilek

Publication date 19 February 1998

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

zbMATH Keywords

constrained global optimizationpolynomial programmingreformulation-linearization techniqueouter-approximationslinear programming relaxations

Mathematics Subject Classification ID

Nonlinear programming (90C30)

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

Cited in

(14)

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

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)