Description:

PIP/PipLib is the well known Paul Feautrier's parametric integer
programming solver. PIP is a software which finds the lexicographic
minimum of the set of integer points which lie inside a convex
polyhedron. This polyhedron can depend linearly on one or more
integral parameters. If user ask for a non integral solution, PIP can
give the exact solution as an integral quotient. The heart of PIP is
the parametrized Gomory's cuts algorithm followed by parametrized dual
simplex method. The PIP Library (PipLib for short) was implemented to
allow the user to call PIP directly from his programs, without file
accesses or system calls. The user only needs to link his programs
with C libraries.