A Dissection of the Duality Gap of Set Covering Problems

Ngulo, Uledi,1983-Linköpings universitet,Tillämpad matematik,Tekniska fakulteten (författare)

Set covering problems are well-studied and have many applications. Sometimes the duality gap is significant and the problem is computationally challenging. We dissect the duality gap with the purpose of better understanding its relationship to problem characteristics, such as problem shape and density. The means for doing this is a set of global optimality conditions for discrete optimization problems. These decompose the duality gap into two terms: near-optimality in a Lagrangian relaxation and near-complementarity in the relaxed constraints. We analyse these terms for numerous instances of large size, including some real-life instances. We conclude that when the duality gap is large, typically the near-complementarity term is large and the near-optimality term is small. The large violation of complementarity is due to extensive over-coverage. Our observations should have implications for the design of solution methods, and especially for the design of core problems.

Larsson, Torbjörn,1957-Linköpings universitet,Tillämpad matematik,Tekniska fakulteten(Swepub:liu)torla64 (författare)
Quttineh, Nils-Hassan,1979-Linköpings universitet,Tillämpad matematik,Tekniska fakulteten(Swepub:liu)nilqu94 (författare)
Linköpings universitetTillämpad matematik (creator_code:org_t)

Ingår i:Operations Research Proceedings 2019Cham : Springer International Publishing, s. 175-1819783030484385

Av författaren/redakt...: Ngulo, Uledi, 19 ...; Larsson, Torbjör ...; Quttineh, Nils-H ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.