test/mip_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Mon, 03 Aug 2009 00:54:04 +0200
changeset 699 75325dfccf38
parent 627 20dac2104519
child 748 4792459983d0
permissions -rw-r--r--
Add negativeCycle() function to BellmanFord (#51)
deba@458
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@458
     2
 *
deba@458
     3
 * This file is a part of LEMON, a generic C++ optimization library.
deba@458
     4
 *
deba@551
     5
 * Copyright (C) 2003-2009
deba@458
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@458
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@458
     8
 *
deba@458
     9
 * Permission to use, modify and distribute this software is granted
deba@458
    10
 * provided that this copyright notice appears in all copies. For
deba@458
    11
 * precise terms see the accompanying LICENSE file.
deba@458
    12
 *
deba@458
    13
 * This software is provided "AS IS" with no warranty of any kind,
deba@458
    14
 * express or implied, and with no claim as to its suitability for any
deba@458
    15
 * purpose.
deba@458
    16
 *
deba@458
    17
 */
deba@458
    18
deba@458
    19
#include "test_tools.h"
deba@458
    20
deba@458
    21
#include <lemon/config.h>
deba@458
    22
ladanyi@627
    23
#ifdef LEMON_HAVE_CPLEX
alpar@461
    24
#include <lemon/cplex.h>
deba@458
    25
#endif
deba@458
    26
ladanyi@627
    27
#ifdef LEMON_HAVE_GLPK
alpar@461
    28
#include <lemon/glpk.h>
deba@458
    29
#endif
deba@458
    30
ladanyi@627
    31
#ifdef LEMON_HAVE_CBC
deba@567
    32
#include <lemon/cbc.h>
deba@567
    33
#endif
deba@567
    34
deba@458
    35
deba@458
    36
using namespace lemon;
deba@458
    37
deba@459
    38
void solveAndCheck(MipSolver& mip, MipSolver::ProblemType stat,
deba@458
    39
                   double exp_opt) {
deba@458
    40
  using std::string;
deba@458
    41
deba@459
    42
  mip.solve();
deba@458
    43
  //int decimal,sign;
deba@458
    44
  std::ostringstream buf;
deba@459
    45
  buf << "Type should be: " << int(stat)<<" and it is "<<int(mip.type());
deba@458
    46
deba@458
    47
deba@458
    48
  //  itoa(stat,buf1, 10);
deba@459
    49
  check(mip.type()==stat, buf.str());
deba@458
    50
deba@459
    51
  if (stat ==  MipSolver::OPTIMAL) {
deba@458
    52
    std::ostringstream sbuf;
deba@458
    53
    buf << "Wrong optimal value: the right optimum is " << exp_opt;
deba@459
    54
    check(std::abs(mip.solValue()-exp_opt) < 1e-3, sbuf.str());
deba@458
    55
    //+ecvt(exp_opt,2)
deba@458
    56
  }
deba@458
    57
}
deba@458
    58
deba@459
    59
void aTest(MipSolver& mip)
deba@458
    60
{
deba@567
    61
  //The following example is very simple
deba@458
    62
deba@458
    63
deba@459
    64
  typedef MipSolver::Row Row;
deba@459
    65
  typedef MipSolver::Col Col;
deba@458
    66
deba@458
    67
deba@458
    68
  Col x1 = mip.addCol();
deba@458
    69
  Col x2 = mip.addCol();
deba@458
    70
deba@458
    71
deba@458
    72
  //Objective function
deba@458
    73
  mip.obj(x1);
deba@458
    74
deba@458
    75
  mip.max();
deba@458
    76
deba@458
    77
  //Unconstrained optimization
deba@458
    78
  mip.solve();
deba@458
    79
  //Check it out!
deba@458
    80
deba@458
    81
  //Constraints
deba@567
    82
  mip.addRow(2 * x1 + x2 <= 2);
deba@567
    83
  Row y2 = mip.addRow(x1 - 2 * x2 <= 0);
deba@458
    84
deba@458
    85
  //Nonnegativity of the variable x1
deba@458
    86
  mip.colLowerBound(x1, 0);
deba@458
    87
deba@567
    88
deba@458
    89
  //Maximization of x1
deba@458
    90
  //over the triangle with vertices (0,0),(4/5,2/5),(0,2)
deba@458
    91
  double expected_opt=4.0/5.0;
deba@459
    92
  solveAndCheck(mip, MipSolver::OPTIMAL, expected_opt);
deba@458
    93
deba@567
    94
deba@458
    95
  //Restrict x2 to integer
deba@459
    96
  mip.colType(x2,MipSolver::INTEGER);
deba@458
    97
  expected_opt=1.0/2.0;
deba@459
    98
  solveAndCheck(mip, MipSolver::OPTIMAL, expected_opt);
deba@458
    99
deba@458
   100
deba@458
   101
  //Restrict both to integer
deba@459
   102
  mip.colType(x1,MipSolver::INTEGER);
deba@458
   103
  expected_opt=0;
deba@459
   104
  solveAndCheck(mip, MipSolver::OPTIMAL, expected_opt);
deba@458
   105
deba@567
   106
  //Erase a variable
deba@567
   107
  mip.erase(x2);
deba@567
   108
  mip.rowUpperBound(y2, 8);
deba@567
   109
  expected_opt=1;
deba@567
   110
  solveAndCheck(mip, MipSolver::OPTIMAL, expected_opt);
deba@458
   111
deba@458
   112
}
deba@458
   113
deba@567
   114
alpar@540
   115
template<class MIP>
alpar@540
   116
void cloneTest()
alpar@540
   117
{
deba@551
   118
alpar@540
   119
  MIP* mip = new MIP();
alpar@540
   120
  MIP* mipnew = mip->newSolver();
alpar@540
   121
  MIP* mipclone = mip->cloneSolver();
alpar@540
   122
  delete mip;
alpar@540
   123
  delete mipnew;
alpar@540
   124
  delete mipclone;
alpar@540
   125
}
deba@458
   126
deba@458
   127
int main()
deba@458
   128
{
deba@458
   129
ladanyi@627
   130
#ifdef LEMON_HAVE_GLPK
deba@459
   131
  {
alpar@462
   132
    GlpkMip mip1;
deba@459
   133
    aTest(mip1);
alpar@540
   134
    cloneTest<GlpkMip>();
deba@459
   135
  }
deba@458
   136
#endif
deba@458
   137
ladanyi@627
   138
#ifdef LEMON_HAVE_CPLEX
deba@459
   139
  try {
alpar@462
   140
    CplexMip mip2;
deba@459
   141
    aTest(mip2);
deba@551
   142
    cloneTest<CplexMip>();
deba@459
   143
  } catch (CplexEnv::LicenseError& error) {
deba@459
   144
    check(false, error.what());
deba@459
   145
  }
deba@458
   146
#endif
deba@458
   147
ladanyi@627
   148
#ifdef LEMON_HAVE_CBC
deba@567
   149
  {
deba@567
   150
    CbcMip mip1;
deba@567
   151
    aTest(mip1);
deba@567
   152
    cloneTest<CbcMip>();
deba@567
   153
  }
deba@567
   154
#endif
deba@567
   155
deba@458
   156
  return 0;
deba@458
   157
deba@458
   158
}