<div dir="ltr"><div>Thanks Peter,</div><div> </div><div>I will look in to this and get back to you.</div><div> </div><div>Regards,</div><div>Indrajit</div><div> </div></div><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Mar 9, 2015 at 11:40 PM, Mike Steglich <span dir="ltr"><<a href="mailto:mike.steglich@th-wildau.de" target="_blank">mike.steglich@th-wildau.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Thats correct ... one note from my side ... Cmpl is able to transform products of variables (if at least one variable is integer) equivalently into a set of linear in-equations automatically. There is a subchapter in the manual that describes these functionalities.<br>
<br>
<br>
Cheers,<br>
<br>
Mike<br>
> Am 09.03.2015 um 21:39 schrieb Peter Meldrum <<a href="mailto:peter.meldrum@googlemail.com">peter.meldrum@googlemail.com</a>>:<br>
<div class="HOEnZb"><div class="h5">><br>
> Indrajit:<br>
><br>
> Based on the information provided about the formulation, one simple option<br>
> you could try is substituting with another variable to represent the<br>
> nonlinear term:<br>
><br>
> Z[j,k] = x[j] * x[k]<br>
><br>
> The objective function will become linear in Z[j,k] and x[k]. Writing this<br>
> in longer form for greater clarity:<br>
><br>
> Constant *x[k] - Constant * Z[j,k]<br>
><br>
> Then add simple constraints to enforce the needed relationship between<br>
> Z[j,k] and x[j] and x[k].<br>
><br>
> I will leave this last part for you to do as an exercise. If you're not sure<br>
> about the last part, please ask again.<br>
><br>
> Best regards,<br>
> Peter<br>
><br>
> -----Original Message-----<br>
> From: <a href="mailto:cmpl-bounces@list.coin-or.org">cmpl-bounces@list.coin-or.org</a> [mailto:<a href="mailto:cmpl-bounces@list.coin-or.org">cmpl-bounces@list.coin-or.org</a>]<br>
> On Behalf Of <a href="mailto:cmpl-request@list.coin-or.org">cmpl-request@list.coin-or.org</a><br>
> Sent: 09 March 2015 16:00<br>
> To: <a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a><br>
> Subject: Cmpl Digest, Vol 31, Issue 4<br>
><br>
> Send Cmpl mailing list submissions to<br>
> <a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a><br>
><br>
> To subscribe or unsubscribe via the World Wide Web, visit<br>
> <a href="http://list.coin-or.org/mailman/listinfo/cmpl" target="_blank">http://list.coin-or.org/mailman/listinfo/cmpl</a><br>
> or, via email, send a message with subject or body 'help' to<br>
> <a href="mailto:cmpl-request@list.coin-or.org">cmpl-request@list.coin-or.org</a><br>
><br>
> You can reach the person managing the list at<br>
> <a href="mailto:cmpl-owner@list.coin-or.org">cmpl-owner@list.coin-or.org</a><br>
><br>
> When replying, please edit your Subject line so it is more specific than<br>
> "Re: Contents of Cmpl digest..."<br>
><br>
><br>
> Today's Topics:<br>
><br>
> 1. Linearizing a nonlinear objective function (Indrajit Sen Gupta)<br>
> 2. Benchmark / Statistics (Thorsten)<br>
> 3. [CMPL] Readcsv error (Thorsten)<br>
><br>
><br>
> ----------------------------------------------------------------------<br>
><br>
> Message: 1<br>
> Date: Mon, 9 Mar 2015 12:05:32 +0530<br>
> From: Indrajit Sen Gupta <<a href="mailto:indrajitsg@gmail.com">indrajitsg@gmail.com</a>><br>
> To: "<a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a>" <<a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a>><br>
> Subject: [Cmpl] Linearizing a nonlinear objective function<br>
> Message-ID:<br>
> <<a href="mailto:CAB-BrmcAJ_sttf_-SthBwvuorvnbPht6J_j%2Bpu6RWYAwhaEEMA@mail.gmail.com">CAB-BrmcAJ_sttf_-SthBwvuorvnbPht6J_j+pu6RWYAwhaEEMA@mail.gmail.com</a>><br>
> Content-Type: text/plain; charset="utf-8"<br>
><br>
> Hi All,<br>
><br>
> I had a basic question regarding linearizing non-linear objective functions.<br>
> Currently the software that we have is running into issues as it does not<br>
> support non-linear objective function along with binary decision variables.<br>
><br>
> One part of the objective function looks something like this:<br>
><br>
> constant * (1 - x[j]) * x[k]<br>
><br>
> where x's are binary variables (0/1). Is there a way to linearize the<br>
> objective function in such situations?<br>
><br>
> Regards,<br>
> Indrajit<br>
> -------------- next part --------------<br>
> An HTML attachment was scrubbed...<br>
> URL:<br>
> <<a href="http://list.coin-or.org/pipermail/cmpl/attachments/20150309/1bb010b3/attach" target="_blank">http://list.coin-or.org/pipermail/cmpl/attachments/20150309/1bb010b3/attach</a><br>
> ment-0001.html><br>
><br>
> ------------------------------<br>
><br>
> Message: 2<br>
> Date: Mon, 9 Mar 2015 10:07:01 +0100<br>
> From: Thorsten <<a href="mailto:thorten@hotmail.com">thorten@hotmail.com</a>><br>
> To: "<a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a>" <<a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a>><br>
> Subject: [Cmpl] Benchmark / Statistics<br>
> Message-ID: <DUB123-W434C9ABE063C9057693783B11B0@phx.gbl><br>
> Content-Type: text/plain; charset="iso-8859-1"<br>
><br>
><br>
> Hi Mike,<br>
><br>
> thank you very much indeed for the quick reply! I scanned the appendix for<br>
> CBC-Parameters but couldn't find a suitable one which enables me to get the<br>
> required information. Even increasing the log(Level) to maximum doesn't<br>
> provide the neccessary information. Do you possibly have a hint or idea in<br>
> mind for a CBC-Command to get me the programs lower bound and the gap?<br>
> Thanks for your support!<br>
><br>
> Best regards,<br>
> Thorsten<br>
><br>
> Hi Thorsten,<br>
><br>
> You can find these information in the Cbc output. Cmpl does not provide<br>
> functionalities to get it directly within a Cmpl model.<br>
><br>
> Cheers,<br>
><br>
> Mike<br>
><br>
><br>
><br>
>> Am 06.03.2015 um 16:57 schrieb Thorsten <thorten at <a href="http://hotmail.com" target="_blank">hotmail.com</a>>:<br>
>><br>
>> Dear CMPL-Community,<br>
>><br>
>> I have implemented a capacitated vehicle routing problem with time windows<br>
> in CMPL and it runs within coliop. In my thesis I want to compare the<br>
> performance of CMPL and the CBC-solver with the performance of Fico Xpress.<br>
> For the numerical analysis I will need some more statistics than I am able<br>
> to get so far. Besides the objective value and the running time of the model<br>
> I will need the Lower bound of the program and the gap. Can you probably<br>
> help me how I can have these values printed out?<br>
>> Thank you very much in advance,<br>
>> Thorsten<br>
> -------------- next part --------------<br>
> An HTML attachment was scrubbed...<br>
> URL:<br>
> <<a href="http://list.coin-or.org/pipermail/cmpl/attachments/20150309/25390df5/attach" target="_blank">http://list.coin-or.org/pipermail/cmpl/attachments/20150309/25390df5/attach</a><br>
> ment-0001.html><br>
><br>
> ------------------------------<br>
><br>
> Message: 3<br>
> Date: Mon, 9 Mar 2015 10:12:18 +0100<br>
> From: Thorsten <<a href="mailto:thorten@hotmail.com">thorten@hotmail.com</a>><br>
> To: "<a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a>" <<a href="mailto:cmpl@list.coin-or.org">cmpl@list.coin-or.org</a>><br>
> Subject: [Cmpl] [CMPL] Readcsv error<br>
> Message-ID: <DUB123-W19BD131338FFFD8FDBF555B11B0@phx.gbl><br>
> Content-Type: text/plain; charset="iso-8859-1"<br>
><br>
> Hi folks!<br>
><br>
> I am trying to read parameters from a csv-file and have therefore<br>
> implemented the following code:<br>
> serv[]:= readcsv("Dist5C.csv");<br>
><br>
> Unfortunately I get the following error message:<br>
> error (input/output): file Minnertry5C.cmpl line 18: Input file 'Dist5C.csv'<br>
> not found<br>
><br>
> The csv-file is in the same directory as the cmpl-file.<br>
> Does anybody have an idea what the problem could be?<br>
><br>
> Best regards,<br>
> Thorsten<br>
><br>
><br>
> -------------- next part --------------<br>
> An HTML attachment was scrubbed...<br>
> URL:<br>
> <<a href="http://list.coin-or.org/pipermail/cmpl/attachments/20150309/6be7d5d2/attach" target="_blank">http://list.coin-or.org/pipermail/cmpl/attachments/20150309/6be7d5d2/attach</a><br>
> ment-0001.html><br>
><br>
> ------------------------------<br>
><br>
> _______________________________________________<br>
> Cmpl mailing list<br>
> <a href="mailto:Cmpl@list.coin-or.org">Cmpl@list.coin-or.org</a><br>
> <a href="http://list.coin-or.org/mailman/listinfo/cmpl" target="_blank">http://list.coin-or.org/mailman/listinfo/cmpl</a><br>
><br>
> End of Cmpl Digest, Vol 31, Issue 4<br>
> ***********************************<br>
> -----<br>
> No virus found in this message.<br>
> Checked by AVG - <a href="http://www.avg.com" target="_blank">www.avg.com</a><br>
> Version: 2015.0.5646 / Virus Database: 4299/9259 - Release Date: 03/09/15<br>
><br>
> _______________________________________________<br>
> Cmpl mailing list<br>
> <a href="mailto:Cmpl@list.coin-or.org">Cmpl@list.coin-or.org</a><br>
> <a href="http://list.coin-or.org/mailman/listinfo/cmpl" target="_blank">http://list.coin-or.org/mailman/listinfo/cmpl</a><br>
<br>
<br>
_______________________________________________<br>
Cmpl mailing list<br>
<a href="mailto:Cmpl@list.coin-or.org">Cmpl@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/cmpl" target="_blank">http://list.coin-or.org/mailman/listinfo/cmpl</a><br>
</div></div></blockquote></div><br></div>