A Gilmore-Gomory-Type Construction of Integer Programming Value Functions
Optimization and Control
2021-02-03 v2
Abstract
In this paper, we analyze how sequentially introducing decision variables into an integer program (IP) affects the value function and its level sets. We use a Gilmore-Gomory approach to find parametrized IP value functions over a restricted set of variables. We introduce the notion of maximal connected subsets of level sets - volumes in which changes to the constraint right-hand side have no effect on the value function - and relate these structures to IP value functions and optimal solutions.
Cite
@article{arxiv.2006.10223,
title = {A Gilmore-Gomory-Type Construction of Integer Programming Value Functions},
author = {Seth Brown and Wenxin Zhang and Temitayo Ajayi and Andrew Schaefer},
journal= {arXiv preprint arXiv:2006.10223},
year = {2021}
}