A New Warmstarting Strategy for the Primal-Dual Column Generation Method
Date
2015
Type:
Artículo
item.page.extent
113-146
item.page.accessRights
Authors
item.contributor.advisor
ORCID:
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
item.page.isbn
item.page.issn
item.page.issne
item.page.doiurl
item.page.other
item.page.references
Abstract
This paper presents a new warmstarting technique in the context of a primal-dual column generation method applied to solve a particular class of combinatorial optimization problems. The technique relies on calculating an initial point and on solving auxiliary linear optimization problems to determine the step direction needed to fully restore primal and dual feasibilities after new columns arrive. Conditions on the maximum size of the cuts and on a suitable initial point are discussed. Additionally, the strategy ensures that the duality gap of the warmstart is bounded by the old duality gap multiplied with a (small) constant, which depends on the relation between the old and modified problems. Computational experiments demonstrate the gains achieved when compared to a coldstart approach.
Description
item.page.coverage.spatial
item.page.sponsorship
Citation
Mathematical Programming August 2015, Volume 152, Issue 1, pp 113–146