The Constraint Programming Solver (Experimental)

The CLP solver is a finite-domain constraint programming solver for CSPs. A standard CSP is characterized by integer variables, linear constraints, global constraints, and reify constraints. In other words, X is a finite set of integer variables, and C can contain linear, global, or logical constraints. As such, the solver expects only linear, ALLDIFF , ELEMENT , GCC , LEXICO , PACK , and REIFY predicates.

Both PROC OPTMODEL and PROC CLP support standard CSPs. The CLP procedure also supports scheduling CSPs, which are characterized by activities, temporal constraints, and resource requirement constraints. For more information about the CLP procedure see SAS/OR User's Guide: Constraint Programming.