{"uid":"cap_hIjOvint-UFLC-B130RpJ","slug":"numora-linear-programming-solver-9e4a23b3","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://numormo.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_8N13HP0oEkkIrbq4i4fyJ","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 an objective function and constraints using the simplex or related method","exampleAgentPrompt":"I need to maximize profit given these objective coefficients c=[5, 4, 3], constraint matrix A=[[6,4,2],[1,2,1.5],[0,3,5]], and constraint bounds b=[240,60,150] — can you solve this linear program for the optimal variable values?","exampleUseCases":[{"title":"Production mix optimization","prompt":"I run a factory that can make three products. The profit per unit is [5, 4, 3], the resource usage per product is A=[[6,4,2],[1,2,1.5],[0,3,5]], and I have resource limits of b=[240,60,150]. What production quantities maximize my total profit?"},{"title":"Minimum cost diet planning","prompt":"Help me find the cheapest combination of foods that meets my nutritional requirements — the cost per unit of each food is c=[2,3.5,1.8], the nutrient content matrix is A=[[1,0,1],[0,2,1],[3,1,0]], and I need at least b=[4,6,3] units of each nutrient."},{"title":"Resource allocation for a project portfolio","prompt":"I have 4 projects with expected returns c=[10,15,7,12], each using budget and labor per unit given by A=[[3,2,1,4],[1,3,2,1]], with total available budget and labor b=[100,80]. Which combination of project investments maximizes my returns?"}],"resultDescription":"Returns a JSON object with a boolean success flag, a result object containing the optimal variable values and the optimal objective function value, and a human-readable computation string describing what was solved and the outcome. If the problem is infeasible or unbounded, this is indicated in the response.","failureModes":["Infeasible problem — constraints cannot be simultaneously satisfied, returns error or infeasibility flag","Unbounded problem — objective can grow without limit, returns unbounded indicator","Malformed matrix dimensions — A, b, c have inconsistent sizes, returns validation error","Missing required fields A, b, or c — returns 400-level error","Non-numeric values in input arrays — returns parsing or validation error","Payment failure — x402 micropayment not completed, returns 402 Payment Required"],"whenToPreferThis":"Choose this endpoint when you need a pure server-side linear programming solver with no external dependencies and pay-per-use micropayment pricing. Ideal for agents that need on-demand LP solving without managing a math library, a Python runtime, or a subscription. Best for standard LP problems expressed as Ax≤b with a linear objective c·x. If you need mixed-integer programming, nonlinear optimization, or quadratic objectives, look for a more specialized solver.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T12:31:53.879Z","isFirstParty":false}