My objective function is $\log_2(1+{x^2y^2})$ and I found two upper bounds for $x^2$ and $y^2$.

For example, assumed that we have the following upper bounds: $x^2\leq\text{constant}_1^2$ and $y^2\leq\text{constant}_2^2$.

So, my question is: could we say that $\log_2(1+{x^2y^2})\leq \log_2(1+{\text{constant}_1^2\cdot\text{constant}_2^2})$? If so, how tight is this bound?

  • $\begingroup$ I would start with using $x^2y^2$ as objective. $\endgroup$ – Erwin Kalvelagen Apr 11 at 19:37
  • $\begingroup$ Actually, the main objective function is $\sum_{i}\log_2(1+x_i^2y_i^2)$ $\endgroup$ – Shayan zargari Apr 12 at 9:44

Yes, because $\log$ is monotonic, it preserves inequalities. The tightness depends on your other constraints.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.