Linear and Integer Programming vs Linear Integration and Counting [electronic resource] : A Duality Viewpoint /
Lasserre, Jean-Bernard.author.
Hall, A. E.(Anthony Elmit),1940-
Cannell, Glen H.,1919-
Lawton, Harry W.,1927-2005.
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.
Description based upon print version of record.
Includes bibliographical references (p. [159]-163) and index.
I Linear Integration and Linear Programming -- The Linear Integration Problem I -- Comparing the Continuous Problems P and I -- II Linear Counting and Integer Programming -- The Linear Counting Problem I -- Relating the Discrete Problems P and I with P -- III Duality -- Duality and Gomory Relaxations -- Barvinok#x2019;s Counting Algorithm and Gomory Relaxations -- A Discrete Farkas Lemma -- The Integer Hull of a Convex Rational Polytope -- Duality and Superadditive Functions.
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.
Operations research.
Management science.
Mathematical optimization.
Computer science—Mathematics.
Convex geometry .
Discrete geometry.
Operations Research, Management Science.
Optimization.
Discrete Mathematics in Computer Science.
Convex and Discrete Geometry.
Springer Series in Operations Research and Financial Engineering