Return to Revisions

3 of 3

deleted 4 characters in body

edited Jun 6, 2015 at 13:19

23
3

How can I find the maximum value of this function?

For given values of $A \in \mathbb{R}^{m \times n}, b \in \mathbb{R}^m$, how can I find the value of:

$$ \max_{x \in [0,1]^n} \|Ax+b \|_1 $$

Or is this problem NP-hard?

linear-programming convex-optimization nonlinear-optimization

asked Jun 3, 2015 at 8:37

23
3