- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
This title in other editions
Other titles in the Springer Series in Operations Research and Financial Enginee series:
Linear and Integer Programming Vs Linear Integration and Counting: A Duality Viewpoint (Springer Series in Operations Research and Financial Enginee)by Jean-bernard Lasserre
Synopses & Reviews
In this book the author analyzes and compares four closely related problems, namely linear programming, integer programming, linear integration, linear summation (or counting). The focus is on duality and the approach is rather novel as it puts integer programming in perspective with three associated problems, and permits one to define discrete analogues of well-known continuous duality concepts, and the rationale behind them. Also, the approach highlights the difference between the discrete and continuous cases. Central in the analysis are the continuous and discrete Brion and Vergne's formulae for linear integration and counting. This approach provides some new insights on duality concepts for integer programs, and also permits to retrieve and shed new light on some well-known results. For instance, Gomory relaxations and the abstract superadditive dual of integer programs are re-interpreted in this algebraic approach. This book will serve graduate students and researchers in applied mathematics, optimization, operations research and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will also find this book useful.
This book analyzes and compares four closely related problems, namely linear programming, integer programming, linear integration, and linear summation (or counting). The book provides some new insights on duality concepts for integer programs.
Table of Contents
Preface. Introduction.- Part I. Linear Integration and Linear Programming. The Linear Integration Problem I. Comparing the Continuous Problems P and I.- Part II. Linear Counting and Integer Programming- The Linear Counting Problem I(d). Relating the Discrete Problems P(d) and I(d) with P.- Part III. Duality. Duality and Gomory Relaxations. Barvinok's Counting Algorithm and Gomory Relaxations. A Discrete Farkas Lemma. The Integer Hull of a Convex Rational Polytope. Duality and Superadditive Functions.- Appendix: Legendre-Fenchel, Laplace, Cramer, and Z Transforms. References. Glossary.- Index.
What Our Readers Are Saying