In recent years there has been an explosion of research into linear programming, as well as further steady advances in integer programming. This research has been reported in the research literature but there has been little done from the view of a combined whole. This book aims to overcome this. With an international authorship of contributors from acknowledged experts in their field, this book provides a clear exposition on such topics as simplex algorithms, and interior point algorithms, both from a theoretical and a computational viewpoint. Surveying recent research that is currently only available in journals this topical book will be of interest not only in the field of mathematics, but also in computer science and operations research as well.