Universal Solver (Z3, CVXPY, OR-Tools)

This MCP server provides a universal solver interface that integrates three major optimization and constraint solving libraries: Z3 for constraint satisfaction and SMT solving, CVXPY for convex optimization problems, and Google OR-Tools for constraint programming and scheduling. Built by Stephen Diehl using Python with FastMCP, it offers both structured model-based interfaces and simplified tools for each solver, supporting problems ranging from boolean satisfiability and worker scheduling to linear programming and resource allocation. The implementation uses functional programming patterns with the returns library for error handling and includes comprehensive examples demonstrating solver chaining, where results from one solver (like OR-Tools table layout optimization) feed into another (CVXPY staff scheduling), making it valuable for operations research, automated planning, and complex optimization workflows that benefit from multiple solving approaches.