A
licenseNot graded
qualityC
maintenanceEnables LLM clients to formulate, validate, and solve convex optimization problems (LPs, QPs, SOCPs, SDPs, and mixed-integer programs with a MIP solver) through CVXPY, returning status, optimal values, variable values, duals, and solver diagnostics. It also supports DCP-compliance checking, solver listing, and reusable parameter storage or file references so large inputs need not be resent on every call.
MIT