Abstract
We prove the following theorem which gives a bound on the proximity of the real and the integer solutions to certain constrained optimization programs.
Original language | English |
---|---|
Pages (from-to) | 133-135 |
Number of pages | 3 |
Journal | Mathematical Programming |
Volume | 51 |
Issue number | 1-3 |
DOIs | |
State | Published - Jul 1991 |
Keywords
- Convex programming
- integer programming
- linear programming