Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
From MaRDI portal
Publication:1361075
DOI10.1023/A:1008237515535zbMath0881.90109MaRDI QIDQ1361075
Hanif D. Sherali, Cihan H. Tuncbilek
Publication date: 19 February 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
linear programming relaxationsconstrained global optimizationpolynomial programmingreformulation-linearization techniqueouter-approximations
Related Items
On linear programming relaxations for solving polynomial programming problems, A reformulation-linearization based algorithm for the smallest enclosing circle problem, Reduced RLT representations for nonconvex polynomial programming problems, 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, Global optimality conditions and optimization methods for polynomial programming problems, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, Global optimization of general nonconvex problems with intermediate polynomial substructures, Global optimization of general non-convex problems with intermediate bilinear substructures, A new two-level linear relaxed bound method for geometric programming problems, A global optimization RLT-based approach for solving the fuzzy clustering problem, A dynamic inequality generation scheme for polynomial programming
