Prev: rounding up symbolic expression to 3 decimal places
Next: for cicle with struct field as a counter
From: sweeten singh on 3 Apr 2010 03:36
Can any one tell me how we can decide the upper bounds and lower bounds for an optimization problem having three constraints equations and three variables. eg.



{


x(1)+x(2)+x(3) =>1



3*x(1)+2*x(2)+x(3)<=6



x(3)>x(2) >x(1)


}



Thanks in advance.
From: John D'Errico on 3 Apr 2010 05:38
"sweeten singh" <sweetendil(a)gmail.com> wrote in message <hp6r5j$rop$1(a)fred.mathworks.com>...
> Can any one tell me how we can decide the upper bounds and lower bounds for an optimization problem having three constraints equations and three variables. eg.
>
>
>
> {
>
>
> x(1)+x(2)+x(3) =>1
>
>
>
> 3*x(1)+2*x(2)+x(3)<=6
>
>
>
> x(3)>x(2) >x(1)
>
>
> }
>
>
>
> Thanks in advance.

How can we help YOU "decide " on bounds? The crystal
ball is cloudy today.

These are inequality constraints. They tell you NOTHING
about bounds.

And by the way, there are FOUR constraints here. (Count
the number of comparisons that you make here. Just
because you choose to write them compactly matters
not.)

John
 | 
Pages: 1
Prev: rounding up symbolic expression to 3 decimal places
Next: for cicle with struct field as a counter