tag:blogger.com,1999:blog-593563533834706486.post8241796650181613220..comments2024-03-28T10:35:10.453-04:00Comments on Yet Another Math Programming Consultant: Generating all non-dominated solutions in a multi-objective integer programming model (II)Erwin Kalvelagenhttp://www.blogger.com/profile/09496091402502236997noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-593563533834706486.post-66214464524471633622010-05-21T18:19:35.287-04:002010-05-21T18:19:35.287-04:00Well..thanks for the pointer.
BTW: Nice blog. Hel...Well..thanks for the pointer.<br /><br />BTW: Nice blog. Help me a lot.<br /><br />BowenAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-593563533834706486.post-31409599844434810872010-05-21T17:06:27.580-04:002010-05-21T17:06:27.580-04:00The best place to get free GAMS support is support...The best place to get free GAMS support is support@gams.com.Erwin Kalvelagenhttps://www.blogger.com/profile/09496091402502236997noreply@blogger.comtag:blogger.com,1999:blog-593563533834706486.post-12214713674995105122010-05-21T15:23:36.765-04:002010-05-21T15:23:36.765-04:00Hi Erwin,
I have adapted your method of dynamical...Hi Erwin,<br /><br />I have adapted your method of dynamically generating constraints to enumerate all feasible solutions for a single objective MIP problem. But when I use GAMS/CPLEX to solve it, I find the first solution returned by CPLEX is not optimal: it iss dominated by several later solutions. Meanwhile, CPLEX claims having proved the optimality for the solution. I have set optcr and optca to 0. Have you ever encountered similar problems? I can paste the GAMS model here if you think necessary. Thanks.<br /><br />Regards,<br /><br />BowenAnonymousnoreply@blogger.com