NVIDIA/cuopt

GPU accelerated decision optimization

What it solves

cuOpt is a GPU-accelerated optimization engine designed to solve complex mathematical programming and routing problems at scale. It addresses the challenge of finding high-quality solutions for large-scale linear and quadratic programming problems—some with millions of variables and constraints—in near real-time, which is often computationally prohibitive for traditional CPU-based solvers.

How it works

Written in C++ and exposed via C, Python, and Server APIs, cuOpt leverages NVIDIA GPUs to accelerate the solving process. It supports various optimization types, including Linear Programming (LP), Quadratic Programming (QP), and Vehicle Routing Problems (VRP). For Mixed Integer Programming (MIP), it uses GPU-accelerated primal heuristics to quickly find high-quality feasible solutions.

Who it’s for

It is intended for developers and researchers working on large-scale optimization, logistics (routing), and mathematical programming who need the speed of GPU acceleration and the ability to deploy across hybrid or multi-cloud environments.

Highlights

  • Broad Optimization Support: Handles LP, QP, VRP, and beta support for QCQP, SOCP, and MIP.
  • Massive Scale: Capable of solving LPs with millions of variables and constraints.
  • Flexible Integration: Provides Python, C, and Server APIs, including an algebraic modeling Python API for building constraints and objectives.
  • Agent-Ready: Includes open-source agent skills to integrate optimization into agent-first workflows.

Related

  • Project
  • Project
  • Project
  • Project
  • Project