<div dir="ltr">I can't use a webservice to solve the problem. I have to provide a standalone.<br><br>Thanks<br></div><div class="gmail_extra"><br><br><div class="gmail_quote">2013/10/18 Jiadong Wang <span dir="ltr"><<a href="mailto:jiadwang@gmail.com" target="_blank">jiadwang@gmail.com</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">pls try neos<br>
<a href="http://www.neos-server.org/neos/solvers/index.html" target="_blank">http://www.neos-server.org/neos/solvers/index.html</a><br>
<div class="HOEnZb"><div class="h5"><br>
On Fri, Oct 18, 2013 at 7:36 PM, soufiane khiat<br>
<<a href="mailto:soufiane.khiat@gmail.com">soufiane.khiat@gmail.com</a>> wrote:<br>
> Hi,<br>
><br>
> Yes indeed Bonmin look like what I need. But on windows it's a nightmare to<br>
> build. And binary distribution do not provide any release for Visual Studio<br>
> x64.<br>
><br>
> Other project like:<br>
> - LaGO<br>
> - Couenne<br>
> - NLPAPI<br>
> ...<br>
><br>
> Could provide a function to solve my MIQP ?<br>
><br>
> Thanks for you help<br>
><br>
> Soufiane<br>
><br>
><br>
><br>
> 2013/10/17 Stefan Vigerske <<a href="mailto:stefan@math.hu-berlin.de">stefan@math.hu-berlin.de</a>><br>
>><br>
>> Hi,<br>
>><br>
>> you asked for an alternative interfaces to do MIQP with Cbc, not whether<br>
>> Cbc can solve your problem.<br>
>> I never tried solving (convex) MIQPs with Cbc. Within COIN-OR, I would<br>
>> probably go with Bonmin.<br>
>><br>
>> Stefan<br>
>><br>
>><br>
>> On 10/17/2013 07:46 PM, soufiane khiat wrote:<br>
>>><br>
>>> 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">mike.steglich@berlin.de</a>><br>
>>><br>
>>>> 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>
>>>>> 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>
>>>>>><br>
>>>>>> 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>
>>>><br>
>>>> only<br>
>>>>>><br>
>>>>>> a data.<br>
>>>>>> A is a Matrix NxM, x and b is a vector. So I would like to find best<br>
>>>>>> as<br>
>>>>>> possible x to satisfact this constraints.<br>
>>>>>><br>
>>>>>> My question is, how can I fill a CbcModel to describ this problem<br>
>>>><br>
>>>> without<br>
>>>>>><br>
>>>>>> *.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>
>>>>>> _______________________________________________<br>
>>>>>> Cbc mailing list<br>
>>>>>> <a href="mailto:Cbc@list.coin-or.org">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>
>>>>><br>
>>>>> _______________________________________________<br>
>>>>> Cbc mailing list<br>
>>>>> <a href="mailto:Cbc@list.coin-or.org">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>
>>>><br>
>>>><br>
>>><br>
>><br>
><br>
><br>
> _______________________________________________<br>
> Cbc mailing list<br>
> <a href="mailto:Cbc@list.coin-or.org">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>
<br>
<br>
<br>
</div></div><span class="HOEnZb"><font color="#888888">--<br>
Jiadong Wang<br>
Harold S. Mohler Laboratory<br>
Lehigh University<br>
200 West Packer Avenue<br>
Bethlehem, PA 18015-1582<br>
Phone No: <a href="tel:484-707-8895" value="+14847078895">484-707-8895</a><br>
<a href="http://coral.ie.lehigh.edu/~jiadongwang" target="_blank">coral.ie.lehigh.edu/~jiadongwang</a><br>
</font></span></blockquote></div><br></div>