alpar@2391: /* -*- C++ -*-
alpar@2391:  *
alpar@2391:  * This file is a part of LEMON, a generic C++ optimization library
alpar@2391:  *
alpar@2391:  * Copyright (C) 2003-2007
alpar@2391:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@2391:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@2391:  *
alpar@2391:  * Permission to use, modify and distribute this software is granted
alpar@2391:  * provided that this copyright notice appears in all copies. For
alpar@2391:  * precise terms see the accompanying LICENSE file.
alpar@2391:  *
alpar@2391:  * This software is provided "AS IS" with no warranty of any kind,
alpar@2391:  * express or implied, and with no claim as to its suitability for any
alpar@2391:  * purpose.
alpar@2391:  *
alpar@2391:  */
alpar@2391: 
athos@2149: #include "test_tools.h"
athos@2146: 
athos@2218: 
athos@2221: #ifdef HAVE_CONFIG_H
athos@2221: #include <config.h>
athos@2221: #endif
athos@2221: 
deba@2227: #ifdef HAVE_CPLEX
deba@2227: #include <lemon/mip_cplex.h>
deba@2227: #endif
deba@2227: 
deba@2227: #ifdef HAVE_GLPK
deba@2227: #include <lemon/mip_glpk.h>
deba@2227: #endif
athos@2221: 
athos@2218: 
athos@2146: using namespace lemon;
athos@2146: 
athos@2218: void solveAndCheck(MipSolverBase& lp, MipSolverBase::SolutionStatus stat, 
athos@2149: 		   double exp_opt) {
athos@2149:   using std::string;
athos@2218: 
athos@2149:   lp.solve();
athos@2149:   //int decimal,sign;
athos@2149:   std::ostringstream buf;
deba@2441:   buf << "Primalstatus should be: " << int(stat)<<" and it is "<<int(lp.mipStatus());
athos@2146: 
athos@2218: 
athos@2149:   //  itoa(stat,buf1, 10);
athos@2213:   check(lp.mipStatus()==stat, buf.str());
athos@2149: 
athos@2218:   if (stat ==  MipSolverBase::OPTIMAL) {
deba@2386:     std::ostringstream sbuf;
athos@2149:     buf << "Wrong optimal value: the right optimum is " << exp_opt; 
deba@2386:     check(std::abs(lp.primalValue()-exp_opt) < 1e-3, sbuf.str());
athos@2149:     //+ecvt(exp_opt,2)
athos@2149:   }
athos@2149: }
athos@2149: 
athos@2218: void aTest(MipSolverBase& mip)
athos@2149: {
athos@2149:  //The following example is very simple
athos@2149: 
athos@2218: 
athos@2218:   typedef MipSolverBase::Row Row;
athos@2218:   typedef MipSolverBase::Col Col;
athos@2218: 
athos@2149: 
athos@2149: 
athos@2149:   Col x1 = mip.addCol();
athos@2149:   Col x2 = mip.addCol();
athos@2149: 
athos@2149: 
athos@2213:   //Objective function
deba@2369:   mip.obj(x1);
athos@2213: 
athos@2213:   mip.max();
athos@2213: 
athos@2213: 
athos@2213:   //Unconstrained optimization
athos@2213:   mip.solve();
athos@2213:   //Check it out!
athos@2213: 
athos@2149:   //Constraints
athos@2149:   mip.addRow(2*x1+x2 <=2);  
deba@2441:   mip.addRow(x1-2*x2 <=0);
athos@2149: 
athos@2149:   //Nonnegativity of the variable x1
athos@2149:   mip.colLowerBound(x1, 0);
athos@2149: 
athos@2149:   //Maximization of x1
athos@2221:   //over the triangle with vertices (0,0),(4/5,2/5),(0,2)
athos@2149:   double expected_opt=4.0/5.0;
athos@2218:   solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
athos@2149: 
athos@2149:   //Restrict x2 to integer
athos@2267:   mip.colType(x2,MipSolverBase::INT);  
athos@2149:   expected_opt=1.0/2.0;
athos@2218:   solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
athos@2149: 
athos@2149: 
athos@2149:   //Restrict both to integer
athos@2267:   mip.colType(x1,MipSolverBase::INT);  
athos@2149:   expected_opt=0;
athos@2218:   solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
athos@2149: 
athos@2149:  
athos@2149: 
athos@2149: }
athos@2149: 
athos@2149: 
athos@2149: int main() 
athos@2149: {
athos@2146: 
athos@2147: #ifdef HAVE_GLPK
athos@2149:   MipGlpk mip1;
athos@2149:   aTest(mip1);
athos@2147: #endif
athos@2146: 
athos@2218: #ifdef HAVE_CPLEX
athos@2218:   MipCplex mip2;
athos@2218:   aTest(mip2);
athos@2218: #endif
athos@2218: 
athos@2147:   return 0;
athos@2146: 
athos@2146: }