Skip to main content
Glama
Sharmarajnish

Constrained Optimization MCP Server

Related Servers

Alternatives to Constrained Optimization MCP Server

No user-submitted related servers found.

    Related Servers

    • A
      license
      A
      quality
      D
      maintenance
      Provides constraint satisfaction and optimization capabilities to LLMs and AI agents for scheduling, resource allocation, routing, budget optimization, and configuration problems using Google OR-Tools CP-SAT solver.
      5
      5
      Apache 2.0
    • A
      license
      Not graded
      quality
      D
      maintenance
      Enables solving Constraint Satisfaction Problems (CSP) like N-Queens, graph coloring, and Sudoku, as well as Linear Programming optimization problems through both MCP tools and HTTP API endpoints.
      2
      MIT
    • A
      license
      Not graded
      quality
      C
      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.
      8 npm
      18
      MIT
    • 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
      MCP-ORTools integrates Google's OR-Tools constraint programming solver with Large Language Models through the MCP, enabling AI models to: Submit and validate constraint models Set model parameters Solve constraint satisfaction and optimization problems Retrieve and analyze solution
      21
      MIT

    TDQS

    A3.8/5.0

    Scored across 5 tools

    Disambiguation4/5

    Each tool targets a distinct optimization paradigm or solver (OR-Tools, Z3, CVXPY, HiGHS, Markowitz), but there is slight overlap between constraint programming and constraint satisfaction, and convex optimization encompasses linear programming. Descriptions clarify differences.

    Naming Consistency5/5

    All tools follow the consistent pattern 'solve_<descriptive_noun>', using snake_case and clear terminology for the optimization type.

    Tool Count5/5

    With 5 tools covering major constrained optimization paradigms, the count is well-scoped for the server's purpose. It covers a broad range without being overwhelming.

    Completeness4/5

    The set covers constraint programming, satisfaction, convex, linear, and portfolio optimization. Missing non-convex nonlinear optimization and stochastic optimization, but major paradigms are present.

    Maintenance

    ActivityInactive
    ResponsivenessNo issues