Abstract
Lifting, tilting and fractional programming, though seemingly different, reduce to a common optimization problem. This connection allows us to revisit key properties of these three problems on mixed integer linear sets. We introduce a simple common framework for these problems, and extend known results from each to the other two.
Original language | English |
---|---|
Pages (from-to) | 559-563 |
Number of pages | 5 |
Journal | Operations Research Letters |
Volume | 38 |
Issue number | 6 |
DOIs | |
State | Published - Nov 2010 |
Keywords
- Fractional programming
- Lifting
- Mixed-integer programming
- Tilting