Statistical Problem Formulation
aiming-lab/AutoResearchClaw
Formulate statistical research problems with formal notation, target parameters, assumptions, hypotheses, evaluation criteria, and theory targets.
LP, MILP, QP — concepts, problem-text parsing, and formulation patterns (parameters, constraints, decisions, objective).
$ npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a claude-codeProject install by default; add -g for ~/.claude/skills/.
$ gh skill install NVIDIA/skills cuopt-numerical-optimization-formulation --agent claude-codeProject scope by default; add --scope user for a personal install. Needs GitHub CLI 2.90.0 or later (public preview).
$ git clone --depth 1 https://github.com/NVIDIA/skills.git skills-src && mkdir -p .claude/skills && cp -r skills-src/skills/cuopt-numerical-optimization-formulation .claude/skills/cuopt-numerical-optimization-formulation && rm -rf skills-srcUse ~/.claude/skills/ instead of .claude/skills for a personal install. The folder must contain SKILL.md.
Claude Code skills documentation · loads skills from .claude/skills/
Install the "cuopt-numerical-optimization-formulation" agent skill from https://github.com/NVIDIA/skills/tree/main/skills/cuopt-numerical-optimization-formulation into .claude/skills/cuopt-numerical-optimization-formulation/ in this project. Copy the whole folder (SKILL.md and every file beside it), keep the folder name "cuopt-numerical-optimization-formulation", then confirm the skill loads.Claude Code copies the folder itself, the same result as the manual copy. Check what it changed before you commit it.
$skill-installer install https://github.com/NVIDIA/skills/tree/main/skills/cuopt-numerical-optimization-formulationType this inside Codex. $skill-installer <name> installs a curated skill from openai/skills. The installer writes to $CODEX_HOME/skills (default ~/.codex/skills). Restart Codex if the skill does not show up.
$ npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a codexProject install goes to .agents/skills/; add -g for ~/.codex/skills/.
$ gh skill install NVIDIA/skills cuopt-numerical-optimization-formulation --agent codexProject scope by default (.agents/skills/); add --scope user for a personal install.
$ git clone --depth 1 https://github.com/NVIDIA/skills.git skills-src && mkdir -p .agents/skills && cp -r skills-src/skills/cuopt-numerical-optimization-formulation .agents/skills/cuopt-numerical-optimization-formulation && rm -rf skills-srcUse ~/.agents/skills/ instead of .agents/skills for a personal install.
Codex skills documentation · loads skills from .agents/skills/
Install the "cuopt-numerical-optimization-formulation" agent skill from https://github.com/NVIDIA/skills/tree/main/skills/cuopt-numerical-optimization-formulation into .agents/skills/cuopt-numerical-optimization-formulation/ in this project. Copy the whole folder (SKILL.md and every file beside it), keep the folder name "cuopt-numerical-optimization-formulation", then confirm the skill loads.Codex copies the folder itself, the same result as the manual copy. Check what it changed before you commit it.
$ npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a cursorProject install goes to .agents/skills/; add -g for ~/.cursor/skills/.
$ gh skill install NVIDIA/skills cuopt-numerical-optimization-formulation --agent cursorProject scope by default (.agents/skills/); add --scope user for a personal install.
$ git clone --depth 1 https://github.com/NVIDIA/skills.git skills-src && mkdir -p .cursor/skills && cp -r skills-src/skills/cuopt-numerical-optimization-formulation .cursor/skills/cuopt-numerical-optimization-formulation && rm -rf skills-srcUse ~/.cursor/skills/ instead of .cursor/skills for a personal install.
Cursor skills documentation · loads skills from .cursor/skills/, .agents/skills/, .claude/skills/, .codex/skills/
Install the "cuopt-numerical-optimization-formulation" agent skill from https://github.com/NVIDIA/skills/tree/main/skills/cuopt-numerical-optimization-formulation into .cursor/skills/cuopt-numerical-optimization-formulation/ in this project. Copy the whole folder (SKILL.md and every file beside it), keep the folder name "cuopt-numerical-optimization-formulation", then confirm the skill loads.Cursor copies the folder itself, the same result as the manual copy. Check what it changed before you commit it.
$ gemini skills install https://github.com/NVIDIA/skills.git --path skills/cuopt-numerical-optimization-formulation--scope user (default) or --scope workspace; --path is the subfolder of the repo that holds the skill; --consent skips the security confirmation prompt.
$ npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a gemini-cliProject install goes to .agents/skills/; add -g for ~/.gemini/skills/.
$ gh skill install NVIDIA/skills cuopt-numerical-optimization-formulation --agent gemini-cliProject scope by default (.agents/skills/); add --scope user for a personal install.
$ git clone --depth 1 https://github.com/NVIDIA/skills.git skills-src && mkdir -p .gemini/skills && cp -r skills-src/skills/cuopt-numerical-optimization-formulation .gemini/skills/cuopt-numerical-optimization-formulation && rm -rf skills-srcUse ~/.gemini/skills/ instead of .gemini/skills for a personal install, then run /skills reload.
Gemini CLI skills documentation · loads skills from .gemini/skills/, .agents/skills/
Install the "cuopt-numerical-optimization-formulation" agent skill from https://github.com/NVIDIA/skills/tree/main/skills/cuopt-numerical-optimization-formulation into .gemini/skills/cuopt-numerical-optimization-formulation/ in this project. Copy the whole folder (SKILL.md and every file beside it), keep the folder name "cuopt-numerical-optimization-formulation", then confirm the skill loads.Gemini CLI copies the folder itself, the same result as the manual copy. Check what it changed before you commit it.
$ gh skill install NVIDIA/skills cuopt-numerical-optimization-formulationInstalls for Copilot at project scope by default; add --scope user for a personal install. Preview a skill first with gh skill preview. Needs GitHub CLI 2.90.0 or later (public preview).
$ npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a github-copilotProject install goes to .agents/skills/; add -g for ~/.copilot/skills/.
$ git clone --depth 1 https://github.com/NVIDIA/skills.git skills-src && mkdir -p .github/skills && cp -r skills-src/skills/cuopt-numerical-optimization-formulation .github/skills/cuopt-numerical-optimization-formulation && rm -rf skills-srcUse ~/.copilot/skills/ instead of .github/skills for a personal install. Commit .github/skills so cloud agent and code review can use it.
GitHub Copilot skills documentation · loads skills from .github/skills/, .claude/skills/, .agents/skills/
Install the "cuopt-numerical-optimization-formulation" agent skill from https://github.com/NVIDIA/skills/tree/main/skills/cuopt-numerical-optimization-formulation into .github/skills/cuopt-numerical-optimization-formulation/ in this project. Copy the whole folder (SKILL.md and every file beside it), keep the folder name "cuopt-numerical-optimization-formulation", then confirm the skill loads.GitHub Copilot copies the folder itself, the same result as the manual copy. Check what it changed before you commit it.
$ npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a opencodeOpenCode documents no install command of its own. Project install goes to .agents/skills/; add -g for ~/.config/opencode/skills/.
$ gh skill install NVIDIA/skills cuopt-numerical-optimization-formulation --agent opencodeProject scope by default (.agents/skills/); add --scope user for a personal install.
$ git clone --depth 1 https://github.com/NVIDIA/skills.git skills-src && mkdir -p .opencode/skills && cp -r skills-src/skills/cuopt-numerical-optimization-formulation .opencode/skills/cuopt-numerical-optimization-formulation && rm -rf skills-srcUse ~/.config/opencode/skills/ instead of .opencode/skills for a personal install.
OpenCode skills documentation · loads skills from .opencode/skills/, .claude/skills/, .agents/skills/
Install the "cuopt-numerical-optimization-formulation" agent skill from https://github.com/NVIDIA/skills/tree/main/skills/cuopt-numerical-optimization-formulation into .opencode/skills/cuopt-numerical-optimization-formulation/ in this project. Copy the whole folder (SKILL.md and every file beside it), keep the folder name "cuopt-numerical-optimization-formulation", then confirm the skill loads.OpenCode copies the folder itself, the same result as the manual copy. Check what it changed before you commit it.
cuopt-numerical-optimization-formulationLP, MILP, QP — concepts, problem-text parsing, and formulation patterns (parameters, constraints, decisions, objective).
Cuopt Numerical Optimization Formulation is an agent skill from NVIDIA/skills, published by the product's own GitHub organization. LP, MILP, QP — concepts, problem-text parsing, and formulation patterns (parameters, constraints, decisions, objective). Concepts only; no API.
Its SKILL.md is about 4.9k tokens, which your agent loads only when the skill is triggered. The skill folder holds 5 other files (for example `BENCHMARK.md`, `evals/evals.json` and `skill-card.md`).
The repository describes itself as: Agent Skills for NVIDIA products — install into Claude Code, Codex, and other coding agents to run Physical AI, robotics, simulation, CUDA, and RAG workflows end to end. The licence is Apache-2.0.
5 steps, taken from the first numbered list in SKILL.md.
Read from SKILL.md and the folder at commit 0e0d506. It shows what the files ask for, not the result of running them.
Pre-approves nothing: there is no allowed-tools line, so your agent's usual permission prompts apply.
From allowed-tools in the SKILL.md frontmatter.
No scripts in the folder and no shell commands in SKILL.md.
From the folder's file list and the shell code blocks in SKILL.md.
No URLs in SKILL.md.
From URLs in SKILL.md, links to its own repository left out.
Names no API keys, tokens, secrets or passwords.
From names ending in _API_KEY, _TOKEN, _SECRET, _KEY or _PASSWORD in SKILL.md.
Cuopt Numerical Optimization Formulation loads about 4.9k tokens when it runs. Until then it costs about 46 tokens; SKILL.md has 2,460 words of instructions outside code blocks.
Estimates: characters ÷ 4, the usual rule of thumb; real counts depend on the model's tokenizer. Scripts and assets cost tokens only if the agent reads them.
The automated check found no risky patterns in SKILL.md.
Automated static check — not a guarantee. Review scripts before installing. It scans the text of SKILL.md for risky patterns (piping downloads into a shell, reading credential files, hidden Unicode, destructive commands); files beside SKILL.md are not scanned.
The full file from NVIDIA/skills at commit 0e0d506, republished under its Apache-2.0 licence (© NVIDIA). 2,460 words, ~4,852 tokens.
.claude/skills/cuopt-numerical-optimization-formulation/SKILL.md (or your agent's skills folder). This skill also uses 4 other files; get the full folder from GitHub.Concepts and workflow for going from a problem description to a clear formulation across LP, MILP, and QP. No API code here.
| Property | LP | MILP | QP |
|---|---|---|---|
| Objective | Linear | Linear | Quadratic (xᵀQx + cᵀx) |
| Constraints | Linear | Linear | Linear + convex quadratic (inequality only) via second-order cones |
| Variables | Continuous | Mixed: continuous + integer/binary | Continuous |
| Sense | min or max | min or max | minimize only (negate to max) |
| Duals / sensitivity | Dual values + reduced costs | None (integer optima) | Dual values + reduced costs |
If the objective is purely linear, prefer LP/MILP — do not artificially introduce quadratic terms. If any variable is integer or binary, the problem is MILP regardless of the rest.
Post-solve sensitivity (LP / QP only). Continuous LP and QP solutions expose dual values (the marginal objective change per unit a binding constraint is relaxed: where to invest to improve the outcome) and reduced costs (for a variable the optimizer left at zero, how far it must improve to enter the solution: a near-miss). MILP solutions have no duals — integer optima are not continuous, so there are none to return. Duals are also unavailable when the model includes quadratic constraints — the second-order cone path returns primal values only. See the language-specific API skills for how to retrieve them after a solve.
Ask these if not already clear:
When the user gives problem text, classify every sentence and then summarize before formulating. The parsing framework below applies regardless of LP / MILP / QP.
Classify every sentence as parameter/given, constraint, decision, or objective. Watch for implicit constraints (e.g., committed vs optional phrasing) and implicit objectives (e.g., "determine the plan" + costs → minimize total cost).
Ambiguity: If anything is still ambiguous, ask the user or solve all plausible interpretations and report all outcomes; do not assume a single interpretation.
| Label | Meaning | Examples (sentence type) |
|---|---|---|
| Parameter / given | Fixed data, inputs, facts. Not chosen by the model. | "Demand is 100 units." "There are 3 factories." "Costs are $5 per unit." |
| Constraint | Something that must hold. May be explicit or implicit from phrasing. | "Capacity is 200." "All demand must be met." "At least 2 shifts must be staffed." |
| Decision | Something we choose or optimize. | "How much to produce." "Which facilities to open." "How many workers to hire." |
| Objective | What to minimize or maximize. May be explicit ("minimize cost") or implicit ("determine the plan" with costs given). | "Minimize total cost." "Determine the production plan" (with costs) → minimize total cost. |
Committed/fixed phrasing → treat as parameter or implicit constraint (everything mentioned is given or must happen). Not a decision.
| Phrasing | Interpretation | Why |
|---|---|---|
| "Plans to produce X products" | Constraint: all X must be produced. | Commitment; production level is fixed. |
| "Operates 3 factories" | Parameter: all 3 are open. Not a location-selection problem. | Current state is fixed. |
| "Employs N workers" | Parameter: all N are employed. Not a hiring decision. | Workforce size is given. |
| "Has a capacity of C" | Parameter (C) + constraint: usage ≤ C. | Capacity is fixed. |
| "Must meet all demand" | Constraint: demand satisfaction. | Explicit requirement. |
Optional/decision phrasing → treat as decision.
| Phrasing | Interpretation | Why |
|---|---|---|
| "May produce up to …" | Decision: how much to produce. | Optional level. |
| "Can choose to open" (factories, sites) | Decision: which to open. | Selection is decided. |
| "Considers hiring" | Decision: how many to hire. | Hiring is under consideration. |
| "Decides how much to order" | Decision: order quantities. | Explicit decision. |
| "Wants to minimize/maximize …" | Objective (drives decisions). | Goal; decisions are the levers. |
If the problem asks to "determine the plan" (or similar) but does not state "minimize" or "maximize" explicitly, the objective is often implicit. You MUST identify it and state it before formulating; do not build a model with no objective.
| Phrasing / context | Likely implicit objective | Why |
|---|---|---|
| "Determine the production plan" + costs given (per unit, per hour, etc.) | Minimize total cost (production + inspection/sales + overtime, etc.) | Plan is chosen; costs are specified → natural goal is to minimize total cost. |
| "Determine the plan" + costs and revenues given | Maximize profit (revenue − cost) | Both sides of the ledger → optimize profit. |
| "Try to determine the monthly production plan" + workshop hour costs, inspection/sales costs | Minimize total cost | All cost components are given; no revenue to maximize → minimize total cost. |
Rule: When the problem gives cost (or cost and revenue) data and asks to "determine", "find", or "establish" the plan, always state the objective explicitly (e.g., "I'm treating the objective as minimize total cost, since only costs are given."). If both cost and revenue are present, state whether you use "minimize cost" or "maximize profit". Ask the user if unclear.
Text: "The company operates 3 factories and plans to produce 500 units. It may use overtime at extra cost. Minimize total cost."
| Sentence / phrase | Label | Note |
|---|---|---|
| "Operates 3 factories" | Parameter | All 3 open; not facility selection. |
| "Plans to produce 500 units" | Constraint (implicit) | All 500 must be produced. |
| "May use overtime at extra cost" | Decision | How much overtime is a decision. |
| "Minimize total cost" | Objective | Drives decisions. |
Result: Parameters = 3 factories, 500 units target. Constraints = produce exactly 500 (implicit from "plans to produce"). Decisions = production allocation across factories, overtime amounts. Objective = minimize cost.
Implicit-objective example: A problem that asks to "determine the production plan" (or similar) and gives cost components (e.g., workshop, inspection, sales) but does not state "minimize" or "maximize" → Objective is implicit: minimize total cost. Always state it explicitly: "The objective is to minimize total cost."
QP objectives must be minimization. To maximize a quadratic expression, negate it and minimize; then negate the optimal value.
For minimization to be well-posed, the quadratic form Q should be positive semi-definite. If Q is indefinite, the problem is non-convex and may not have a finite optimum.
The remaining sections cover specific LP/MILP modeling patterns. Each is independent — read the one that matches your problem.
When modeling concave piecewise-linear profit/cost functions (e.g., decreasing marginal profit for bulk sales), the standard approach uses continuous segment variables with upper bounds equal to each segment's width. For a maximization with concave profit, the solver fills higher-profit segments first naturally.
Gotcha: If the quantity being produced is discrete (pieces, units, items), the total production variable must be INTEGER, even though segment variables can remain CONTINUOUS. Without this, the LP relaxation may yield a fractional total that produces a different (higher or lower) objective than the true integer optimum.
x_total — INTEGER (total production of a product)
s1, s2, … — CONTINUOUS (amount sold in each price segment, bounded by segment width)
Link: x_total = s1 + s2 + …
Resource constraints use x_total.
Objective uses segment variables × segment profit rates.In cutting stock problems, waste area includes both trim loss (unused width within each cutting pattern) and over-production (excess strips produced beyond demand). Minimizing only trim loss (waste width × length per pattern) ignores over-production and yields an incorrect objective.
Since the total useful area demanded is a constant, minimizing waste is equivalent to minimizing total material area consumed:
minimize sum_j (roll_width_j × x_j)where x_j is the length cut using pattern j. The waste area is then:
waste = total_material_area − required_useful_areawhere required_useful_area = sum_i (order_width_i × order_length_i).
Using sum_j (waste_width_j × x_j) as the objective only captures trim loss — the unused strip within each pattern. It does not penalize over-production of an order. The solver will over-produce narrow orders to fill patterns efficiently, but that excess material is still waste. Always use total material area as the objective.
Goal programming optimizes multiple objectives in priority order. Implement it as sequential solves — one per priority level.
expression + d⁻ − d⁺ = target.Deviation variables (d⁻, d⁺) and slack/idle-time variables are always continuous. However, decision variables must still be INTEGER when they represent discrete/countable quantities (units produced, vehicles, workers, etc.). Do not let the presence of continuous deviation variables cause you to make all variables continuous — the integrality of decision variables directly affects feasibility and objective values.
In problems with buying, selling, and warehouse capacity over multiple periods, decide which capacity constraints to include based on the problem's timing assumptions.
For each period t with inventory balance stock[t] = stock[t-1] + buy[t] - sell[t]:
stock[t] <= capacity — always needed.stock[t-1] + buy[t] <= capacity — prevents buying more than the warehouse can hold before any sales occur within the period.Key interaction with the sell constraint: If the model already has sell[t] <= stock[t-1] (grain bought this period cannot be sold this period), the model is bounded even without the after-purchase constraint. The sell constraint prevents unbounded buy-sell cycling. The after-purchase constraint is then an additional physical restriction, not a mathematical necessity.
Default: If the problem does not specify timing within a period, use only end-of-period capacity (stock[t] <= capacity). Add the after-purchase constraint only if the problem explicitly requires it.
In some blending problems, a subset of raw materials must be mixed together first (e.g., in a mixing tank) before being allocated to different products. The resulting intermediate has a uniform composition — you cannot independently assign different raw materials to different products.
The standard blending LP uses variables x[i][j] (amount of raw material i in product j) and freely allocates each raw material to each product. When raw materials share a mixing step, the proportions of those raw materials must be identical in every product that receives the intermediate. This proportionality constraint is bilinear (x[A,1]*x[B,2] = x[B,1]*x[A,2]) and cannot be directly expressed in an LP.
Single-product allocation: If analysis shows the intermediate is profitable in only one product, allocate all intermediate to that product (set intermediate allocation to other products to zero). The proportionality constraint becomes trivially satisfied. This is the most common case — check profitability of intermediate in each product before attempting a general split.
Parametric over intermediate concentration: Fix the sulfur/quality concentration of the intermediate as a parameter σ. For each fixed σ, the problem is a standard LP (intermediate becomes a virtual raw material with known properties). Solve for a grid of σ values or use the structure to find the optimum analytically.
Scenario enumeration: When only 2–3 products exist, enumerate which products receive the intermediate (all-to-A, all-to-B, split). For each scenario with a single recipient, the LP is standard. For split scenarios, use strategy 2.
Before formulating, check whether using the intermediate in each product is profitable:
cost_intermediate > sell_price[j] for some product j, the intermediate should not be allocated to product j. Raw material C (or other direct inputs) alone may also be unprofitable if cost_C > sell_price[j].© NVIDIA, Apache-2.0. Rendered from Markdown: HTML in the file is shown as text, images as links, and headings moved down two levels. Raw file
SKILL.md and 4 other files in skills/cuopt-numerical-optimization-formulation of NVIDIA/skills.
Open the folder on GitHubat commit 0e0d506
Cuopt Numerical Optimization Formulation next to the 5 skills that share the most tags, products or categories with it. Stars are the repository's; “used in” counts other GitHub owners with a copy.
| Skill | Stars | Used in | Tokens | Auto-check | Licence | Repo updated |
|---|---|---|---|---|---|---|
| Cuopt Numerical Optimization Formulation this skillNVIDIA/skills | 3.5k | — | ~4.9k | Automated safety check: Pass | Apache-2.0 | |
| Statistical Problem Formulationaiming-lab/AutoResearchClaw | 15k | — | ~671 | Automated safety check: Pass | MIT | |
| Jmsc Problem Formulationbrycewang-stanford/Awesome-Journal-Skills | 1.2k | — | ~703 | Automated safety check: Pass | MIT | |
| Is This A Problemanthropics/claude-for-legal | 9.6k | 2 repos | ~2.3k | Automated safety check: Pass | Apache-2.0 | |
| JavaScript Concept Page Workflowleonardomso/33-js-concepts | 67k | — | ~3.9k | Automated safety check: Pass | MIT | |
| JavaScript Concept Page Writerleonardomso/33-js-concepts | 67k | — | ~14k | Automated safety check: Pass | MIT |
aiming-lab/AutoResearchClaw
Formulate statistical research problems with formal notation, target parameters, assumptions, hypotheses, evaluation criteria, and theory targets.
brycewang-stanford/Awesome-Journal-Skills
A skill your agent uses when formalizing the decision problem before model building for a 《管理科学学报》 (Journal of Management Sciences in China) manuscript — identifying the decision maker(s), decision…
anthropics/claude-for-legal
Fast "is this a problem?" answer for the quick Slack question — pattern-matches against your calibration.
leonardomso/33-js-concepts
Orchestrates five skills to produce a complete JavaScript concept documentation page, from resource curation through writing, tests, fact-checking and SEO.
leonardomso/33-js-concepts
Writes or reviews documentation pages for the 33 JavaScript Concepts project, following its structure, a beginner-friendly voice and rules against AI-sounding language.
parcadei/Continuous-Claude-v3
Problem-solving strategies for numerical integration in numerical methods
NVIDIA/skills
A skill your agent uses when the user wants to deploy, run, debug, tear down, or call the REST API of the RTVI-CV 2D detection / tracking microservice.
NVIDIA/skills
Generates, validates, compares and explains HOLOLINK_def.svh macro files for the HSB IP, using bundled Python scripts and asking before it writes anything.
NVIDIA/skills
Runs and validates an end-to-end Mission Control demo in a locally installed Isaac Sim, with a Nova Carter robot driven through a Python server.
NVIDIA/skills
Orchestrates defect image generation for PCBA, metal surface and glass inspection with NVIDIA Cosmos AnomalyGen on OSMO, from cold-start Day 0 to real-photo Day 1 labeling.
NVIDIA/skills
Orchestrates video data augmentation and auto-labeling workflows on OSMO, from flow selection and preflight checks to submission, monitoring and output download.
NVIDIA/skills
Runs NVIDIA TAO Data Services KPI analysis on object detection results, comparing predictions to ground truth and writing per-class precision, recall and AP to a CSV.
LP, MILP, QP — concepts, problem-text parsing, and formulation patterns (parameters, constraints, decisions, objective). Cuopt Numerical Optimization Formulation is an agent skill from NVIDIA/skills, published by the product's own GitHub organization. LP, MILP, QP — concepts, problem-text parsing, and formulation patterns (parameters, constraints, decisions, objective).
Run `npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a claude-code`. Or copy the skill folder (skills/cuopt-numerical-optimization-formulation in NVIDIA/skills) into .claude/skills/cuopt-numerical-optimization-formulation in your project. Claude Code loads it when a task matches its description.
Run `npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a codex`. Or copy the skill folder (skills/cuopt-numerical-optimization-formulation in NVIDIA/skills) into .agents/skills/cuopt-numerical-optimization-formulation in your project. Codex loads it when a task matches its description.
Cursor, Gemini CLI, GitHub Copilot and OpenCode also load SKILL.md folders. With the skills CLI, run `npx skills add NVIDIA/skills --skill cuopt-numerical-optimization-formulation -a cursor` (or -a gemini-cli, github-copilot or opencode for the others). To copy it by hand, put the folder in .cursor/skills/cuopt-numerical-optimization-formulation, .gemini/skills/cuopt-numerical-optimization-formulation, .github/skills/cuopt-numerical-optimization-formulation and .opencode/skills/cuopt-numerical-optimization-formulation in your project.
SKILL.md names no scripts, command-line tools or credentials: Cuopt Numerical Optimization Formulation is instructions for the agent only.
SKILL.md contains no URLs. Any network use would come from the scripts or tools the agent runs. This is read from the text; nothing was executed.
Our automated static check of SKILL.md found no risky patterns, such as piping downloads into a shell, reading credential files or hidden Unicode. It is not a guarantee. Review the folder before installing.
Cuopt Numerical Optimization Formulation is published under the Apache-2.0 licence (declared in SKILL.md). It allows redistribution, so the full SKILL.md is shown on this page.
About 4.9k tokens (SKILL.md is roughly 19k characters). Agents keep only the skill's name and description in context until a task matches; then they load SKILL.md in full.
Skills that share tags, products or a category with Cuopt Numerical Optimization Formulation: Statistical Problem Formulation (aiming-lab/AutoResearchClaw, 15k stars), Jmsc Problem Formulation (brycewang-stanford/Awesome-Journal-Skills, 1.2k stars), Is This A Problem (anthropics/claude-for-legal, 9.6k stars) and JavaScript Concept Page Workflow (leonardomso/33-js-concepts, 67k stars). The comparison table on this page puts their stars, adoption, token cost, safety result and licence side by side.
NVIDIA (a GitHub organization, an official publisher) maintains it in NVIDIA/skills, which has 3,534 GitHub stars. The repository holds 380 skills in this directory. The repository was last updated on October 7, 2026.
Source: NVIDIA/skills on GitHub. Facts on this page come from the repository at the commit we read; the author's words are quoted as theirs.