p****t
发帖数: 292 | 1 this looks like an integer programming problem to me.
define x_1,...x_m binary variables
max sum_{i=1:m}(x_i)
st lhs(equ i) <= K(1-x_i) i=1:M
-lhs(equ i) <= K(1-x_i) i=1:M
x_i =0,1 i=1:M
K is a sufficient large number.
now if x_i=1, equ i is satisfied and we are maximizing the number of equations
satisfied. done. |
|
