In this note we establish a relation between two bounds for convex maximization problems, the one based on a concavity cut, and the surrogate dual bound. Both bounds have been known in the literature for a few decades but, to the authors' knowledge, the relation between them has not been previously observed in the literature.
Article
View On the relation between concavity cuts and the surrogate dual for convex maximization problems