Persistency of linear programming relaxations for the stable set problem

Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter*, Stefan Weltge

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

38 Downloads (Pure)


The Nemhauser–Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: for every optimal LP solution that assigns integer values to some variables, there exists an optimal integer solution in which these variables retain the same values. While the standard LP is defined by only non-negativity and edge constraints, a variety of other LP formulations have been studied and one may wonder whether any of them has this property as well. We show that any other formulation that satisfies mild conditions cannot have the persistency property on all graphs, unless it is always equal to the stable set polytope.
Original languageEnglish
Number of pages21
JournalMathematical programming
Early online date11 Jan 2021
Publication statusPublished - 11 Jan 2021


Dive into the research topics of 'Persistency of linear programming relaxations for the stable set problem'. Together they form a unique fingerprint.

Cite this