solve_constraint_programming
Solve combinatorial optimization and constraint satisfaction problems with discrete variables. Supports scheduling, assignment, and logical/numerical constraints using OR-Tools.
Instructions
Solve constraint programming problems using OR-Tools.
This tool is ideal for combinatorial optimization problems, scheduling,
assignment problems, and constraint satisfaction with discrete variables.
Args:
variables: List of variable definitions with 'name', 'type', and optional 'domain'/'shape'
constraints: List of constraint expressions as strings
objective: Optional objective definition with 'type' and 'expression'
parameters: Dictionary of solver parameters
description: Optional problem description
Returns:
Solution results including variable values and feasibility status
Example:
variables = [
{"name": "x", "type": "integer", "domain": [0, 10]},
{"name": "y", "type": "boolean"}
]
constraints = [
"x + y >= 5",
"x - y <= 3"
]
objective = {"type": "minimize", "expression": "x + y"}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| variables | Yes | ||
| constraints | Yes | ||
| objective | No | ||
| parameters | No | ||
| description | No |