<div dir="ltr">I think hat if you describe the structure of your problem in more details, peoples may give you better solutions. in general there might be several strategies, formulation depend on structure of problem, number of variables (constraints) and behavior of problem in practice.<div>
<br></div><div>e.g., did you tried your problem without constraints like x!=0, and if the see if any variable violate your constraints, and if doing a little shift in variable and see the objective function value ...<br>
<br>
<div class="gmail_quote">On Thu, Nov 11, 2010 at 10:35 AM, Lewis I <span dir="ltr"><<a href="mailto:lewis369lewis@yahoo.com">lewis369lewis@yahoo.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div><div></div><div class="h5">Hi<br>
<br>
But how about if I have more than one non-zero constraints (a!=0,b!=0, c!=0,.....)?<br>
Thank you.<br>
<br>
Lewis<br>
<br>
--- On Thu, 11/11/10, R Tavakoli <<a href="mailto:rohtav@gmail.com">rohtav@gmail.com</a>> wrote:<br>
<br>
From: R Tavakoli <<a href="mailto:rohtav@gmail.com">rohtav@gmail.com</a>><br>
Subject: Re: [Ipopt] How to define a non-zero constraint?<br>
To: "Lewis I" <<a href="mailto:lewis369lewis@yahoo.com">lewis369lewis@yahoo.com</a>><br>
Cc: <a href="mailto:ipopt@list.coin-or.org">ipopt@list.coin-or.org</a><br>
Date: Thursday, November 11, 2010, 6:29 AM<br>
<br>
as almost the same alternative: (a-b)(a+b)>0 and b>0<br>
a comment: if you have only one constraint like a!=0 there is a more robust strategy: solve two distinct<br>
optimization problems, one with constraint a>0 and one with constraints a<0 (you may replace 0 with a small positive number you want), then the actual solution is the solution to one of these problems with the least objective functional (benefit is the convexity of constraint set in this way).<br>
<br>
<br>
<br>
On Thu, Nov 11, 2010 at 9:33 AM, Lewis I <<a href="mailto:lewis369lewis@yahoo.com">lewis369lewis@yahoo.com</a>> wrote:<br>
<br>
<br>
Hello,<br>
<br>
<br>
<br>
I am try to define a non-zero constraint. i.e. a!=0<br>
<br>
I am trying to use: a*a-0.000001>=0.<br>
<br>
where 0.000001 is the tolerance from zero.<br>
<br>
But I found the outcome was not so good.<br>
<br>
Do anyone has any ideas on modeling a non-zero constraint.<br>
<br>
Thank you so much<br>
<br>
<br>
<br>
Regards,<br>
<br>
Lewis<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
_______________________________________________<br>
<br>
Ipopt mailing list<br>
<br>
<a href="mailto:Ipopt@list.coin-or.org">Ipopt@list.coin-or.org</a><br>
<br>
<a href="http://list.coin-or.org/mailman/listinfo/ipopt" target="_blank">http://list.coin-or.org/mailman/listinfo/ipopt</a><br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
_______________________________________________<br>
Ipopt mailing list<br>
<a href="mailto:Ipopt@list.coin-or.org">Ipopt@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/ipopt" target="_blank">http://list.coin-or.org/mailman/listinfo/ipopt</a><br>
</div></div></blockquote></div><br></div></div>