Skip to content

Cuopt

GPU accelerated decision optimization

Install

$git clone https://github.com/NVIDIA/cuopt

Install command taken from the project's README or registry entry. Always review code before running it.

cuOpt - GPU-accelerated Optimization

NVIDIA® cuOpt™ is a GPU-accelerated optimization engine that excels in linear programming (LP), quadratic programming (QP), and vehicle routing problems (VRP), with support for quadratically constrained quadratic programming (QCQP) (beta), second-order cone programming (SOCP) (beta), and mixed integer programming (MIP) (beta). cuOpt enables near real-time solutions for large-scale LPs with millions of variables and constraints and offers easy integration into existing modeling languages with seamless deployment across hybrid and multi-cloud environments.

The cuOpt MIP solver is in beta and under active development. The solver currently excels at finding high-quality feasible solutions quickly with GPU-accelerated primal heuristics. Proving feasible solutions optimal remains under active development.

cuOpt offers easy integration into existing solvers, and seamlessly extends into agent-first optimization workflows through open-source cuOpt agent skills.

The core engine is written in C++ and wrapped with a C API, Python API and Server API.

For the latest version, ensure you are on the main branch.

Latest Documentation

cuOpt Documentation

Supported APIs

cuOpt supports the following APIs:

  • C API support
    • Linear Programming (LP)
    • Quadratic Programming (QP)
    • Quadratically Constrained Quadratic Programming (QCQP) (beta)
    • Second-Order Cone Programming (SOCP) (beta)
    • Mixed Integer Programming (MIP) (beta)
  • C++ API support
    • cuOpt is written in C++ and includes a native C++ API. However, we do not provide documentation for the C++ API at this time. We anticipate that the C++ API will change significantly in the future. Use it at your own risk.
  • Python support
    • Routing (TSP, VRP, and PDP)
    • Linear Programming (LP)
    • Quadratic Programming (QP)
    • Quadratically Constrained Quadratic Programming (QCQP) (beta)
    • Second-Order Cone Programming (SOCP) (beta)
    • Mixed Integer Programming (MIP) (beta)
    • Algebraic modeling Python API allows users to easily build constraints and objectives
  • Server support
    • Linear Programming (LP)
    • Routing (TSP, VRP, and PDP)
    • Mixed Integer Programming (MIP) (beta)

This repo is also hosted as a COIN-OR project.

Latest Release Notes:

RELEASE-NOTES.md

Installation

CUDA/GPU requirements

  • CUDA 12.0+ or CUDA 13.0+
  • NVIDIA driver >= 525.60.13 (Linux) and >= 527.41 (Windows)
  • Volta architecture or better (Compute Capability >=7.0)

Python requirements

  • Python >=3.11, <=3.14

OS requirements

  • Only Linux is supported and Windows via WSL2
    • x86_64 (64-bit)
    • aarch64 (64-bit)

Note: WSL2 is tested to run cuOpt, but not for building.

More details on system requirements can be found here

Pip

Pip wheels are easy to install and easy to configure. Users with existing workflows who uses pip as base to build their workflows can use pip to install cuOpt.

cuOpt can be installed via pip from the NVIDIA Python Package Index. Be sure to select the appropriate cuOpt package depending on the major version of CUDA available in your environment:

For CUDA 12.x:

Similar plugs

Open-source AI job search agent and job finder: scan job boards, score each job 1-5 against your CV before you apply, tailor an ATS-friendly resume and cover letter, get…

Editorial diagram design for Claude Code, Codex, GitHub Copilot, Cursor, Factory Droid, and Pi. 44 diagram types. Self-contained HTML + SVG. No shadows. No Mermaid slop.

Secure, fast, efficient, battle-tested at Alibaba's scale. Hybrid architecture code review tool: deterministic pipelines + LLM Agent, precise line-level comments, built-in…

Persistent file-based planning for AI coding agents and long-running tasks. Crash-proof markdown plans, session recovery after /clear and compaction, per-turn re-injection…