Sets out a new method for generating tight linear or convex programming relaxations for discrete and continuous nonconvex programming problems, featuring a model that affords a useful representation a
This book deals with the theory and applications of the Reformulation- Linearization/Convexification Technique (RL T) for solving nonconvex optimization problems. A unified treatment of discrete and c
