Changeset 1319:6e277ba3fc76 in lemon-0.x for src/work/athos/lp/lp_cplex.cc

Timestamp:

04/07/05 17:22:03 (20 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

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

Message:

Cplex interface has improved a lot.

File:

• src/work/athos/lp/lp_cplex.cc (modified) (6 diffs)

src/work/athos/lp/lp_cplex.cc

@@ -25 +25 @@
   {
     int i = CPXgetnumcols (env, lp);
-    int lb[1],ub[1];
+    Value lb[1],ub[1];
     lb[0]=-INF;//-CPX_INFBOUND;
     ub[0]=INF;//CPX_INFBOUND;
@@ -34 +34 @@
   int LpCplex::_addRow() 
   {
+    //We want a ranged row
+    char sense[1];
+    sense[0]='R';
+
     int i = CPXgetnumrows (env, lp);
-    status = CPXnewrows (env, lp, 1, NULL, NULL, NULL, NULL, NULL);
+    status = CPXnewrows (env, lp, 1, NULL, sense, NULL, NULL);
     return i;
   }
@@ -46 +50 @@
   {
     int rowlist[length+1];
+    int* p=rowlist;
     for (int k=1;k<=length;++k){
       rowlist[k]=i;
@@ -51 +56 @@
     status = CPXchgcoeflist(env, lp, 
                             length, 
-                            rowlist++, 
-                            inices++, 
-                            values++);
+                            p++, 
+                            const_cast<int * >(indices++), 
+                            const_cast<Value * >(values++));
   }
   
@@ -62 +67 @@
   {
     int collist[length+1];
+    int* p=collist;
     for (int k=1;k<=length;++k){
       collist[k]=i;
@@ -67 +73 @@
     status = CPXchgcoeflist(env, lp, 
                             length, 
-                            inices++, 
-                            collist++, 
-                            values++);
+                            const_cast<int * >(indices++), 
+                            p++, 
+                            const_cast<Value * >(values++));
   }
   
   void LpCplex::_setColLowerBound(int i, Value value)
   {
+    int indices[1];
+    indices[0]=i;
+    char lu[1];
+    lu[0]='L';
+    Value bd[1];
+    bd[0]=value;
+    status = CPXchgbds (env, lp, 1, indices, lu, bd);
+ 
   }
   
   void LpCplex::_setColUpperBound(int i, Value value)
   {
+    int indices[1];
+    indices[0]=i;
+    char lu[1];
+    lu[0]='U';
+    Value bd[1];
+    bd[0]=value;
+    status = CPXchgbds (env, lp, 1, indices, lu, bd);
   }
   
   void LpCplex::_setRowLowerBound(int i, Value value)
   {
+    status = CPXchgcoef (env, lp, i, -1, value);
+
   }
   
   void LpCplex::_setRowUpperBound(int i, Value value)
   {
+    //TODO Ezt kell meg megirni
+    //    Value lo=CPX
   }
   
   void LpCplex::_setObjCoeff(int i, Value obj_coef)
   {
+    status = CPXchgcoef (env, lp, -1, i, obj_coef);
+   }
+
+  LpCplex::SolveExitStatus LpCplex::_solve()
+  {
+    return SOLVED;
+//     int i=  lpx_simplex(lp);
+//     switch (i) {
+//     case LPX_E_OK: 
+//       return SOLVED;
+//       break;
+//     default:
+//       return UNSOLVED;
+//     }
   }
 
-  LpCplex::SolutionStatus LpCplex::_solve()
-  {
-    return OPTIMAL;
-  }
-
-  LpCplex::Value LpCplex::_getSolution(int i)
+  LpCplex::Value LpCplex::_getPrimal(int i)
   {
     return 0;
   }
   
+  LpCplex::Value LpCplex::_getPrimalValue()
+  {
+    return 0;
+  }
+  
+ 
+  LpCplex::SolutionStatus LpCplex::_getPrimalStatus()
+  {
+    return OPTIMAL;
+//     int stat=  lpx_get_status(lp);
+//     switch (stat) {
+//     case LPX_UNDEF://Undefined (no solve has been run yet)
+//       return UNDEFINED;
+//       break;
+//     case LPX_NOFEAS://There is no feasible solution (primal, I guess)
+//     case LPX_INFEAS://Infeasible 
+//       return INFEASIBLE;
+//       break;
+//     case LPX_UNBND://Unbounded
+//       return INFINITE;
+//       break;
+//     case LPX_FEAS://Feasible
+//       return FEASIBLE;
+//       break;
+//     case LPX_OPT://Feasible
+//       return OPTIMAL;
+//       break;
+//     default:
+//       return UNDEFINED; //to avoid gcc warning
+//       //FIXME error
+//     }
+  }
+
+
+  void LpCplex::_setMax()
+  {
+    CPXchgobjsen (env, lp, CPX_MAX);
+   }
+  void LpCplex::_setMin()
+  {
+    CPXchgobjsen (env, lp, CPX_MIN);
+   }
+  
 } //namespace lemon