Skip to main content
  • Book
  • © 2009

Linear and Integer Programming vs Linear Integration and Counting

A Duality Viewpoint

  • Analyzes and compares four closely related nontrivial problems, namely linear programming, integer programming, linear integration, linear summation (or counting) with a focus on duality
  • Provides some new insights on duality concepts for integer programs, and also permits to retrieve and shed new light on some well-known results
  • Includes supplementary material: sn.pub/extras

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (10 chapters)

  1. Front Matter

    Pages 1-11
  2. Introduction

    • Jean-Bemard Lasserre
    Pages 1-5
  3. Linear Integration and Linear Programming

    1. Front Matter

      Pages 7-7
  4. Part I Linear Integration and Linear Programming

    1. The Linear Integration Problem I

      • Jean-Bemard Lasserre
      Pages 9-29
    2. Comparing the Continuous Problems P and I

      • Jean-Bemard Lasserre
      Pages 31-37
  5. Linear Counting and Integer Programming

    1. Front Matter

      Pages 39-39
  6. Part II Linear Counting and Integer Programming

    1. The Linear Counting Problem Id

      • Jean-Bemard Lasserre
      Pages 41-69
    2. Relating the Discrete Problems Pd and Id with P

      • Jean-Bemard Lasserre
      Pages 71-79
  7. Duality

    1. Front Matter

      Pages 81-81
  8. Part III Duality

    1. Duality and Gomory Relaxations

      • Jean-Bemard Lasserre
      Pages 83-106
    2. Barvinok’s Counting Algorithm and Gomory Relaxations

      • Jean-Bemard Lasserre
      Pages 107-113
    3. A Discrete Farkas Lemma

      • Jean-Bemard Lasserre
      Pages 115-129
    4. The Integer Hull of a Convex Rational Polytope

      • Jean-Bemard Lasserre
      Pages 131-138
    5. Duality and Superadditive Functions

      • Jean-Bemard Lasserre
      Pages 139-147
  9. Back Matter

    Pages 1-18

About this book

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.

Reviews

From the reviews:

“Lasserre has produced a fascinating slim … monograph (much of the work his own) looking at the parallels between linear (respectively integer) programming on the one hand and integration (respectively integer counting) problems on the other hand. … An appendix on various transforms a hundred references and a brief index complete the work which is a welcome addition to an important set of topics.” (J. Borwein, Mathematical Reviews, Issue 2010 f)

“This book is devoted to analysing four important problems: integer programming problem, linear programming problem, linear integration problem, and linear counting problem. … a very specialized book on the integer programming problem and its dual variants. … can be very helpful for researchers working in developing algorithms for the integer programming problem which is a formidable challenging problem. This is a clear and well-written book … .” (E. Almehdawe, Journal of the Operational Research Society, Vol. 61 (12), 2010)

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access