Changeset 1493

Timestamp:

Jul 30, 2010 2:40:39 PM (9 years ago)

Author:

lou

Message:

Change signature of getDualRays from (int) to (int,bool) to allow choice of
partial (row components) or full (row and column components) dual ray. Matches
Osi trunk revision 1551.

Location:

trunk/Cbc/src/OsiCbc

Files:

• OsiCbcSolverInterface.cpp (modified) (1 diff)
• OsiCbcSolverInterface.hpp (modified) (2 diffs)

trunk/Cbc/src/OsiCbc/OsiCbcSolverInterface.cpp

@@ -233 +233 @@
 
 //------------------------------------------------------------------
-std::vector<double*> OsiCbcSolverInterface::getDualRays(int maxNumRays) const
-{
-  return modelPtr_->solver()->getDualRays(maxNumRays);
+std::vector<double*> OsiCbcSolverInterface::getDualRays(int maxNumRays,
+                                                        bool fullRay) const
+{
+  return modelPtr_->solver()->getDualRays(maxNumRays,fullRay);
 }
 //------------------------------------------------------------------

trunk/Cbc/src/OsiCbc/OsiCbcSolverInterface.hpp

@@ -256 +256 @@
   /** Get as many dual rays as the solver can provide. (In case of proven
       primal infeasibility there should be at least one.)
-      
+
+      The first getNumRows() ray components will always be associated with
+      the row duals (as returned by getRowPrice()). If \c fullRay is true,
+      the final getNumCols() entries will correspond to the ray components
+      associated with the nonbasic variables. If the full ray is requested
+      and the method cannot provide it, it will throw an exception.
+
       <strong>NOTE for implementers of solver interfaces:</strong> <br>
       The double pointers in the vector should point to arrays of length
@@ -265 +271 @@
       vector using delete[].
   */
-  virtual std::vector<double*> getDualRays(int maxNumRays) const;
+  virtual std::vector<double*> getDualRays(int maxNumRays,
+                                           bool fullRay = false) const;
   /** Get as many primal rays as the solver can provide. (In case of proven
       dual infeasibility there should be at least one.)