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