Verified Linear Programming through Tolerance-Aware Precision Boosting (Q7345620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verified Linear Programming through Tolerance-Aware Precision Boosting |
No description defined |
Statements
Verified Linear Programming through Tolerance-Aware Precision Boosting (English)
0 references
10 September 2026
0 references
math.OC
0 references
math.NA
0 references
Ernesto Casablanca
0 references
Martin Sidaway
0 references
Paolo Zuliani
0 references
Sadegh Soudjani
0 references
We propose a tolerance-aware, precision-boosting simplex algorithm for verified linear programming with formal correctness guarantees and a novel delta-complete termination criterion, allowing users to control the trade-off between numerical stability, computational efficiency, and soundness via adjustable tolerances.
0 references
Verified Linear Programming
0 references
Tolerance-Aware Precision Boosting
0 references
Linear Optimization
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
