Year: 2022
Type: preprint
Abstract: The complementarity knapsack problem (CKP) is a knapsack problem with real-valued variables and complementarity conditions between pairs of its variables. We extend the polyhedral studies of De Farias et al. for CKP, by proposing three new families of cutting-planes that are all obtained from a combinatorial concept known as a pack. Sufficient conditions for these inequalities to be facet-defining, based on the concept of a maximal switching pack, are also provided. Moreover, we answer positively a conjecture by de Farias et~al.~about the separation complexity of the inequalities introduced in their work, and propose efficient separation algorithms for our newly defined cutting-planes.
Source: arXiv (Cornell University)
Authors: Del Pia, Alberto, Linderoth, Jeff, Zhu, Haoran
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
Funder: Office of Naval Research
Awards: G5972442391, G7976293659, G8876996369
OpenAlex ID: W4320169988