| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142887 | Operations Research Letters | 2010 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daniel Espinoza, Ricardo Fukasawa, Marcos Goycoolea,