# Solution is unbounded, optimization problem in Matlab after modification.

The solutions seems to be unbounded even if the array A is changed to [-4 1 5; 4 1 5; 1 1 1]; Anything wrong with syntax. Could not figure out. Any help.

• It is obvious to me that the problem is unbounded. Solution: $x_1=0, x_2=-c+1, x_3=c$, where $c \geq 2$. Any $c^*$ can be increased. – callculus Sep 13 '19 at 18:39
• Ohh I got it. Thanks @callculus. – Vinay5forPrime Sep 13 '19 at 18:41
• You´re welcome. – callculus Sep 13 '19 at 18:43
• It is $c\geq \frac12$-not $2$ – callculus Sep 13 '19 at 18:52