Prev: What is net.hint?
Next: OFDMA and SC-FDMA simulink
From: Antoine Khuu on 7 Feb 2010 22:08
I did with matrix left division as follows:
A1=[1 1 1 1 1 ;1 1 1 1 0;10 6 8 5 4;0 2 2 2 1;0 0 0 1 2];
B=[628736.44;483715.14;5093657.19;825523.25;31334.14];

x=A1\B;

I got the result:
x=

1.0e+005 *

1.4346
2.0960
3.8936
-2.5871
1.4502

I want all value of x>0 though. Do you know how to solve this?
Thank you in advance
From: John D'Errico on 7 Feb 2010 23:29
"Antoine Khuu" <antoinekhuu(a)yahoo.com> wrote in message <hknv6j$pgq$1(a)fred.mathworks.com>...
> I did with matrix left division as follows:
> A1=[1 1 1 1 1 ;1 1 1 1 0;10 6 8 5 4;0 2 2 2 1;0 0 0 1 2];
> B=[628736.44;483715.14;5093657.19;825523.25;31334.14];
>
> x=A1\B;
>
> I got the result:
> x=
>
> 1.0e+005 *
>
> 1.4346
> 2.0960
> 3.8936
> -2.5871
> 1.4502
>
> I want all value of x>0 though. Do you know how to solve this?
> Thank you in advance

If your matrix is square and non-singular, then
this solution is unique. There is NO exact alternative
solution, that lives strictly within the bounds you
provide.

Merely wanting a different solution is not sufficient.

If you are willing to accept a non-exact solution,
then you can use lsqlin, from the optimization
toolbox.

John
 | 
Pages: 1
Prev: What is net.hint?
Next: OFDMA and SC-FDMA simulink