tag:blogger.com,1999:blog-593563533834706486.post2228852218238066001..comments2024-03-28T10:35:10.453-04:00Comments on Yet Another Math Programming Consultant: Solver OptionsErwin Kalvelagenhttp://www.blogger.com/profile/09496091402502236997noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-593563533834706486.post-85022291019595027612011-11-14T01:55:34.176-05:002011-11-14T01:55:34.176-05:00I am afraid I charge for my services.I am afraid I charge for my services.Erwin Kalvelagenhttps://www.blogger.com/profile/09496091402502236997noreply@blogger.comtag:blogger.com,1999:blog-593563533834706486.post-11792468547916044452011-11-12T14:06:16.820-05:002011-11-12T14:06:16.820-05:00hi, im a post graduate student in MSC. i have a qu...hi, im a post graduate student in MSC. i have a question. I have seen an example you made for TSP. I want to create a simple shortest path algorithm. Using Microsoft solver foundation i can see i can use LP to solve it. the only problem i have is that although i managed to make it work by adding edges and nodes with Ids (integers) i can seem to make it work with strings. i cant add string parameters and bid them with my arrays. I want this since i want to know to start and end node of each edge in order to form the constraints.<br />I define 2 sets (edge and node, Domain.Any), parameters dist etc, it binds ok. But for the from and to parameters????<br /><br /> Could you help me???? my mail is lefteris1029@hotmail.comAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-593563533834706486.post-36298037366455527422011-11-10T00:35:19.276-05:002011-11-10T00:35:19.276-05:00Answers: Yes, may be, don't know.
Advice: ask...Answers: Yes, may be, don't know.<br /><br />Advice: ask someone to have a look at your model and the results. You can contact support@gams.com for that.Erwin Kalvelagenhttps://www.blogger.com/profile/09496091402502236997noreply@blogger.comtag:blogger.com,1999:blog-593563533834706486.post-21303256200287659142011-11-09T21:27:27.146-05:002011-11-09T21:27:27.146-05:00Hi Erwin,
I'm an Industrial Engineer student ...Hi Erwin,<br /><br />I'm an Industrial Engineer student from Colombia and I'm trying to do a large scale scheduling for a study case.<br /><br />The situation as follows:<br /><br />There are 1454 jobs on 24 machines, so when I start to "solve" the MIP problem using Cplex, I always got the "out of memory" error.<br /><br />These are the parameters that I'm trying to use:<br /><br />$onecho > cplex.opt<br />heurfreq -1<br />mipinterval 1<br />startalg 1<br />subalg 1<br />mipemphasis 4<br />fraccuts -1<br />solvelink 0<br />names no<br />threads 1<br />memoryemphasis 1<br />lpmethod 1<br />decrease reinv<br />nodefileind 3<br />solvefinal 0<br />nodesel 0<br />varsel 3<br />cuts -1<br />barcrossalg -1<br />workmem 1500<br />$offecho<br />jobshop.optfile=1;<br />jobshop.dictfile=0;<br />jobshop.holdfixed=1;<br /><br />Can you give me an advice?, am I doing something wrong?, Is feasible to have any solution?<br /><br />Thx a lot!MiLonoreply@blogger.com