Type identifier:
data:solveCategory: Data Operations
Finds an optimal solution to a linear or mixed-integer linear model written in CPLEX LP format. Models describe an objective, constraints, bounds, and optional integer or binary variables; they are not executable JavaScript.
This node requires v2 Flow execution. If it is not available in the node selector, contact your administrator.
Handle | Label | Data Type | Required | Description |
|---|---|---|---|---|
| Trigger | Control | Yes | Starts the solve when the connected control branch runs. Exactly one incoming connection is supported |
| Model (LP) |
| Yes | CPLEX LP-format model text with a declared Minimize or Maximize objective |
Requesting a result through a data connection does not start a solve ahead of its Trigger branch. Blank input, non-string values, and unrecognized model text report invalid_model. Quadratic objectives report unsupported_model.
Handle | Label | Data Type | Description |
|---|---|---|---|
| Success | Control | Runs after an optimal or empty-model result is available |
| Error | Typed error control | Reports a failed solve; connect to Control - Switch in Error mode to branch on its code |
| Result | Object | Available only on success; fields are described below |
| Statistics | Object | Available only on success; fields are described below |
Every property is present; unavailable values are null, not omitted.
Field | Type | Description |
|---|---|---|
|
| Optimality was established, or the declared model was empty |
|
| Finite objective value |
|
| Named variables with finite solution values |
An optimal result always includes an objective value and variable values. An empty result includes both if a valid solution is available, otherwise both are null. Infeasible, unbounded, and time-limited solves are errors, not result statuses. A time-limited solve does not return an incumbent solution.
Field | Type | Description |
|---|---|---|
| Duration or | Solver runtime as an ISO 8601 duration, for example |
| Integer or | Original model variable count |
| Integer or | Original model constraint count |
| Integer or | Original constraint-matrix nonzero coefficient count |
| Integer or | Integer-variable count, including semi-integer and implicit-integer variables |
| Integer or | Simplex iteration count |
| Integer or | Interior-point iteration count |
|
| Exact nonnegative decimal MIP node count, preserving large integer values |
|
| Final relative MIP gap as a fraction |
|
| Final MIP dual bound |
Unavailable or inapplicable measurements are null. Counts are nonnegative. Measured zero remains 0 (or "0" for MIP nodes); zero runtime is PT0S. MIP-only statistics are null for continuous models.
Property | Studio label | Values | Default | Description |
|---|---|---|---|---|
| Node label | String |
| Display label |
| Presolve |
|
| Automatic, enabled, or disabled presolve |
| Relative MIP gap | Finite nonnegative number |
| Fractional gap tolerance; |
| Absolute MIP gap | Finite nonnegative number |
| Gap tolerance in objective units |
Gap settings affect MIP models only. Neither gap has an application-defined upper bound. There is no adjustable time-limit setting.
The solver has a fixed five-second time limit. This is not a five-second end-to-end deadline: waiting, model processing, and result preparation may add latency. A separate 30-second processing limit reports solver_error if reached, not time_limit; waiting before processing does not consume it.
No result or statistics output is published on error. An unconnected or unhandled Error route fails the run.
Code | Meaning | Error data |
|---|---|---|
| Input is not a valid declared LP model |
|
| Model uses an unsupported feature, including a quadratic objective |
|
| Constraints cannot all be satisfied | No additional data |
| Objective can improve without bound | No additional data |
| Solver could not distinguish these outcomes | No additional data |
| Solver or processing failed |
|
| Solver reached its native time limit |
|
This model maximizes profit from whole numbers of chairs and tables:
Maximize
profit: 30 chairs + 50 tables
Subject To
carpentry: chairs + 2 tables <= 40
finishing: 2 chairs + tables <= 50
Bounds
chairs >= 0
tables >= 0
Generals
chairs tables
EndWith the default options, the Result is:
{
"status": "optimal",
"objectiveValue": 1100,
"variables": [
{ "name": "chairs", "value": 20 },
{ "name": "tables", "value": 10 }
]
}