Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
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 complete-hard?
Or is this problem NP complete?
Or is this problem NP-hard?
For given values of $a_i$, $b_{ji}$ $\in \mathbb{R}$$A \in \mathbb{R}^{m \times n}, b \in \mathbb{R}^m$, how can I find the value of:
$$ \max_{x_j\in [0,1]} \sum_i |a_i + \sum_j x_j b_{ji} | $$$$ \max_{x \in [0,1]^n} \|Ax+b \|_1 $$
For given values of $a_i$, $b_{ji}$ $\in \mathbb{R}$, how can I find the value of:
$$ \max_{x_j\in [0,1]} \sum_i |a_i + \sum_j x_j b_{ji} | $$
