Convexity and its Applications in Discrete and Continuous Optimization

‘Written by one of the most brilliant researchers in the field, this book provides an elegant, rigorous and original presentation of the theory of convexity, describing in a unified way its use in continuous and discrete optimization, and also covering some very recent advancements in these areas.’ Marco Di Summa, University of Padua‘Convexity is central to most optimization algorithms. This book brings together classical and new developments at the interface between these two vibrant areas of mathematics. It is an essential reference for scholars in optimization. The numerous exercises make it an ideal textbook at the graduate and upper undergraduate levels.’ Gérard Cornuéjols, Carnegie Mellon University

Amitabh Basu is Professor of Applied Mathematics and Statistics at Johns Hopkins University. He has received the NSF CAREER award and the Egon Balas Prize from the INFORMS Optimization Society. He serves on the editorial boards of ‘Mathematics of Operations Research,’ ‘Mathematical Programming,’ ‘SIAM Journal on Optimization,’ and the ‘MOS-SIAM Series on Optimization.’