CP Optimizer

Description

IBM ILOG CP Optimizer (CPOPT for short) is a software package for constraint programming targeting both constraint satisfaction problems and optimization problems. It contains powerful methods for finding feasible solutions and improving them. The strength of CP Optimizer is that it removes the need for you to write and maintain a search strategy.

CP Optimizer is equipped with parameters that influence the performance of CP Optimizer. AIMMS is equipped with options that set the parameters in CP Optimizer. Options in AIMMS can be set in the options dialog box.

Note that the general solvers options MIP Absolute Optimality Tolerance and MIP Relative Optimality Tolerance are not used by CP Optimizer. You should use the CP Optimizer options Optimality Tolerance and Relative Optimality Tolerance instead. Also the general solvers option Maximal Number of Integer Solutions is not used by CP Optimizer; you should use CP Optimizer option Solution Limit instead.

Best Bound

CP Optimizer now maintains a bound on the objective (a lower bound for minimization problems and an upper bound for maximization problems). This bound is displayed in the Progress Window when a new bound is found, along with the optimality gap when an improving solution has been found. At the end of the search, the best bound and gap are displayed.

Learn more about

• CP Optimizer (Internet link)

• CP Optimizer to AIMMS Mapping

• AIMMS to CP Optimizer Mapping

• AIMMS Options

• Maximal Number of Integer Solutions

• MIP Absolute Optimality Tolerance

• MIP Relative Optimality Tolerance

• Optimality tolerance

• Relative optimality tolerance

• Solution limit