<HTML><HEAD></HEAD>
<BODY dir=ltr>
<DIV dir=ltr>
<DIV style="FONT-SIZE: 12pt; FONT-FAMILY: 'Calibri'; COLOR: #000000">
<DIV>Just for reference sake, the whole COIN-OS stack builds nicely using MSYS
and the TDM-GCC distribution of MinGW64 (<A
href="http://tdm-gcc.tdragon.net/">http://tdm-gcc.tdragon.net/</A>). You will
need to add the configure flag ADD_FFLAGS=-static-libgcc, although that won’t be
necessary any more after <A
title=https://projects.coin-or.org/BuildTools/changeset/3004
href="https://projects.coin-or.org/BuildTools/changeset/3004">https://projects.coin-or.org/BuildTools/changeset/3004</A>
makes its way through testing and into a future release.</DIV>
<DIV> </DIV>
<DIV>If you want to end up with redistributable binaries that are statically
linked to libgfortran, the best way I’ve found for doing that is by calling make
as:</DIV>
<DIV>AM_LDFLAGS=-all-static make all install test</DIV>
<DIV> </DIV>
<DIV>-Tony</DIV>
<DIV> </DIV>
<DIV
style="FONT-SIZE: small; FONT-FAMILY: 'Calibri'; FONT-WEIGHT: normal; COLOR: #000000; FONT-STYLE: normal; TEXT-DECORATION: none; DISPLAY: inline">
<DIV style="FONT: 10pt tahoma">
<DIV> </DIV>
<DIV style="BACKGROUND: #f5f5f5">
<DIV style="font-color: black"><B>From:</B> <A title=soufiane.khiat@gmail.com
href="mailto:soufiane.khiat@gmail.com">soufiane khiat</A> </DIV>
<DIV><B>Sent:</B> Monday, October 21, 2013 12:26 PM</DIV>
<DIV><B>To:</B> <A title=ted@lehigh.edu href="mailto:ted@lehigh.edu">Ted
Ralphs</A> </DIV>
<DIV><B>Cc:</B> <A title=OS@list.coin-or.org
href="mailto:OS@list.coin-or.org">OS@list.coin-or.org</A> ; <A
title=ipopt@list.coin-or.org
href="mailto:ipopt@list.coin-or.org">ipopt@list.coin-or.org</A> ; <A
title=Cbc@list.coin-or.org href="mailto:Cbc@list.coin-or.org">cbc</A> ; <A
title=Bonmin@list.coin-or.org
href="mailto:Bonmin@list.coin-or.org">Bonmin@list.coin-or.org</A> </DIV>
<DIV><B>Subject:</B> Re: [Ipopt] [Cbc] Linear System Constraint Least
Square</DIV></DIV></DIV>
<DIV> </DIV></DIV>
<DIV
style="FONT-SIZE: small; FONT-FAMILY: 'Calibri'; FONT-WEIGHT: normal; COLOR: #000000; FONT-STYLE: normal; TEXT-DECORATION: none; DISPLAY: inline">
<DIV dir=ltr>
<DIV>
<DIV>
<DIV>
<DIV>Thank for you detailled answer and clarification.<BR></DIV>I can't buy a
licence of solver like AMPL (<A
href="http://www.ampl.com/index.html">http://www.ampl.com/index.html</A>), So I
tried OS. MS Binaries, but as expected only x86 are provided and after
linking:<BR>amplsolv.lib(fpinitmt.obj) : fatal error LNK1112: module machine
type 'X86' conflicts with target machine type 'x64'...<BR><BR></DIV>
<DIV>And Intel x64 binary could not be used, due to the MKL dependencies (note:
MKL is not free <A
href="http://software.intel.com/en-us/intel-mkl">http://software.intel.com/en-us/intel-mkl</A>).<BR></DIV>
<DIV> </DIV>So I will try to build x64 version with MinGW (I can't switch
to x86).<BR><BR></DIV>If anyone has a x64 binary without MKL dependence that
would very helpful for Coin-OR
community.<BR><BR></DIV>Cheers<BR><BR>Soufiane<BR></DIV>
<DIV class=gmail_extra><BR><BR>
<DIV class=gmail_quote>2013/10/21 Ted Ralphs <SPAN dir=ltr><<A
href="mailto:ted@lehigh.edu" target=_blank>ted@lehigh.edu</A>></SPAN><BR>
<BLOCKQUOTE class=gmail_quote
style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">
<DIV dir=ltr>
<DIV>
<DIV>Sorry, I guess my answer wasn't too clear on a few points. The bottom
line is that you need a Fortran compiler to build Ipopt. If you want to build
Ipopt with Visual Studio, the only way I have successfully done it is using
the Intel Fortran compiler along with the Visual Studio compiler. There may be
some other ways to do it (you can build MSVC++ compatible libraries with the
MinGW compilers for instance, though I've never done it), but this is by far
the easiest. Actually, the only way to build the whole stack "out of the box"
with the Visual Studio compilers is to use the autotools and the MSys shell,
i.e., not the Visual Studio IDE. Keep in mind, though, that the binaries for
ipopt, Bonmin, Couenne, etc only work through AMPL. <BR><BR></DIV>To clarify
one other point, the OS project is not just for building Web service
applications. It provides libraries and binaries that work in the usual way,
but wrap the other solvers and provide a uniform interface to them, including
an XML-based format for specifying instances. I've cross-posted this to the
more relevant lists in case others want to
comment.<BR><BR></DIV>Cheers,<BR><BR>Ted<BR>
<DIV>
<DIV><BR><BR></DIV></DIV></DIV>
<DIV class=HOEnZb>
<DIV class=h5>
<DIV class=gmail_extra><BR><BR>
<DIV class=gmail_quote>On Mon, Oct 21, 2013 at 9:16 AM, soufiane khiat <SPAN
dir=ltr><<A href="mailto:soufiane.khiat@gmail.com"
target=_blank>soufiane.khiat@gmail.com</A>></SPAN> wrote:<BR>
<BLOCKQUOTE class=gmail_quote
style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">
<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"
target=_blank>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> </DIV></DIV></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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">
<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>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>
<BLOCKQUOTE class=gmail_quote
style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">
<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> </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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">
<BLOCKQUOTE class=gmail_quote
style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">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="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">
<BLOCKQUOTE class=gmail_quote
style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">*.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>
<DIV> </DIV></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><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"
target=_blank value="+16106281280">(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>
<DIV> </DIV></DIV></DIV></DIV></BLOCKQUOTE></DIV><BR><BR clear=all><BR>--
<BR>Dr. Ted Ralphs<BR>Associate Professor, Lehigh University<BR><A
href="tel:%28610%29%20628-1280" target=_blank value="+16106281280">(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></DIV></DIV></DIV></BLOCKQUOTE></DIV>
<DIV> </DIV></DIV>
<P>
<HR>
_______________________________________________<BR>Ipopt mailing
list<BR>Ipopt@list.coin-or.org<BR>http://list.coin-or.org/mailman/listinfo/ipopt<BR></DIV></DIV></DIV></BODY></HTML>