cuopt-numerical-optimization-api
LP, MILP, and QP (beta) with cuOpt — Python, C, and CLI. Use when the user is solving LP, MILP, or QP with any cuOpt interface.
- License 许可
- Apache-2.0
- 最近更新
- 2026-11-02
- Stars
- ★ 0
- Forks
- 1
01 前言 Front Matter
- name
- cuopt-numerical-optimization-api
- license
- Apache-2.0
- version
- 26.08.00
- metadata
- { "tags": [ "cuopt", "linear-programming", "milp", "qp", "python", "c-api", "cli" ], "author": "NVIDIA cuOpt Team" }
- description
- LP, MILP, and QP (beta) with cuOpt — Python, C, and CLI. Use when the user is solving LP, MILP, or QP with any cuOpt interface.
02 资源文件 51
- 资产文件assets/c/lp_basic/lp_simple.c3.6 KB
- 资产文件assets/c/lp_basic/README.md466 B
- 资产文件assets/c/lp_duals/lp_duals.c4.0 KB
- 资产文件assets/c/lp_duals/README.md500 B
- 资产文件assets/c/lp_warmstart/README.md289 B
- 资产文件assets/c/milp_basic/milp_simple.c3.4 KB
- 资产文件assets/c/milp_basic/README.md405 B
- 资产文件assets/c/milp_production_planning/milp_production.c3.5 KB
- 资产文件assets/c/milp_production_planning/README.md459 B
- 资产文件assets/c/mps_solver/data/sample.mps490 B
- 资产文件assets/c/mps_solver/mps_solver.c3.4 KB
- 资产文件assets/c/mps_solver/README.md590 B
- 资产文件assets/c/README.md1.7 KB
- 资产文件assets/cli/lp_production/production.mps375 B
- 资产文件assets/cli/lp_production/README.md192 B
- 资产文件assets/cli/lp_simple/README.md191 B
- 资产文件assets/cli/lp_simple/sample.mps490 B
- 资产文件assets/cli/milp_facility/facility.mps694 B
- 资产文件assets/cli/milp_facility/README.md199 B
- 资产文件assets/cli/README.md856 B
- 脚本assets/python/least_squares/model.py831 B
- 资产文件assets/python/least_squares/README.md136 B
- 脚本assets/python/lp_basic/model.py1.1 KB
- 资产文件assets/python/lp_basic/README.md207 B
- 脚本assets/python/lp_duals/model.py1.2 KB
- 资产文件assets/python/lp_duals/README.md227 B
- 脚本assets/python/lp_warmstart/model.py1.8 KB
- 资产文件assets/python/lp_warmstart/README.md140 B
- 脚本assets/python/maximization_workaround/model.py736 B
- 资产文件assets/python/maximization_workaround/README.md152 B
- 脚本assets/python/milp_basic/incumbent_callback.py1.8 KB
- 脚本assets/python/milp_basic/model.py1.2 KB
- 资产文件assets/python/milp_basic/README.md433 B
- 脚本assets/python/milp_production_planning/model.py1.2 KB
- 资产文件assets/python/milp_production_planning/README.md165 B
- 资产文件assets/python/mps_solver/data/README.md2.0 KB
- 资产文件assets/python/mps_solver/data/sample.mps490 B
- 脚本assets/python/mps_solver/model.py8.2 KB
- 资产文件assets/python/mps_solver/README.md2.2 KB
- 资产文件assets/python/mps_solver/results.md2.5 KB
- 脚本assets/python/portfolio/model.py1.6 KB
- 资产文件assets/python/portfolio/README.md232 B
- 资产文件assets/python/README.md581 B
- 参考文档BENCHMARK.md3.8 KB
- 参考文档evals/evals.json13.7 KB
- 参考文档references/c_api.md4.7 KB
- 参考文档references/cli_api.md5.5 KB
- 参考文档references/python_api.md4.7 KB
- 参考文档references/qp_examples.md5.7 KB
- 参考文档skill-card.md4.1 KB
- 其他skill.oms.sig15.9 KB
03 SKILL.md 正文
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).
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.
04 同仓库更多 Skills
youtube-clipper
YouTube 视频智能剪辑工具。下载视频和字幕,AI 分析生成精细章节(几分钟级别), 用户选择片段后自动剪辑、翻译字幕为中英双语、烧录字幕到视频,并生成总结文案。 使用场景:当用户需要剪辑 YouTube 视频、生成短视频片段、制作双语字幕版本时。 关键词:视频剪辑、YouTube、字幕翻译、双语字幕、视频下载、clip video
viem-integration
Integrate EVM blockchains using viem. Use when user says "read blockchain data", "send transaction", "interact with smart contract", "connect to Ethereum", "use viem", "use wagmi", "wallet integration", "viem setup", or mentions blockchain/EVM development with TypeScript.
v4-security-foundations
Security-first Uniswap v4 hook development. Use when user mentions "v4 hooks", "hook security", "PoolManager", "beforeSwap", "afterSwap", or asks about V4 hook best practices, vulnerabilities, or audit requirements.
v4-sdk-integration
App-layer SDK guide for building swap and liquidity experiences directly with the Uniswap v4 SDK. Use when user asks about "v4 sdk", "uniswap v4", "v4 swap", "v4 liquidity", "PoolManager", "V4Planner", "StateView", "PositionManager", "pool state", "v4 position", "uniswap sdk", or when building swap/liquidity UX directly with SDKs rather than via the Trading API.
v4-hook-generator
Generate Uniswap v4 hook contracts via OpenZeppelin MCP. Use when building custom swap logic, async swaps, hook-owned liquidity, custom curves, dynamic fees, MEV protection, limit orders, or oracle hooks.
testing
For testing with Light Protocol programs and clients on localnet, devnet, and mainnet validation.