FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Linear and Integer Programming vs Linear Integration and Counting

Linear and Integer Programming vs Linear Integration and Counting

Jean-Bernard Lasserre
    Product form
      FORMAT: Paperback / softback

      R 4,260.28 Price and availability exclusive to website

      YOU COULD EARN 4,260.28 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 710.04 per month!
      3x monthly payments of R 1,420.09 with
      4x fortnightly payments of R 1,065.07 with
      Integer programming (IP) is a fascinating topic. Indeed, while linear programming (LP), its c- tinuous analogue, is well understood and extremely ef?cient LP software packages exist, solving an integer program can remain a formidable challenge, even for some small size problems. For instance, the following small (5-variable) IP problem (called the unbounded knapsack problem) min{213x?1928x?11111x?2345x +9123x} 1 2 3 4 5 s.t. 12223x +12224x +36674x +61119x +85569x = 89643482, 1 2 3 4 5 x ,x ,x ,x ,x?N, 1 2 3 4 5 taken from a list of dif?cult knapsack problems in Aardal and Lenstra [2], is not solved even by hours of computing, using for instance the last version of the ef?cient software package CPLEX. However,thisisnotabookonintegerprogramming,asverygoodonesonthistopicalreadyexist. For standard references on the theory and practice of integer programming, the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and the more recent Bertsimas and Weismantel [21]. On the other hand, this book could provide a complement to the above books as it develops a rather unusual viewpoint.
      Format: Paperback / softback CONTRIBUTORS: Jean-Bernard Lasserre EAN: 9781441918536 COUNTRY: United States PAGES: WEIGHT: 360 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2010-12-15 CITY: GENRE: BUSINESS & ECONOMICS / Operations Research, COMPUTERS / Data Science / General, MATHEMATICS / Applied, MATHEMATICS / Geometry / Analytic WIDTH: 178 cm SPINE:

      Book Themes:

      Operational research, Discrete mathematics, Geometry, Optimization, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Integer programming (IP) is a fascinating topic. Indeed, while linear programming (LP), its c- tinuous analogue, is well understood and extremely ef?cient LP software packages exist, solving an integer program can remain a formidable challenge, even for some small size problems. For instance, the following small (5-variable) IP problem (called the unbounded knapsack problem) min{213x?1928x?11111x?2345x +9123x} 1 2 3 4 5 s.t. 12223x +12224x +36674x +61119x +85569x = 89643482, 1 2 3 4 5 x ,x ,x ,x ,x?N, 1 2 3 4 5 taken from a list of dif?cult knapsack problems in Aardal and Lenstra [2], is not solved even by hours of computing, using for instance the last version of the ef?cient software package CPLEX. However,thisisnotabookonintegerprogramming,asverygoodonesonthistopicalreadyexist. For standard references on the theory and practice of integer programming, the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and the more recent Bertsimas and Weismantel [21]. On the other hand, this book could provide a complement to the above books as it develops a rather unusual viewpoint.
      Format: Paperback / softback CONTRIBUTORS: Jean-Bernard Lasserre EAN: 9781441918536 COUNTRY: United States PAGES: WEIGHT: 360 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2010-12-15 CITY: GENRE: BUSINESS & ECONOMICS / Operations Research, COMPUTERS / Data Science / General, MATHEMATICS / Applied, MATHEMATICS / Geometry / Analytic WIDTH: 178 cm SPINE:

      Book Themes:

      Operational research, Discrete mathematics, Geometry, Optimization, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account