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 relaxations; constrained global optimization; polynomial programming; reformulation-linearization technique; outer-approximations
90C30: Nonlinear programming
Related Items
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, A global optimization RLT-based approach for solving the fuzzy clustering problem, A new two-level linear relaxed bound method for geometric programming problems, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming