<div dir="ltr"><div><div><div><div><div><div><div>I can't use Intel Compiler for many reason (one of them is a non-optimal code for AMD <a href="http://en.wikipedia.org/wiki/Intel_C++_Compiler#Criticism">http://en.wikipedia.org/wiki/Intel_C++_Compiler#Criticism</a>).<br>
</div>So I am constraint to use Visual Studio 2012 (v11), is not a problem for major part Coin-OR project's. I can automatically update to v11 from MSVisualStudio/v10 folder provided by projects.<br></div>I don't need specially a binary (dll or/and lib) I prefer to build it my self with my own options, but many dependencies are not explicited, I know on linux it is very easy to compile anythink (sudo apt-get ...package...) I can get directly the correct package with dependencies after make + install all my dependencies are installed, but is not a case for major part of the people on Windows Environnement.<br>
</div>I can't use a webservice I have to provide a standalone for users.<br></div>I try to build all dependencies, but all are not specified, for exemple Bonmin need IpOpt and IpOpt need mpi etc...<br></div>I saw some project delivered with Visual Studio and Full-Third Party include on one archive, I think this initiative could be generalized.<br>
<br></div>Thanks for you time and your help<br><br></div>Cheers,<br><br>Soufiane<br><div><div><div><div><div><div><br></div></div></div></div></div></div></div><div class="gmail_extra"><br><br><div class="gmail_quote">2013/10/19 Ted Ralphs <span dir="ltr"><<a href="mailto:ted@lehigh.edu" target="_blank">ted@lehigh.edu</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr"><div>Bonmin can be built fairly easily on x64 if you have access to an Intel 64-bit compiler. Is there a reason you specifically need 64-bit binaries? I will shortly release an installer for 32-bit Windows versions of the COIN solvers built with the 32-bit Intel Fortran compiler and the 32-bit version of Visual Studio. If you need 64-bit, there will also be a 64-bit version built with MinGW. The binary of Bonmin can only be used through AMPL, however. You might take a look at the Optimization Services project (<a href="https://projects.coin-or.org/OS" target="_blank">https://projects.coin-or.org/OS</a>), which provides alternative interfaces to Bonmin and many of the other COIN solvers.<br>
<br></div>Cheers,<br><br>Ted<br></div><div class="gmail_extra"><br><br><div class="gmail_quote"><div class="im">On Fri, Oct 18, 2013 at 7:36 PM, soufiane khiat <span dir="ltr"><<a href="mailto:soufiane.khiat@gmail.com" target="_blank">soufiane.khiat@gmail.com</a>></span> wrote:<br>
</div><div><div class="h5"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr"><div><div><div><div><div><div><div>Hi,<br><br></div>Yes indeed Bonmin look like what I need. But on windows it's a nightmare to build. And binary distribution do not provide any release for Visual Studio x64.<br>
<br></div>Other project like:<br></div>- LaGO<br></div>- Couenne<br></div>- NLPAPI<br>...<br><br></div>Could provide a function to solve my MIQP ?<br><br></div>Thanks for you help<span><font color="#888888"><br>
<br>Soufiane<br><div><div><div><div><div>
<div><br></div></div></div></div></div></div></font></span></div><div><div><div class="gmail_extra"><br><br><div class="gmail_quote">2013/10/17 Stefan Vigerske <span dir="ltr"><<a href="mailto:stefan@math.hu-berlin.de" target="_blank">stefan@math.hu-berlin.de</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hi,<br>
<br>
you asked for an alternative interfaces to do MIQP with Cbc, not whether Cbc can solve your problem.<br>
I never tried solving (convex) MIQPs with Cbc. Within COIN-OR, I would probably go with Bonmin.<span><font color="#888888"><br>
<br>
Stefan</font></span><div><div><br>
<br>
On 10/17/2013 07:46 PM, soufiane khiat wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Cbc do not allow us to solve this kind of problem?<br>
Or any package on Coin-OR?<br>
<br>
Thanks<br>
<br>
Soufiane<br>
<br>
<br>
2013/10/17 Mike Steglich <<a href="mailto:mike.steglich@berlin.de" target="_blank">mike.steglich@berlin.de</a>><br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
An additional alternative for an open source MPL is CMPL (<a href="http://coliop.org" target="_blank">coliop.org</a>).<br>
<br>
Mike<br>
<br>
Am 17.10.2013 um 16:26 schrieb Stefan Vigerske:<br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hi,<br>
<br>
you might want to look into algebraic modeling languages then, e.g.,<br>
Pyomo, ZIMPL for open source, and<br>
AIMMS, AMPL, GAMS for commercial.<br>
<br>
Stefan<br>
<br>
<br>
On 10/16/2013 08:18 PM, soufiane khiat wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hello,<br>
<br>
I'm new on Optimization topic. I try to minimize:<br>
||Ax-b||_2<br>
Subject to a list of constraint {B_i, L_ij, E_ij}:<br>
B_i (each x_i could have a: no bound, min bound, max bound or both):<br>
min_i<=x_i<=max_i<br>
<br>
L_ij (with i != j, (i,j) On [1..N]):<br>
x_i + x_j = u_ij With u_ij = {0 OR 1}<br>
<br>
E_ij (with i != j, (i,j) On [1..N]):<br>
u_i >= x_i<br>
u_j >= x_j<br>
u_i + u_j <= 1 With (u_i, u_j) is Binary variable like u_ij on L_ij.<br>
<br>
I have no control on size of data, number of B_i, L_ij and E_ij it is<br>
</blockquote></blockquote>
only<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
a data.<br>
A is a Matrix NxM, x and b is a vector. So I would like to find best as<br>
possible x to satisfact this constraints.<br>
<br>
My question is, how can I fill a CbcModel to describ this problem<br>
</blockquote></blockquote>
without<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
*.mps file?<br>
It is possible to only provide a Matrix A and b?<br>
<br>
Thanks for you answers.<br>
<br>
Soufiane KHIAT<br>
Software Engineer<br>
<br>
<br>
<br>
______________________________<u></u>_________________<br>
Cbc mailing list<br>
<a href="mailto:Cbc@list.coin-or.org" target="_blank">Cbc@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/cbc" target="_blank">http://list.coin-or.org/<u></u>mailman/listinfo/cbc</a><br>
<br>
</blockquote>
<br>
______________________________<u></u>_________________<br>
Cbc mailing list<br>
<a href="mailto:Cbc@list.coin-or.org" target="_blank">Cbc@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/cbc" target="_blank">http://list.coin-or.org/<u></u>mailman/listinfo/cbc</a><br>
</blockquote>
<br>
<br>
</blockquote>
<br>
</blockquote>
<br>
</div></div></blockquote></div><br></div>
</div></div><br>_______________________________________________<br>
Cbc mailing list<br>
<a href="mailto:Cbc@list.coin-or.org" target="_blank">Cbc@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/cbc" target="_blank">http://list.coin-or.org/mailman/listinfo/cbc</a><br>
<br></blockquote></div></div></div><span class="HOEnZb"><font color="#888888"><br><br clear="all"><br>-- <br>Dr. Ted Ralphs<br>Associate Professor, Lehigh University<br><a href="tel:%28610%29%20628-1280" value="+16106281280" target="_blank">(610) 628-1280</a><br>
ted 'at' lehigh 'dot' edu<br><a href="http://coral.ie.lehigh.edu/~ted" target="_blank">coral.ie.lehigh.edu/~ted</a><br>
</font></span></div>
</blockquote></div><br></div>