Modelling In Logic For Integer Programming

  • H. Paul Williams
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 130)

In order to systematise the modelling of such conditions it is convenient to introduce 0–1 integer variables to represent the satisfaction, or otherwise, of such constraints. When this is done it is usually necessary to know the upper or lower bounds for the left-hand side of the constraint above.


Convex Hull Integer Program Feasible Region Convex Region Constraint Logic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.The London School of EconomicsUK

Personalised recommendations