Memodelkan dan menyelesaikan masalah linear, mixed-integer, dan quadratic programming menggunakan solver yang dipercepat GPU melalui Python, C, atau CLI.
- Bintang GitHub
- 3.934
- File
- 52
- Commit terakhir
- 11 Nov 2026
- Lisensi
- Apache-2.0
- Tool yang diizinkan
- —
Apa fungsi skill cuopt-numerical-optimization-api?
cuopt-numerical-optimization-api adalah agent skill. Memodelkan dan menyelesaikan masalah linear, mixed-integer, dan quadratic programming menggunakan solver yang dipercepat GPU melalui Python, C, atau CLI.
Ringkasan dibuat dari SKILL.md skill ini.
Tentang skill cuopt-numerical-optimization-api
SKILL ini memungkinkan developer dan peneliti untuk menyelesaikan masalah linear, mixed-integer, dan quadratic programming menggunakan akselerasi GPU. Anda mendapatkan akses ke NVIDIA cuOpt solver melalui Python, C/C++, atau command line interface. Agent harus memuat tool ini saat pengguna perlu memodelkan optimasi matematika yang kompleks, seperti menentukan aliran sumber daya atau membuat keputusan diskrit yes/no.
Selain pemanggilan API secara langsung, skill ini bertindak sebagai backend untuk bahasa pemodelan mapan termasuk AMPL, GAMS, PuLP, JuMP, Pyomo, dan CVXPY. Hal ini memungkinkan pengguna untuk beralih ke penyelesaian yang dipercepat GPU dengan perubahan kode yang minimal. Tool ini menangani variabel kontinu untuk masalah linear dan variabel integer untuk hitungan diskrit atau pilihan biner. Skill ini juga mendukung quadratic programming dalam versi beta untuk meminimalkan varians atau squared errors, meskipun memerlukan objektif berupa tugas minimisasi dan matriks harus bersifat positive semi-definite.
Apa yang bisa dilakukan agent dengannya
- 1Menyelesaikan alokasi sumber daya kontinuMenentukan distribusi optimal dari jumlah pecahan seperti liter atau dolar menggunakan linear programming.
- 2Mengelola jumlah entitas diskritMenghitung jumlah truk atau pekerja yang dibutuhkan untuk tugas tertentu menggunakan mixed-integer programming.
- 3Meminimalkan varians dalam portofolioMelakukan quadratic programming untuk meminimalkan squared error atau varians dalam sebuah dataset.
- 4Integrasi dengan model yang sudah adaMenggunakan cuOpt sebagai solver backend untuk model yang sudah ditulis dalam Pyomo atau CVXPY.
Ditulis dari SKILL.md milik skill tersebut. Setiap use case diverifikasi dengan kutipan darinya.
Cara install skill cuopt-numerical-optimization-api
Setiap perintah menyalin folder skill ke direktori skills client. Restart client atau mulai sesi baru untuk memuatnya.Install skill cuopt-numerical-optimization-api di Claude Code
~/.claude/skills/cuopt-numerical-optimization-api/SKILL.md
$ npx degit NVIDIA/skills/skills/cuopt-numerical-optimization-api ~/.claude/skills/cuopt-numerical-optimization-apiInstall skill cuopt-numerical-optimization-api di Claude Code (project)
.claude/skills/cuopt-numerical-optimization-api/SKILL.md
$ npx degit NVIDIA/skills/skills/cuopt-numerical-optimization-api .claude/skills/cuopt-numerical-optimization-apiInstall skill cuopt-numerical-optimization-api di Codex
~/.agents/skills/cuopt-numerical-optimization-api/SKILL.md
$ npx degit NVIDIA/skills/skills/cuopt-numerical-optimization-api ~/.agents/skills/cuopt-numerical-optimization-apiInstall skill cuopt-numerical-optimization-api di Gemini CLI
~/.gemini/skills/cuopt-numerical-optimization-api/SKILL.md
$ npx degit NVIDIA/skills/skills/cuopt-numerical-optimization-api ~/.gemini/skills/cuopt-numerical-optimization-apiInstall skill cuopt-numerical-optimization-api di Claude.ai
npx degit NVIDIA/skills/skills/cuopt-numerical-optimization-api cuopt-numerical-optimization-api && zip -r cuopt-numerical-optimization-api.zip cuopt-numerical-optimization-api # claude.ai → Customize → Skills → + → Create skill → Upload a skill → cuopt-numerical-optimization-api.zip
Pengecekan otomatis
Berjalan 15 Nov 2026Laporan lengkap →Lolos cek otomatis kami. Ini bukan audit keamanan: baca skripnya sebelum membiarkan agent menjalankannya. Cara kerja checks · Yang perlu diperbaiki untuk menambah poin
- Source repository terhubung dan dapat dijangkaunvidia/skills/skills/cuopt-numerical-optimization-api is public and reachablegithub.com/nvidia/skills/tree/HEAD/skills/cuopt-numerical-op ↗Lolos
- Lisensi open source (OSI)Apache-2.0spdx.org/licenses/Apache-2.0.html ↗Lolos
- Ada commit atau release dalam satu tahun terakhirLast commit 2026-11-11github.com/nvidia/skills/commits ↗Lolos
- Skrip tanpa unduh-lalu-jalankan atau pencurian kredensial5 of 10 scripts read; none of them downloads and runs code, the rest were not readTemuan
- Tidak ada instruksi tersembunyi di SKILL.mdNo override phrases, safeguard switches, credential requests or hidden charactersgithub.com/nvidia/skills/blob/HEAD/skills/cuopt-numerical-op ↗Lolos
- Tool yang diizinkan otomatis dibatasiNo pre-approved tools; the agent asks before using onegithub.com/nvidia/skills/blob/HEAD/skills/cuopt-numerical-op ↗Lolos
- SKILL.md mengikuti format Agent SkillsValid name and description; says when to use it; 104 linesgithub.com/nvidia/skills/blob/HEAD/skills/cuopt-numerical-op ↗Lolos
SKILL.md
Lihat di GitHubcuOpt 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).
Integer vs Continuous from Wording
| Problem wording / concept | Variable type | Examples |
|---|---|---|
| Discrete entities (counts) | INTEGER | Workers, cars, trucks, machines, pilots, facilities, units to manufacture |
| Yes/no or on/off | INTEGER (binary, lb=0 ub=1) | Open a facility, run a machine, assign a person to a shift |
| Amounts that can be fractional | CONTINUOUS | Tonnes, litres, dollars, hours, kWh, proportion of capacity |
| Rates or fractions | CONTINUOUS | Utilization, percentage, share of budget |
Rule of thumb: "How many things" → INTEGER. "How much" → CONTINUOUS.
QP Rules (all interfaces)
- MINIMIZE only — the solver rejects MAXIMIZE for quadratic objectives. To maximize
f(x), minimize-f(x)and negate the reported objective value. - Continuous variables only — integer QP is not supported.
- Q should be positive semi-definite for a convex, well-posed problem.
- Beta — API may evolve; treat as production-capable for typical convex QP.
Dual Values
Duals and reduced costs are available for LP and QP only:
- MILP — no duals (integer optima are not continuous).
- Quadratic constraints — duals unavailable even for LP/QP; all values return
NaN. - PDLP warmstart — LP only; MILP solves do not accept a PDLP warmstart.
Common Issues (all interfaces)
| Problem | Likely cause | Fix |
|---|---|---|
| Infeasible | Conflicting constraints | Check constraint logic and bounds |
| Unbounded | Missing bounds | Add variable bounds |
| Slow solve | Large problem | Set time limit; increase gap tolerance |
| QP rejected with MAXIMIZE | QP only supports MINIMIZE | Negate the objective; negate the result |
| QP returns non-optimal | Q not PSD or badly scaled | Check Q is PSD; rescale variables |
Solver Settings (concepts)
| Setting | Purpose |
|---|---|
time_limit |
Stop after N seconds |
mip_relative_gap |
Stop MILP when within X% of optimal |
mip_absolute_tolerance |
Absolute MIP gap stop |
log_to_console |
Enable solver logging |
Syntax varies by interface — see the interface reference file.
Berkas dalam skill ini
52Pertanyaan seputar skill cuopt-numerical-optimization-api
Bagaimana cara install skill cuopt-numerical-optimization-api di Claude Code?
Jalankan npx degit NVIDIA/skills/skills/cuopt-numerical-optimization-api ~/.claude/skills/cuopt-numerical-optimization-api. Claude Code memuat skill dari ~/.claude/skills (semua proyek) atau .claude/skills (satu proyek) dan menggunakan skill saat deskripsinya cocok dengan tugas.
Client mana saja yang bisa menggunakan skill cuopt-numerical-optimization-api?
Client apa pun yang membaca format Agent Skills: Claude Code, Codex, Gemini CLI, dan claude.ai (unggah sebagai ZIP). Script dalam skill hanya berjalan di client yang mengizinkan eksekusi kode.
Bisakah saya menggunakan cuOpt dengan bahasa pemodelan yang sudah ada seperti Pyomo atau PuLP?
Ya, cuOpt berfungsi sebagai solver backend untuk tool pihak ketiga termasuk AMPL, GAMS, PuLP, JuMP, Pyomo, dan CVXPY.