Changeset 2218:50f1a780a5ff in lemon-0.x

Timestamp:

09/21/06 16:46:28 (19 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2952

Message:

Interface to the cplex MIP solver: it is little, a bit sour but it is ours.

Files:

• lemon/Makefile.am (modified) (2 diffs)
• lemon/lp.h (modified) (4 diffs)
• lemon/lp_base.h (modified) (4 diffs)
• lemon/lp_cplex.cc (modified) (4 diffs)
• lemon/lp_cplex.h (modified) (1 diff)
• lemon/mip_glpk.cc (modified) (4 diffs)
• lemon/mip_glpk.h (modified) (3 diffs)
• test/mip_test.cc (modified) (5 diffs)

lemon/Makefile.am

@@ -26 +26 @@
 if HAVE_CPLEX
 lemon_libemon_la_SOURCES += lemon/lp_cplex.cc
+lemon_libemon_la_SOURCES += lemon/mip_cplex.cc
 endif
 
@@ -79 +80 @@
         lemon/min_cut.h \
         lemon/mip_glpk.h \
+        lemon/mip_cplex.h \
         lemon/path.h \
         lemon/polynomial.h \

lemon/lp.h

@@ -22 +22 @@
 #include<lemon/config.h>
 
+
 #ifdef HAVE_GLPK
 #include <lemon/lp_glpk.h>
@@ -27 +28 @@
 #elif HAVE_CPLEX
 #include <lemon/lp_cplex.h>
+#include <lemon/mip_cplex.h>
 #endif
 
@@ -33 +35 @@
 ///\ingroup gen_opt_group
 namespace lemon {
- 
+
 #ifdef DOXYGEN
   ///The default LP solver identifier
@@ -73 +75 @@
 #define DEFAULT_LP CPLEX
   typedef LpCplex Lp;
+  typedef MipCplex Mip;
   const char default_solver_name[]="CPLEX";
 #endif

lemon/lp_base.h

@@ -76 +76 @@
         return cross[n];
       }
-      ///\todo Create an own exception type.
-      else throw LogicError(); //floatingId-s must form a continuous range;
+      else {
+        ///\todo Create an own exception type.
+        throw LogicError(); //floatingId-s must form a continuous range;
+      }
     }
     ///Remove a fix id.
@@ -1170 +1172 @@
       REAL = 0,
       ///Integer variable
-      INTEGER = 1
+
+      ///Unfortunately, cplex 7.5 somewhere writes something like
+      ///#define INTEGER 'I'
+      LEMON_INTEGER = 1
       ///\todo No support for other types yet.
     };
@@ -1193 +1198 @@
     void integer(Col c, bool enable) {
       if (enable)
-        colType(c,INTEGER);
+        colType(c,LEMON_INTEGER);
       else
         colType(c,REAL);
@@ -1203 +1208 @@
     ///\return true if the column has integer type and false if not.
     bool integer(Col c){
-      return (colType(c)==INTEGER);
+      return (colType(c)==LEMON_INTEGER);
     }
 

lemon/lp_cplex.cc

@@ -270 +270 @@
     status = CPXlpopt(env, lp);
     //status = CPXprimopt(env, lp);
-#if CPX_VERSION >= 900
+#if CPX_VERSION >= 800
     if (status)
     {
@@ -417 +417 @@
   LpCplex::SolutionStatus LpCplex::_getPrimalStatus()
   {
+    //Unboundedness not treated well: the following is from cplex 9.0 doc
+    // About Unboundedness
+
+    // The treatment of models that are unbounded involves a few
+    // subtleties. Specifically, a declaration of unboundedness means that
+    // ILOG CPLEX has determined that the model has an unbounded
+    // ray. Given any feasible solution x with objective z, a multiple of
+    // the unbounded ray can be added to x to give a feasible solution
+    // with objective z-1 (or z+1 for maximization models). Thus, if a
+    // feasible solution exists, then the optimal objective is
+    // unbounded. Note that ILOG CPLEX has not necessarily concluded that
+    // a feasible solution exists. Users can call the routine CPXsolninfo
+    // to determine whether ILOG CPLEX has also concluded that the model
+    // has a feasible solution.
+
     int stat = CPXgetstat(env, lp);
-#if CPX_VERSION >= 900
+#if CPX_VERSION >= 800
     switch (stat)
     {
@@ -486 +501 @@
   {
     int stat = CPXgetstat(env, lp);
-#if CPX_VERSION >= 900
+#if CPX_VERSION >= 800
     switch (stat)
     {
@@ -515 +530 @@
   {
     int stat = CPXgetstat(env, lp);
-#if CPX_VERSION >= 900
+#if CPX_VERSION >= 800
     switch (stat)
     {

lemon/lp_cplex.h

@@ -35 +35 @@
   /// 
   /// This class implements an interface for the CPLEX LP solver.
-  class LpCplex : public LpSolverBase {
+  class LpCplex :virtual public LpSolverBase {
 
   public:

lemon/mip_glpk.cc

@@ -17 +17 @@
  */
 
-#ifndef LEMON_ILP_GLPK_CC
-#define LEMON_ILP_GLPK_CC
+#ifndef LEMON_MIP_GLPK_CC
+#define LEMON_MIP_GLPK_CC
 
 ///\file
-///\brief Implementation of the LEMON-GLPK lp solver interface.
+///\brief Implementation of the LEMON-GLPK mip solver interface.
 
 #include <lemon/mip_glpk.h>
@@ -33 +33 @@
   void MipGlpk::_colType(int i, MipGlpk::ColTypes col_type){
     switch (col_type){
-      case INTEGER:
+      case LEMON_INTEGER:
         lpx_set_col_kind(lp,i,LPX_IV);
         break;
@@ -47 +47 @@
     switch (lpx_get_col_kind(lp,i)){
     case LPX_IV:
-      return INTEGER;//Or binary
+      return LEMON_INTEGER;//Or binary
     case LPX_CV:
       return REAL;
@@ -111 +111 @@
     return lpx_mip_obj_val(lp);
   }
-} //END OG NAMESPACE LEMON
+} //END OF NAMESPACE LEMON
 
-#endif
+#endif //END OF MIP_GLPK_CC

lemon/mip_glpk.h

@@ -17 +17 @@
  */
 
-#ifndef LEMON_ILP_GLPK_H
-#define LEMON_ILP_GLPK_H
+#ifndef LEMON_MIP_GLPK_H
+#define LEMON_MIP_GLPK_H
 
 ///\file
-///\brief Header of the LEMON-GLPK lp solver interface.
+///\brief Header of the LEMON-GLPK mip solver interface.
 ///\ingroup gen_opt_group
 
@@ -28 +28 @@
 
 namespace lemon {
-  /// \brief Interface for the GLPK ILP solver
+  /// \brief Interface for the GLPK MIP solver
   /// 
-  /// This class implements an interface for the GLPK ILP solver.
+  /// This class implements an interface for the GLPK MIP solver.
   ///\ingroup gen_opt_group
   class MipGlpk : public MipSolverBase, public LpGlpk{
@@ -57 +57 @@
 } //END OF NAMESPACE LEMON
 
-#endif // END OF LEMON_ILP_GLPK_H
+#endif // END OF LEMON_MIP_GLPK_H

test/mip_test.cc

@@ -1 @@
-#include <lemon/lp.h>
 #include "test_tools.h"
+
+
+#include <lemon/mip_cplex.h>
+#include <lemon/mip_glpk.h>
+#include<lemon/config.h>
 
 using namespace lemon;
 
-void solveAndCheck(Mip& lp, LpSolverBase::SolutionStatus stat, 
+void solveAndCheck(MipSolverBase& lp, MipSolverBase::SolutionStatus stat, 
                    double exp_opt) {
   using std::string;
+
   lp.solve();
   //int decimal,sign;
@@ -12 +17 @@
   buf << "Primalstatus should be: " << int(stat)<<" and it is "<<int(lp.primalStatus());
 
+
   //  itoa(stat,buf1, 10);
   check(lp.mipStatus()==stat, buf.str());
 
-  if (stat ==  LpSolverBase::OPTIMAL) {
+  if (stat ==  MipSolverBase::OPTIMAL) {
     std::ostringstream buf;
     buf << "Wrong optimal value: the right optimum is " << exp_opt; 
@@ -23 +29 @@
 }
 
-void aTest(Mip& mip)
+void aTest(MipSolverBase& mip)
 {
  //The following example is very simple
 
-  typedef Mip::Row Row;
-  typedef Mip::Col Col;
+
+  typedef MipSolverBase::Row Row;
+  typedef MipSolverBase::Col Col;
+
 
 
   Col x1 = mip.addCol();
   Col x2 = mip.addCol();
-
-
-
-
 
 
@@ -61 +65 @@
   //over the triangle with vertices 
   double expected_opt=4.0/5.0;
-  solveAndCheck(mip, Mip::OPTIMAL, expected_opt);
+  solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
 
   //Restrict x2 to integer
-  mip.colType(x2,Mip::INTEGER);  
+  mip.colType(x2,MipSolverBase::LEMON_INTEGER);  
   expected_opt=1.0/2.0;
-  solveAndCheck(mip, Mip::OPTIMAL, expected_opt);
+  solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
 
 
   //Restrict both to integer
-  mip.colType(x1,Mip::INTEGER);  
+  mip.colType(x1,MipSolverBase::LEMON_INTEGER);  
   expected_opt=0;
-  solveAndCheck(mip, Mip::OPTIMAL, expected_opt);
+  solveAndCheck(mip, MipSolverBase::OPTIMAL, expected_opt);
 
  
@@ -87 +91 @@
 #endif
 
+
+
+#ifdef HAVE_CPLEX
+  //std::cout<<ATTILA<<INTEGER;
+  MipCplex mip2;
+  aTest(mip2);
+#endif
+
   return 0;