# Parallel parametric linear programming solving, and application to   polyhedral computations

**Authors:** Camille Coti (LIPN), David Monniaux (VERIMAG - IMAG), Hang Yu

arXiv: 1904.06079 · 2019-04-15

## TL;DR

This paper introduces a task-based parallel scheme for parametric linear programming, significantly improving computational speed for large-scale polyhedral problems and control applications.

## Contribution

It presents a novel parallelization method for parametric linear programming that achieves near-linear speedup, enhancing efficiency in polyhedral computations.

## Key findings

- Achieves quasi-linear speedup on large problems
- Effective parallelization of parametric linear programming
- Improves computational efficiency in control applications

## Abstract

Parametric linear programming is central in polyhedral computations and in certain control applications.We propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1904.06079/full.md

## Figures

21 figures with captions in the complete paper: https://tomesphere.com/paper/1904.06079/full.md

## References

8 references — full list in the complete paper: https://tomesphere.com/paper/1904.06079/full.md

---
Source: https://tomesphere.com/paper/1904.06079