Dissecting the duality gap: the supporting hyperplane interpretation revisited

DOI10.1007/s11590-021-01764-7zbMath1498.90168OpenAlexW3168096629MaRDI QIDQ2119761

Nils-Hassan Quttineh, Torbjörn Larsson

Publication date: 30 March 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01764-7

zbMATH Keywords

Lagrangian relaxationduality gapset covering problemnon-convex optimizationglobal optimality conditions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A theoretical justification of the set covering greedy heuristic of Caprara et al.

Uses Software

• OR-Library

Cites Work

• A Lagrangian-based heuristic for large-scale set covering problems
• A dissection of the duality gap of set covering problems
• Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
• An integer programming column generation principle for heuristic search methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item