[Cmpl] Predicting end time

[Indrajit Sen Gupta]

Thanks a lot Mike. I will try out this beta version and will let you know
if I have any questions.

Regards,
Indrajit

On Tue, Dec 9, 2014 at 3:59 PM, Mike Steglich <mike.steglich at th-wildau.de>
wrote:

> Hi Indrajit,
>
> We found a bug that only occurs for a huge amount of products of
> variables. This bug will be fixed in Cmpl v.1.10.1 that we will release at
> the end of the year.
>
> You can use in the meantime a beta version for Windows that you can
> download under the following link:
>
> https://www.dropbox.com/s/ofrow6q0hdqf2fq/Cmpl-1-10-1-beta1.zip?dl=0
>
> It seems that this bug fix is resolving the problems with your model. That
> means the model doesn’t crash. But we are not able to test your model
> completely because you try to execute 6.7e12 iterations in the objective
> function!!
>
> I strongly recommend to find a better formulation for your model. the
> first approach is the following:
>
> Please use:
>
> revenue: sum{i in depts, j in locs:c[i,j] * x[i,j] } +
> sum{ m in depts, n in loc1, o in depts, p in loc2, u in level:   x[m, n]
> * x[o, p] * adj[u, n, p] * rev[u, m, o]  }  -> max;
>
> instead the original objective function:
>
> revenue: sum{i in depts, j in locs, m in depts, o in depts, n in loc1, p
> in loc2, u in level: c[i,j] * x[i,j] + x[m, n] * x[o, p] * adj[u, n, p] *
> rev[u, m, o]}  -> max;
>
> But also this objective function is not ideal because the amount of
> iteration is quit high.
>
> Cheers,
>
> Mike
>
>
>
> Am 03.12.2014 um 18:45 schrieb Indrajit Sen Gupta <indrajitsg at gmail.com>:
>
> Mike,
>
> In Windows also, I am seeing CMPL crash. I am using Windows 7 64bit
> edition. When it crashes, a dialogue box appears saying cmpl.exe has
> stopped working. In view problem details, I see this:
>
> Problem signature:
>   Problem Event Name: APPCRASH
>   Application Name: cmpl.exe
>   Application Version: 0.0.0.0
>   Application Timestamp: 53aaecc8
>   Fault Module Name: cmpl.exe
>   Fault Module Version: 0.0.0.0
>   Fault Module Timestamp: 53aaecc8
>   Exception Code: c0000005
>   Exception Offset: 0001a9d0
>   OS Version: 6.1.7601.2.1.0.256.4
>   Locale ID: 1033
>   Additional Information 1: 0a9e
>   Additional Information 2: 0a9e372d3b4ad19135b953a78882e789
>   Additional Information 3: 0a9e
>   Additional Information 4: 0a9e372d3b4ad19135b953a78882e789
>
> Let me know if you need any more information.
>
> Regards,
> Indrajit
>
> On Wed, Dec 3, 2014 at 9:35 PM, Mike Steglich <mike.steglich at th-wildau.de>
> wrote:
>
>> Hi Indrajit,
>>
>> Thank you for reporting this bug. We will debug it it in the next couple
>> of days.
>>
>> In the meantime please use Cmpl for Mac or Windows. Your problem is
>> running on both systems and it requires apr. 1 GB RAM.
>>
>> Cheers,
>>
>> Mike
>>
>> Am 03.12.2014 um 13:47 schrieb Indrajit Sen Gupta <indrajitsg at gmail.com>:
>>
>> Hi Mike,
>>
>> Thanks for the input. I realized that non linearity is what is causing
>> all that problem. We are trying to get access to CPLEX from our client
>> side, but there are some IT related issues which is causing the delay. I
>> installed the 64 bit CMPL on a Linux server and tried to run it on the full
>> problem (56 x 56 decision variables) and here is the output that I get:
>>
>> CMPL model generation - running
>> CMPL version: 1.10.0
>> Authors: Thomas Schleiff, Mike Steglich
>> Distributed under the GPLv3
>> create model instance ...
>> cmpl: malloc.c:2842: mremap_chunk: Assertion `((size + offset) &
>> (_rtld_global_ro._dl_pagesize - 1)) == 0' failed.
>> /usr/bin/cmpl: line 115: 19491 Aborted                 (core dumped)
>> $dirname/bin/$appname "$cmplFile" "${cArg[1]}" "${cArg[2]}" "${cArg[3]}"
>> "${cArg[4]}" "${cArg[5]}" "${cArg[6]}" "${cArg[7]}" "${cArg[8]}"
>> "${cArg[9]}" "${cArg[10]}" "${cArg[11]}" "${cArg[12]}" "${cArg[13]}"
>> "${cArg[14]}" "${cArg[15]}" "${cArg[16]}" "${cArg[17]}" "${cArg[18]}"
>> "${cArg[19]}" "${cArg[20]}"
>> Is this a limitation of the architecture?
>>
>> Regards,
>> Indrajit
>>
>>
>> On Wed, Dec 3, 2014 at 3:26 PM, Mike Steglich <mike.steglich at th-wildau.de
>> > wrote:
>>
>>> Hi Indrajit,
>>>
>>> First of all ... I would like to suggest to use a cmplData file instead
>>> a Cmpl file to read your data in your Cmpl model. CmplData is the official
>>> data file format for CMPL. Please take a look at the attached files that I
>>> have created for your problem.
>>>
>>>
>>>
>>>
>>> The cause of the huge effort to solve your problem are the products of
>>> the variables in your objective function:
>>>
>>>
>>>
>>>
>>> *revenue: sum{i in depts, j in locs, m in depts, o in depts, n in loc1,
>>> p in loc2, u in level:  c[i,j] * x[i,j] +  x[m, n] * x[o, p] * adj[u, n, p]
>>> * rev[u, m, o] }  -> max;*
>>>
>>> This is a non-linear term. Cmpl reformulates such products of binary
>>> variables equivalently by a set of in-equations. Please take a look at the
>>> pages 46ff in the manual. The size of the model after the reformulations
>>> isn't very huge but the structure is quite complicated for the solver.
>>>
>>> Isn't there a different way to formulate your model and to avoid
>>> products of variables. It seems that it is a multistage transportation
>>> model, for that it could be possible to find alternative formulations.
>>>
>>> If you can't reformulate it then I would like to propose to use Cplex or
>>> Gurobi. You can obtain a free version via the IBM academic initiative or
>>> via the Gurobi web page.
>>>
>>> https://www.ibm.com/developerworks/community/blogs/jfp/entry/cplex_studio_in_ibm_academic_initiative?lang=en
>>> http://www.gurobi.com/products/licensing-and-pricing/academic-licensing
>>>
>>> For both solvers Cmpl's solutionPool feature can be used that can be
>>> combined with a mip gap to decrease the computation times.
>>> You can use the following Cmpl header entries for Cplex:
>>> *%arg -solver cplex*
>>> *%opt cplex mip/tolerances/mipgap 0.10*
>>> *%display solutionPool*
>>>
>>>
>>> Cheers,
>>>
>>> Mike
>>>
>>>
>>>
>>>
>>>
>>>
>>> Am 03.12.2014 um 03:00 schrieb Indrajit Sen Gupta <indrajitsg at gmail.com
>>> >:
>>>
>>> The optimizer finally completed after about 5.3 hours. Attached are the
>>> files. It is a store space optimization problem which I am trying to solve.
>>> As a proof of concept, this data has been reduced to 1/5 th of the actual
>>> problem.
>>>
>>> Is there way to reduce the time it takes or generate intermediate
>>> outputs so that we don't have to wait till it completes?
>>>
>>> Regards,
>>> Indrajit
>>>
>>>
>>> On Wed, Dec 3, 2014 at 2:34 AM, Mike Steglich <
>>> mike.steglich at th-wildau.de> wrote:
>>>
>>>> Hi Indrajit,
>>>>
>>>> Can you send the model for a better understanding?
>>>>
>>>> Thanks,
>>>>
>>>> Mike
>>>>
>>>>
>>>>
>>>> Am 02.12.2014 um 17:38 schrieb Indrajit Sen Gupta <indrajitsg at gmail.com
>>>> >:
>>>>
>>>> Hi Mike,
>>>>
>>>> I am running CMPL on a small version of very big problem I need to
>>>> solve. The current problem has 100 binary variables and about 20
>>>> constraints. The objective function is a bit non linear as it has a term
>>>> x[i,j] * x[k, m]. The program has been running for about 3 hours now and
>>>> the output is showing:
>>>>
>>>> After 20300 nodes, 5239 on tree, -51762900 best solution, best possible
>>>> -62975151 (10407.49 seconds)
>>>>
>>>> Any idea how much time it will take to complete? I understand, with
>>>> binary variables it is difficult to predict, but supposing I were to stop
>>>> in mid way, is there any way to get the current best solution?
>>>>
>>>> Regrads,
>>>> Indrajit
>>>>
>>>> _______________________________________________
>>>> Cmpl mailing list
>>>> Cmpl at list.coin-or.org
>>>> http://list.coin-or.org/mailman/listinfo/cmpl
>>>>
>>>>
>>> <prob008.cmpl><prob008data.cmpl>
>>>
>>>
>>>
>>>
>>> _______________________________________________
>>> Cmpl mailing list
>>> Cmpl at list.coin-or.org
>>> http://list.coin-or.org/mailman/listinfo/cmpl
>>>
>>
>> _______________________________________________
>> Cmpl mailing list
>> Cmpl at list.coin-or.org
>> http://list.coin-or.org/mailman/listinfo/cmpl
>>
>>
>>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/cmpl/attachments/20141209/0b260052/attachment.html>