This more recent innovation is a highly effective technology that uses domain reduction and constraint propagation to efficiently solve problems that are highly combinatorial with highly logical content. These problems are usually difficult or impossible to represent with linear expressions. Rapidly identify solutions Constraint programming uses information contained in the problem to prune the search space, rapidly identifying feasible solutions. It is ideally suited for operational problems, which require fast, feasible answers.
Users can also guide the search process with their own knowledge of the problem.
Constraint programming methodology allows the natural expression of very complex relationships, including logical expressions. Constraint programming approaches are ideally suited for operational problems like scheduling, sequencing, configuration, and routing, which are highly combinatorial, more intuitively represented with logical expressions, and require fast, feasible solutions. Inc. All rights reserved. Legal terms . Privacy policy .