| Article ID: | iaor1993333 |
| Country: | Netherlands |
| Volume: | 51 |
| Issue: | 1 |
| Start Page Number: | 133 |
| End Page Number: | 135 |
| Publication Date: | Jul 1991 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Werman Michael, Magagnosc David |
| Keywords: | programming: convex |
The authors prove a theorem which gives a bound on the proximity of the real and the integer solutions to certain constrained optimization programs.