COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/mip_test.cc @ 2391:14a343be7a5a

Last change on this file since 2391:14a343be7a5a was 2391:14a343be7a5a, checked in by Alpar Juttner, 14 years ago

Happy New Year to all source files!

File size: 2.4 KB
RevLine 
[2391]1/* -*- C++ -*-
2 *
3 * This file is a part of LEMON, a generic C++ optimization library
4 *
5 * Copyright (C) 2003-2007
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
[2149]19#include "test_tools.h"
[2146]20
[2218]21
[2221]22#ifdef HAVE_CONFIG_H
23#include <config.h>
24#endif
25
[2227]26#ifdef HAVE_CPLEX
27#include <lemon/mip_cplex.h>
28#endif
29
30#ifdef HAVE_GLPK
31#include <lemon/mip_glpk.h>
32#endif
[2221]33
[2218]34
[2146]35using namespace lemon;
36
[2218]37void solveAndCheck(MipSolverBase& lp, MipSolverBase::SolutionStatus stat,
[2149]38                   double exp_opt) {
39  using std::string;
[2218]40
[2149]41  lp.solve();
42  //int decimal,sign;
43  std::ostringstream buf;
44  buf << "Primalstatus should be: " << int(stat)<<" and it is "<<int(lp.primalStatus());
[2146]45
[2218]46
[2149]47  //  itoa(stat,buf1, 10);
[2213]48  check(lp.mipStatus()==stat, buf.str());
[2149]49
[2218]50  if (stat ==  MipSolverBase::OPTIMAL) {
[2386]51    std::ostringstream sbuf;
[2149]52    buf << "Wrong optimal value: the right optimum is " << exp_opt;
[2386]53    check(std::abs(lp.primalValue()-exp_opt) < 1e-3, sbuf.str());
[2149]54    //+ecvt(exp_opt,2)
55  }
56}
57
[2218]58void aTest(MipSolverBase& mip)
[2149]59{
60 //The following example is very simple
61
[2218]62
63  typedef MipSolverBase::Row Row;
64  typedef MipSolverBase::Col Col;
65
[2149]66
67
68  Col x1 = mip.addCol();
69  Col x2 = mip.addCol();
70
71
[2213]72  //Objective function
[2369]73  mip.obj(x1);
[2213]74
75  mip.max();
76
77
78  //Unconstrained optimization
79  mip.solve();
80  //Check it out!
81
[2149]82  //Constraints
83  mip.addRow(2*x1+x2 <=2); 
84  mip.addRow(x1-2*x2 <=0); 
85
86  //Nonnegativity of the variable x1
87  mip.colLowerBound(x1, 0);
88
89
90
91  //Maximization of x1
[2221]92  //over the triangle with vertices (0,0),(4/5,2/5),(0,2)
[2149]93  double expected_opt=4.0/5.0;
[2218]94  solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
[2149]95
96  //Restrict x2 to integer
[2267]97  mip.colType(x2,MipSolverBase::INT); 
[2149]98  expected_opt=1.0/2.0;
[2218]99  solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
[2149]100
101
102  //Restrict both to integer
[2267]103  mip.colType(x1,MipSolverBase::INT); 
[2149]104  expected_opt=0;
[2218]105  solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
[2149]106
107 
108
109}
110
111
112int main()
113{
[2146]114
[2147]115#ifdef HAVE_GLPK
[2149]116  MipGlpk mip1;
117  aTest(mip1);
[2147]118#endif
[2146]119
[2218]120#ifdef HAVE_CPLEX
121  MipCplex mip2;
122  aTest(mip2);
123#endif
124
[2147]125  return 0;
[2146]126
127}
Note: See TracBrowser for help on using the repository browser.