# Two-Dimensional Batch Linear Programming on the GPU

## TL;DR

This paper introduces a GPU-based algorithm for efficiently solving multiple two-dimensional linear programs simultaneously, achieving significant speedups over existing CPU and GPU solvers.

## Contribution

The paper presents a novel GPU algorithm specifically designed for batch two-dimensional linear programming, significantly improving computational efficiency.

## Key findings

- Speedups of over 22x compared to GPU solvers.
- Speedups of over 63x compared to CPU solvers.
- Effective utilization of GPU for batch geometric optimization.

## Abstract

This paper presents a novel, high-performance, graphical processing unit-based algorithm for efficiently solving two-dimensional linear programs in batches. The domain of two-dimensional linear programs is particularly useful due to the prevalence of relevant geometric problems. Batch linear programming refers to solving numerous different linear programs within one operation. By solving many linear programs simultaneously and distributing workload evenly across threads, graphical processing unit utilization can be maximized. Speedups of over 22 times and 63 times are obtained against state-of-the-art graphics processing unit and CPU linear program solvers, respectively.