simplex_solve
Solve linear programming problems by maximizing an objective function subject to <= constraints using the simplex method.
Instructions
Solve a linear programming problem (maximize objective subject to <= constraints) using the simplex method.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"objective": "<objective>",
"constraints": "<constraints>"
},
"name": "simplex_solve"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| objective | Yes | Coefficients to maximize (e.g. [5, 4] for 5x + 4y) | |
| constraints | Yes | Array of {coeffs, bound} for <= constraints |