[Ipopt] Do there exist some optimization problems which are impossible to solve?

[Lewis I]

Hi ,

Thank you for you reply.
According to my understanding from your reply, do you means that if we ignore the length of processing time, the nowadays optimization techiques should be able to solve all reasonable problem?


Lewis



----- Original Message ----
From: Nguyen Binh <nguyeb2 at cs.rpi.edu>
To: Lewis I <lewis369lewis at yahoo.com>
Cc: ipopt at list.coin-or.org
Sent: Fri, February 26, 2010 4:37:54 AM
Subject: Re: [Ipopt] Do there exist some optimization problems which are  impossible to solve?

Many non-convex optimization problems are impossible to solve in
affordable time,space and power. In fact, if you can solve ALL
optimization problems then there is no need for any more researches.

--------------------------------------------------
Binh Nguyen
Computer Science Department
Rensselaer Polytechnic Institute
Troy, NY, 12180
--------------------------------------------------



On Thu, Feb 25, 2010 at 1:29 PM, Lewis I <lewis369lewis at yahoo.com> wrote:
> Dear All,
>
> I have tried to use ipopt to solve some problems for a long time, but it always failed when I increase the number of constraints.
> I know it may be my own implementation problem, but I just wondering that do there exist some optimization problems which are impossible to solve in nowadays optimization technology?
> And these problems obj function and constraints are reasonable in reality.
> Please tell me if you know the answers.
> If yes, I will try to avoid those things.
> I would very appreciate if someone can help me.
> Thank you for your kind attention.
>
> Regards,
> Lewis
>
>
>
>
> _______________________________________________
> Ipopt mailing list
> Ipopt at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/ipopt
>