RhodeCode

      int main(int argc, char** argv)

      {

        ClpModel clp;

        return 0;

      }'

    AC_LANG_PUSH(C++)

    AC_LINK_IFELSE([$lx_clp_test_prog], [lx_clp_found=yes], [lx_clp_found=no])

    AC_LANG_POP(C++)

    CXXFLAGS="$lx_save_cxxflags"

    LDFLAGS="$lx_save_ldflags"

    LIBS="$lx_save_libs"

    if test x"$lx_clp_found" = x"yes"; then

      AC_DEFINE([LEMON_HAVE_CLP], [1], [Define to 1 if you have CLP.])

      lx_lp_found=yes

      AC_DEFINE([LEMON_HAVE_LP], [1], [Define to 1 if you have any LP solver.])

      AC_MSG_RESULT([yes])

    else

      CLP_CXXFLAGS=""

      CLP_LDFLAGS=""

      CLP_LIBS=""

      AC_MSG_RESULT([no])

    fi

  fi

  CLP_LIBS="$CLP_LDFLAGS $CLP_LIBS"

  AC_SUBST(CLP_CXXFLAGS)

  AC_SUBST(CLP_LIBS)

  AM_CONDITIONAL([HAVE_CLP], [test x"$lx_clp_found" = x"yes"])

  lx_cbc_found=no

  if test x"$lx_clp_found" = x"yes"; then

    if test x"$with_coin" != x"no"; then

      AC_MSG_CHECKING([for CBC])

      if test x"$with_coin_includedir" != x"no"; then

        CBC_CXXFLAGS="-I$with_coin_includedir"

      elif test x"$with_coin" != x"yes"; then

        CBC_CXXFLAGS="-I$with_coin/include"

      fi

      if test x"$with_coin_libdir" != x"no"; then

        CBC_LDFLAGS="-L$with_coin_libdir"

      elif test x"$with_coin" != x"yes"; then

        CBC_LDFLAGS="-L$with_coin/lib"

      fi

      lx_save_cxxflags="$CXXFLAGS"

      lx_save_ldflags="$LDFLAGS"

      lx_save_libs="$LIBS"

      CXXFLAGS="$CBC_CXXFLAGS"

      LDFLAGS="$CBC_LDFLAGS"

      LIBS="$CBC_LIBS"

      lx_cbc_test_prog='

        #include <coin/CbcModel.hpp>

        int main(int argc, char** argv)

        {

          CbcModel cbc;

          return 0;

        }'

      AC_LANG_PUSH(C++)

      AC_LINK_IFELSE([$lx_cbc_test_prog], [lx_cbc_found=yes], [lx_cbc_found=no])

      AC_LANG_POP(C++)

      CXXFLAGS="$lx_save_cxxflags"

      LDFLAGS="$lx_save_ldflags"

      LIBS="$lx_save_libs"

      if test x"$lx_cbc_found" = x"yes"; then

        AC_DEFINE([LEMON_HAVE_CBC], [1], [Define to 1 if you have CBC.])

        lx_lp_found=yes

        AC_DEFINE([LEMON_HAVE_LP], [1], [Define to 1 if you have any LP solver.])

        lx_mip_found=yes

        AC_DEFINE([LEMON_HAVE_MIP], [1], [Define to 1 if you have any MIP solver.])

        AC_MSG_RESULT([yes])

      else

        CBC_CXXFLAGS=""

        CBC_LDFLAGS=""

        CBC_LIBS=""

        AC_MSG_RESULT([no])

      fi

    fi

  fi

  CBC_LIBS="$CBC_LDFLAGS $CBC_LIBS"

  AC_SUBST(CBC_CXXFLAGS)

  AC_SUBST(CBC_LIBS)

  AM_CONDITIONAL([HAVE_CBC], [test x"$lx_cbc_found" = x"yes"])

])

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include "test_tools.h"

#include <lemon/config.h>

#ifdef LEMON_HAVE_CPLEX

#include <lemon/cplex.h>

#endif

#ifdef LEMON_HAVE_GLPK

#include <lemon/glpk.h>

#endif

#ifdef LEMON_HAVE_CBC

#include <lemon/cbc.h>

#endif

using namespace lemon;

void solveAndCheck(MipSolver& mip, MipSolver::ProblemType stat,

                   double exp_opt) {

  using std::string;

  mip.solve();

  //int decimal,sign;

  std::ostringstream buf;

  buf << "Type should be: " << int(stat)<<" and it is "<<int(mip.type());

  //  itoa(stat,buf1, 10);

  check(mip.type()==stat, buf.str());

  if (stat ==  MipSolver::OPTIMAL) {

    std::ostringstream sbuf;

    check(std::abs(mip.solValue()-exp_opt) < 1e-3, sbuf.str());

    //+ecvt(exp_opt,2)

  }

}

void aTest(MipSolver& mip)

{

  //The following example is very simple

  typedef MipSolver::Row Row;

  typedef MipSolver::Col Col;

  Col x1 = mip.addCol();

  Col x2 = mip.addCol();

  //Objective function

  mip.obj(x1);

  mip.max();

  //Unconstrained optimization

  mip.solve();

  //Check it out!

  //Constraints

  mip.addRow(2 * x1 + x2 <= 2);

  Row y2 = mip.addRow(x1 - 2 * x2 <= 0);

  //Nonnegativity of the variable x1

  mip.colLowerBound(x1, 0);

  //Maximization of x1

  //over the triangle with vertices (0,0),(4/5,2/5),(0,2)

  double expected_opt=4.0/5.0;

  solveAndCheck(mip, MipSolver::OPTIMAL, expected_opt);

  //Restrict x2 to integer

  mip.colType(x2,MipSolver::INTEGER);

  expected_opt=1.0/2.0;

  solveAndCheck(mip, MipSolver::OPTIMAL, expected_opt);

  //Restrict both to integer