Linear and Integer Programming vs Linear Integration and Counting A Duality Viewpoint /

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 associate...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Lasserre, Jean-Bernard (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:Inglés
Published: New York, NY : Springer New York : Imprint: Springer, 2009.
Edition:1st ed. 2009.
Series:Springer Series in Operations Research and Financial Engineering,
Subjects:
Operations research.
Management science.
Mathematical optimization.
Computer science-Mathematics.
Discrete mathematics.
Convex geometry .
Discrete geometry.
Operations Research, Management Science .
Optimization.
Discrete Mathematics in Computer Science.
Convex and Discrete Geometry.
Online Access:Texto Completo
Table of Contents:
  • 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.

Similar Items