Hi everybody, I'm working on a problem quite similar to binary quadratic programming --> (  SUM(i=1,...,n) SUM (j=1,...,n) q(i,j)x(i)x(j)
where n is the number of variables and q(i,j) is a symmetric matrix.)

Actually, my problem seems to be more difficult: consider the BQP above and multiply it by EXP( SUM (i=1,...,n) x(i) * ln P(i)), where P(i) is a vector of constants.

Can it be considered a BQP problem too? If not, what is its name?

Thank you!