solve_mixed_integer_program
Optimize Mixed-Integer Programming problems with integer, binary, and continuous variables. Define variables, constraints, and objectives, then solve using specified solvers like SCIP, CBC, GUROBI, or CPLEX within a given time limit.
Instructions
Solve Mixed-Integer Programming (MIP) problems with integer, binary, and continuous variables.
Args:
variables: List of variable definitions with bounds and types
constraints: List of constraint definitions with coefficients and bounds
objective: Objective function definition with coefficients and direction
solver_name: Solver to use ("SCIP", "CBC", "GUROBI", "CPLEX")
time_limit_seconds: Maximum solving time in seconds (default: 30.0)
Returns:
Optimization result with optimal variable values and objective
Input Schema
Name | Required | Description | Default |
---|---|---|---|
constraints | Yes | ||
objective | Yes | ||
solver_name | No | SCIP | |
time_limit_seconds | No | ||
variables | Yes |
Input Schema (JSON Schema)
{
"properties": {
"constraints": {
"items": {
"additionalProperties": true,
"type": "object"
},
"title": "Constraints",
"type": "array"
},
"objective": {
"additionalProperties": true,
"title": "Objective",
"type": "object"
},
"solver_name": {
"default": "SCIP",
"title": "Solver Name",
"type": "string"
},
"time_limit_seconds": {
"default": 30,
"title": "Time Limit Seconds",
"type": "number"
},
"variables": {
"items": {
"additionalProperties": true,
"type": "object"
},
"title": "Variables",
"type": "array"
}
},
"required": [
"variables",
"constraints",
"objective"
],
"type": "object"
}