Skip to main content
Glama

Optimatika Optimisation Service

Server Details

Solve linear, quadratic and mixed-integer optimisation models; get each variable's value by name.

If you are the author of this connector, you can claim ownership. Claimed connector authors can inspect health checks, view analytics, and manage their listing.
Status
Healthy
Uptime
100.0% over the last 24 hours
Last Tested
Transport
Streamable HTTP · MCP 2025-11-25
URL
ChatGPT
–
Claude
–

TDQS

A3.9/5.0

Scored across 3 tools

Disambiguation5/5

Each tool has a clearly separate role: environment reports capabilities, solve executes a model, and translate converts between file formats. There is no overlap in purpose, so an agent can select the right tool unambiguously.

Naming Consistency4/5

All names are short lowercase tokens, which is readable and predictable. The only minor deviation is that 'environment' is a noun while 'solve' and 'translate' are verbs, rather than following one consistent verb_noun convention.

Tool Count5/5

Three tools is a tight, appropriate surface for an optimisation service: capability discovery, solving, and format conversion. Each tool earns its place, with no redundancy or trivial filler.

Completeness4/5

The core lifecycle is covered: inspect solvers and limits, solve LP/QP/MIP models, and convert between LP, MPS, and EBM. Minor gaps exist, such as a standalone model-validation or solve-cancellation tool, but agents can work around them via solve errors and time limits.

Available Tools

3 tools
environmentThis server's limits and solversA
Read-onlyIdempotent
Inspect

Reports what a model solved here may be: how large, how long it may run, and which solvers are available.

solveSolve an optimisation modelA
Read-onlyIdempotent
Inspect

Solves a linear, quadratic or mixed-integer optimisation model and returns the solution state, the objective value and each variable's value by name. Give the model as text, in LP format unless 'format' says otherwise. For example: Maximize obj: 3 x + 5 y Subject To budget: x + y <= 10 Bounds 0 <= x <= 8 General x End A coefficient goes before its variable with a space, as in 3 x: there is no * for that, no division and no parentheses. Variables go on the left-hand side, and a single number on the right. Squares and products go together inside one pair of square brackets, each with its coefficient inside too, written as a single number: [ 0.5 x ^2 + 0.004 x * y + 3 y ^2 ], not 0.5 [ x ^2 ] or 2 * 0.002 x * y. A variable is 0 or more unless Bounds says otherwise; General makes it integer, Binary 0 or 1. What is not LP format is an error that names the line. A long solve reports progress, if asked for. OPTIMAL means proven optimal; FEASIBLE means a solution was found but not proven optimal, typically because a time limit was reached. The objective and the variables' values are given only with a solution, and 'note' explains any other state.

Inputs: model (required), sense, format. Returns: note, state, optimal, feasible, +2 more

translateTranslate a model between formatsA
Read-onlyIdempotent
Inspect

Rewrites an optimisation model from one file format to another: LP (CPLEX LP format), MPS, or EBM (ojAlgo's own).

Inputs: to (required), from (required), model (required).

Tool Schema Changelog

Recent tool additions, removals, and schema changes observed during successful MCP inspections.

Loading tool schema changelog…

    Related MCP Connectors

    Related MCP Servers

    • A
      license
      Not graded
      quality
      D
      maintenance
      Enables solving linear programming (LP) and mixed-integer linear programming (MILP) optimization problems through natural language, with built-in simplex and branch-and-cut solvers plus infeasibility diagnostics. Includes optional OR-Tools fallback for larger problems and supports parsing optimization problems from natural language descriptions.
      MIT
    • A
      license
      Not graded
      quality
      D
      maintenance
      Provides linear programming (LP), mixed-integer programming (MIP), and quadratic programming (QP) optimization capabilities using the HiGHS solver, enabling AI assistants to solve complex optimization problems like production planning, logistics, and portfolio optimization.
      58 npm
      17
      MIT
    • F
      license
      Not graded
      quality
      D
      maintenance
      Enables AI applications to solve optimization problems including linear programming, mixed-integer programming, and quadratic programming using the Gurobi solver installed on the local device.
      1
      -
    Try in Browser

    Glama MCP Gateway

    Add one secure layer between your agents and this server.

    Resources