Modelling In Logic For Integer Programming
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.
KeywordsConvex Hull Integer Program Feasible Region Convex Region Constraint Logic Programming
Unable to display preview. Download preview PDF.