MCP App Store
by KeenEthics
Optimatika Optimisation Service icon

Optimatika Optimisation Service MCP Server for Claude

By Optimatika

Overview

The Optimatika Optimisation Service solves mathematical optimisation models – linear (LP), quadratic (QP) and mixed-integer (MILP, MIQP) – with deterministic solvers: simplex, interior point, branch and bound. There is no AI in the solving, so an OPTIMAL result is a proven optimum. Claude writes the model as text, in the LP format, and calls solve. The result gives the solution state, the objective value and each variable's value by name. MPS and ojAlgo's EBM format are read too, and translate converts between the three. A model that is not valid LP is an error that names the line, so that it can be corrected. environment reports the limits. Use it for production planning, scheduling, assignment, blending, knapsack and other allocation problems: anything with a goal to maximise or minimise and constraints that have to hold. The connector uses Optimatika's public shared instance: free and without an account, for models of up to 1,000 variables or constraints and solves of up to 60 seconds. It is for getting started and tests, not production. Models are held in memory only, and expire within an hour. The same service runs as a container on your own infrastructure, for larger models.

How to connect

  1. Claude: Open the Optimatika Optimisation Service listing in the Claude connectors directory and choose Connect. Claude listing Optimatika Optimisation Service exposes 3 tools here.

Tools

environment

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

solve

Claude
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.

translate

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

Similar Apps

Listed on MCP App Store

Listed on MCP App Store

Add this badge to your site or README. It links to this page.

HTML

<a href="https://mcp-app-store.keenethics-labs.com/app/optimatika-optimisation-service"><img src="https://mcp-app-store.keenethics-labs.com/badges/listed-on-mcp-app-store.svg" alt="Listed on MCP App Store" width="220" height="44"></a>

Markdown

[![Listed on MCP App Store](https://mcp-app-store.keenethics-labs.com/badges/listed-on-mcp-app-store.svg)](https://mcp-app-store.keenethics-labs.com/app/optimatika-optimisation-service)