{"uid":"cap_IABxI6qMRjhCIEWEXxwP8","slug":"numora-linear-programming-solver-7ccd70e3","name":"Numora Linear Programming Solver","description":"100 pure math computation endpoints for AI agents. Statistics, financial math, linear algebra, equation solving, calculus, number theory, sequence generation, and unit conversions. Zero external dependencies. x402 micropayments on Base.","url":"https://numomo.vercel.app/api/solve/linear-programming","method":"POST","headers":{},"bodySchema":{"type":"object","required":["A","b","c"],"properties":{"A":{"type":"array"},"b":{"type":"array"},"c":{"type":"array","description":"Objective coefficients"}}},"responseSchema":{"type":"object","required":["success","result","computation"],"properties":{"result":{"type":"object","description":"Computation result varies by endpoint"},"success":{"type":"boolean","description":"Always true on success"},"computation":{"type":"string","description":"Human-readable description of what was computed"}}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.1","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.1/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_w02rLzDXluwTjcNzIwuN1","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.1","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Solves linear programming optimization problems given objective coefficients and constraint matrices","exampleAgentPrompt":"Solve a linear programming problem where I want to minimize 2x + 3y subject to the constraints: x + y >= 4, 2x + y >= 6, x >= 0, y >= 0 — give me the optimal x and y values.","exampleUseCases":[{"title":"Production mix optimization","prompt":"I'm trying to figure out the cheapest way to produce two products. My objective coefficients are [-5, -4] for profit maximization, the constraint matrix A is [[1,1],[10,6]] representing labor and material limits, and the bounds b are [14, 100]. What's the optimal production mix?"},{"title":"Diet problem nutrient minimization","prompt":"Help me find the minimum-cost diet: objective coefficients are [3, 24, 1.3] for three foods, the constraint matrix A is [[-60,-300,-10],[-10,-10,-300],[-1,-0,0]] for nutrient requirements, and b is [-70,-75,-0.5]. Solve this linear program for me."},{"title":"Logistics cost minimization","prompt":"I have a shipping cost vector c of [2,3,1,5] and a constraint matrix A with rows representing supply and demand limits, and bounds b of [100,150,80,120]. Minimize total shipping cost and tell me how much to ship along each route."}],"resultDescription":"Returns a JSON object with a 'success' boolean, a 'result' object containing the optimal variable values and the optimal objective function value, and a 'computation' string describing what was solved in human-readable form.","failureModes":["Infeasible problem: constraints are contradictory and no solution exists","Unbounded problem: objective can be minimized/maximized to infinity","Malformed input: A, b, or c arrays have mismatched dimensions","Empty or missing required fields (A, b, or c) returns a validation error","Non-numeric values in input arrays cause parse errors"],"whenToPreferThis":"Use this endpoint when you need to solve a standard linear programming problem (minimize or maximize a linear objective subject to linear inequality constraints) without setting up a local solver. It is ideal for resource allocation, production planning, diet problems, and logistics routing where all relationships are linear. Prefer this over general equation solvers when your problem has inequality constraints and a linear objective function.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T00:43:35.404Z","isFirstParty":false}