np-hard and GAMS

GAMS
1

Hi

I have a question about np-hard.

How can I recognize my problem that is running in GAMS is np-hard?

Thanks

–
To unsubscribe from this group and stop receiving emails from it, send an email to gamsworld+unsubscribe@googlegroups.com.
To post to this group, send email to gamsworld@googlegroups.com.
Visit this group at http://groups.google.com/group/gamsworld.
For more options, visit https://groups.google.com/d/optout.

2

Fatema,

GAMS is not the way you want to use to see if your problem is NP-Hard or not. NP-Hard is a matter of complexity. You have to go to literature, if you cannot prove it directly, to see if reduced version of your problem is NP-Hard or not, then your problem is so.

Best,

On Sun, Dec 21, 2014 at 12:18 PM, fatema saeedi wrote:

Hi

I have a question about np-hard.

How can I recognize my problem that is running in GAMS is np-hard?

Thanks

–
To unsubscribe from this group and stop receiving emails from it, send an email to gamsworld+unsubscribe@googlegroups.com.
To post to this group, send email to gamsworld@googlegroups.com.
Visit this group at http://groups.google.com/group/gamsworld.
For more options, visit https://groups.google.com/d/optout.



\

Babak Saleck Pay
Ph.D Student of Systems Modeling and Analysis
Department of Statistical Sciences and Operations Research
Virginia Commonwealth University
4156 Grace Harris Hall
1015 Floyd Ave.
Richmond, VA

\

To unsubscribe from this group and stop receiving emails from it, send an email to gamsworld+unsubscribe@googlegroups.com.
To post to this group, send email to gamsworld@googlegroups.com.
Visit this group at http://groups.google.com/group/gamsworld.
For more options, visit https://groups.google.com/d/optout.