agentsclimarketplace

Nvidia cuopt numerical optimization api cli

Skill autohandai/community-skills/nvidia-cuopt-numerical-optimization-api-cli

A collection of curated, useful, and safe skills for Autohand Code CLI Agent

Install
npx -y skills add autohandai/community-skills --skill nvidia-cuopt-numerical-optimization-api-cli

Assembled from the repository path, not quoted from the project. Check it against their README if it does not work.

One thing to look at

  • 9 stars9 stars. Stars are a popularity signal and not a quality one, but at this level it is likely that nobody has read this closely except its author, and you would be relying on your own review.

What its author says it does

Copied from the file, not written here

LP, MILP, and QP (beta) with cuOpt — CLI only (MPS files, cuopt_cli). Use when the user is solving LP, MILP, or QP from MPS via command line.

The file declares its own license as Apache-2.0 AND CC-BY-4.0. That is the author’s claim about this one file, and it is not the same thing as the license GitHub reports for the repository, which is listed with the other numbers below.

SKILL.md

2.7 KB, 674 tokens by cl100k_base, as published. Nobody here has run it

cuOpt Numerical Optimization — CLI

Solve LP, MILP, and QP problems from MPS files via cuopt_cli. The same command, options, and MPS workflow apply across all three; QP uses the standard MPS quadratic-objective extension.

Confirm problem type and formulation (variables, objective, constraints, variable types) before coding.

This skill is CLI only (MPS input).

Basic usage

# Solve LP or MILP from MPS file
cuopt_cli problem.mps

# With options
cuopt_cli problem.mps --time-limit 120 --mip-relative-tolerance 0.01

Common options

cuopt_cli --help

# Time limit (seconds)
cuopt_cli problem.mps --time-limit 120

# MIP gap tolerance (stop when within X% of optimal)
cuopt_cli problem.mps --mip-relative-tolerance 0.001

# MIP absolute tolerance
cuopt_cli problem.mps --mip-absolute-tolerance 0.0001

# Presolve, iteration limit, method
cuopt_cli problem.mps --presolve --iteration-limit 10000 --method 1

MPS format (required sections, in order)

  1. NAME — problem name
  2. ROWS — N (objective), L/G/E (constraints)
  3. COLUMNS — variable names, row names, coefficients
  4. RHS — right-hand side values
  5. BOUNDS (optional) — LO, UP, FX, BV, LI, UI
  6. ENDATA

Integer variables: use 'MARKER' 'INTORG' before and 'MARKER' 'INTEND' after the integer columns.

QP via CLI (beta)

Quadratic objectives extend the standard MPS workflow — same cuopt_cli command, same options. Check cuopt_cli --help for QP-specific flags and the repo docs at docs/cuopt/source/cuopt-cli/ for the quadratic-objective MPS format.

QP rules:

  • MINIMIZE only. For maximization, negate the objective coefficients (and Q entries) in the MPS file.
  • Continuous variables only — do not mix integer markers with quadratic objectives.

Troubleshooting

  • Failed to parse MPS — Check ENDATA, section order (NAME, ROWS, COLUMNS, RHS, [BOUNDS], ENDATA), integer markers.
  • Infeasible — Check constraint directions (L/G/E) and RHS values.

Examples

Getting the CLI

CLI is included with the Python package (cuopt). Install via pip or conda; then run cuopt_cli --help to verify.

What ships with it: 10 files

22.5 KB alongside SKILL.md

Keep looking

Skills are one crate of 328,083. Ordering is by how many stacks a row turns up in, so the top of any crate is what has actually been picked rather than what has the most stars.