| Article ID: | iaor200971532 |
| Country: | Germany |
| Volume: | 3 |
| Issue: | 4 |
| Start Page Number: | 483 |
| End Page Number: | 489 |
| Publication Date: | Sep 2009 |
| Journal: | Optimization Letters |
| Authors: | Schaefer Andrew J |
We consider the integer programming version of inverse optimization. Using superadditive duality, we provide a polyhedral description of the set of inverse-feasible objectives. We then describe two algorithmic approaches for solving the inverse integer programming problem.