2016/06/18 by Kanstantsin Pashkovich, Pashkovich, Kanstantsin
Computer Science · Mathematics · #Advanced Algebra and Logic #FOS: Mathematics #Graph theory and applications #Mathematical Inequalities and Applications #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.1606.05811
openalex publication_date 2016/06/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Split rank of a rational polyhedron is finite. The well known proof of this is based on the fact that split closure is stronger than the Chvátal closure, and the Chvátal rank of a rational polyhedron is finite due to the result of Chvátal and Schrijver. In this note we provide an independent proof for the fact that every rational polyhedron has finite split rank. In principal, we construct a nonnegative potential function which decreases by at least one with "every" second split closure unless the integer hull of the polyhedron is reached.