A class of problems where dual bounds beat underestimation bounds
From MaRDI portal
Publication:598587
DOI10.1023/A:1013890609372zbMath1045.90078OpenAlexW1605156146MaRDI QIDQ598587
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013890609372
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (6)
Global optimization of disjunctive programs ⋮ On the relation between concavity cuts and the surrogate dual for convex maximization problems ⋮ New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability ⋮ Convergent upper bounds in global minimization with nonlinear equality constraints ⋮ Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
This page was built for publication: A class of problems where dual bounds beat underestimation bounds
