Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add skills/nvidia/cuopt/cuopt-numerical-optimization-apinpx skills add NVIDIA/cuopt --skill cuopt-numerical-optimization-apigit clone --depth 1 https://github.com/NVIDIA/cuoptWhat it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5 | $0.00051 | $0.01244 |
| Opus 5 | $0.00026 | $0.00622 |
| Sonnet 5 | $0.00010 | $0.00249 |
| Haiku 4.5 | $0.00005 | $0.00124 |
Grade A, and why
cuopt-numerical-optimization-api scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured yesterday.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
This is a copy
100% identical to cuopt-numerical-optimization-api — 0 lines differ, which has more behind it and is treated as the original. This page carries a canonical link to it rather than competing with it.
How it starts
The opening of the file, as written. The whole thing — 104 lines — stays where its author put it; the contents beside it link to each section on GitHub.
cuOpt Numerical Optimization API
Model and solve LP, MILP, and QP problems using NVIDIA cuOpt's GPU-accelerated solver.
Interface Selection
Choose the reference for the user's interface:
| Interface | When to use | Reference |
|---|---|---|
| Python | User is writing Python code | references/python_api.md |
| C / C++ | User is embedding in a C/C++ application | references/c_api.md |
| CLI | User is solving from MPS files on the command line | references/cli_api.md |
If the interface is not yet clear, ask before writing any code.
Already using a modeling language? cuOpt also works as a solver backend for third-party modeling tools — AMPL, GAMS / GAMSPy, PuLP, JuMP, Pyomo, and CVXPY — with near-zero code changes (point the model's solver at cuOpt). CVXPY additionally covers convex QP and, in beta, QCQP / SOCP. Prefer this when the user already has a model in one of these tools rather than porting it to the cuOpt API. See Third-Party Modeling Languages.
Choosing LP vs MILP vs QP
Decide from the objective and variables:
| If the objective is... | And variables are... | Use |
|---|---|---|
Linear (sum of c_i * x_i) |
All continuous | LP |
| Linear | Some integer or binary | MILP |
Has squared (x*x) or cross (x*y) terms |
Continuous (integer QP not supported) | QP (beta) |
Prefer LP when the problem allows it. LP solves faster and has stronger optimality guarantees. Use MILP only when the problem logically requires whole numbers or yes/no decisions. Use QP only when the objective is genuinely quadratic (variance, squared error, kinetic energy).
- Use LP when every quantity can meaningfully be fractional: flows, proportions, rates, dollars, hours, tonnes of material, etc.
- Use MILP when the problem mentions counts of discrete entities, yes/no choices, or either/or decisions (e.g. open a facility or not, assign a person to a shift, number of trucks).
- Use QP when the objective minimizes variance, squared error, or any expression with
x*xorx*yterms (portfolio optimization, least squares, regularized regression).
What ships with it
51 files beside SKILL.md in the same directory: the scripts, references and assets a skill reads on demand. Not counted in the per-session cost; read them before you install if any of them is executable.
- assets/c/lp_basic/lp_simple.c 3.6 KB
- assets/c/lp_basic/README.md 466 B
- assets/c/lp_duals/lp_duals.c 4.0 KB
- assets/c/lp_duals/README.md 500 B
- assets/c/lp_warmstart/README.md 289 B
- assets/c/milp_basic/milp_simple.c 3.4 KB
- assets/c/milp_basic/README.md 405 B
- assets/c/milp_production_planning/milp_production.c 3.5 KB
- assets/c/milp_production_planning/README.md 459 B
- assets/c/mps_solver/data/sample.mps 490 B
- assets/c/mps_solver/mps_solver.c 3.4 KB
- assets/c/mps_solver/README.md 590 B
- assets/c/README.md 1.7 KB
- assets/cli/lp_production/production.mps 375 B
- assets/cli/lp_production/README.md 192 B
- assets/cli/lp_simple/README.md 191 B
- assets/cli/lp_simple/sample.mps 490 B
- assets/cli/milp_facility/facility.mps 694 B
- assets/cli/milp_facility/README.md 199 B
- assets/cli/README.md 856 B
- assets/python/least_squares/model.py 831 B runs code
- assets/python/least_squares/README.md 136 B
- assets/python/lp_basic/model.py 1.1 KB runs code
- assets/python/lp_basic/README.md 207 B
- assets/python/lp_duals/model.py 1.2 KB runs code
- assets/python/lp_duals/README.md 227 B
- assets/python/lp_warmstart/model.py 1.8 KB runs code
- assets/python/lp_warmstart/README.md 140 B
- assets/python/maximization_workaround/model.py 736 B runs code
- assets/python/maximization_workaround/README.md 152 B
- assets/python/milp_basic/incumbent_callback.py 1.8 KB runs code
- assets/python/milp_basic/model.py 1.2 KB runs code
- assets/python/milp_basic/README.md 433 B
- assets/python/milp_production_planning/model.py 1.2 KB runs code
- assets/python/milp_production_planning/README.md 165 B
- assets/python/mps_solver/data/README.md 2.0 KB
- assets/python/mps_solver/data/sample.mps 490 B
- assets/python/mps_solver/model.py 8.2 KB runs code
- assets/python/mps_solver/README.md 2.2 KB
- assets/python/mps_solver/results.md 2.5 KB
- assets/python/portfolio/model.py 1.6 KB runs code
- assets/python/portfolio/README.md 232 B
- assets/python/README.md 581 B
- BENCHMARK.md 4.8 KB
- evals/evals.json 14 KB
- references/c_api.md 4.7 KB
- references/cli_api.md 5.5 KB
- references/python_api.md 4.7 KB
- references/qp_examples.md 5.7 KB
- skill-card.md 4.3 KB
- skill.oms.sig 16 KB
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- yesterday First seen · 104 lines · 51 tokens per session scan A 22d98062800f
cuopt-numerical-optimization-api is a skill published in the GitHub repository NVIDIA/cuopt (1,032 stars, last pushed 3d ago), licensed Apache-2.0. It adds 51 tokens to every session and 1,244 once invoked, about $0.0003 per session on Opus 5. A static security scan graded it A with 0 findings. It is 100% identical to cuopt-numerical-optimization-api, differing in 0 lines, and is treated as a copy.
Other skills, from other repositories
add-cuda-kernel
Step-by-step tutorial for adding new CUDA kernels to FlashInfer.
debug-cuda-crash
Tutorial for debugging CUDA crashes using API logging.
benchmark-kernel
Guide for benchmarking FlashInfer kernels with CUPTI timing.
cutedsl_megamoe
Skill "cutedsl_megamoe" from flashinfer-ai/flashinfer, covering updating the cutedsl megamoe kernel src, layout, when the kernel team drops a new version of src/ and what not to update here.
perf-torch-cuda-graphs
Apply CUDA Graphs to PyTorch workloads — API selection (torch.compile, PyTorch makegraphedcallables, TE makegraphedcallables, MCore CudaGraphManager, FullCudaGraphWrapper, manual torch.cuda.graph), code compatibility, capture workflows, dynamic pattern handling, and troubleshooting. Triggers: CUDA graph…
perf-optimization-casebook
Casebook of past successful and classic TensorRT-LLM optimizations (runtime/execution and kernel level) recorded as reusable decision precedents. Consult when deciding which optimization to apply for a classified bottleneck or a given config/model/hardware, to find prior art and adapt a proven approach instead of…