Assume we have the following Mixed Integer programming.
MIP 1) $Z1=$ Max $Ax+By$
s.t
$Cx+Dy<=E$
$x>=0$ and $y: {0,1}$
Now, assume we have the same MIP, and I just converted A to A'
MIP2) $Z2=$ Max $A'x+By$
s.t.,
$Cx+Dy<=E$
$x>=0$ and $y: {0,1}$
My question is that if we can determine a bound for the difference of optimal solution of $Z1$ and $Z2$
i.e., $Z1^*-Z2^* <= Upper bound$
Thank you for your insight.