Cbc  2.9.9
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
AbcPrimalColumnSteepest.hpp
Go to the documentation of this file.
1 /* $Id: AbcPrimalColumnSteepest.hpp 1910 2013-01-27 02:00:13Z stefan $ */
2 // Copyright (C) 2002, International Business Machines
3 // Corporation and others, Copyright (C) 2012, FasterCoin. All Rights Reserved.
4 // This code is licensed under the terms of the Eclipse Public License (EPL).
5 
6 #ifndef AbcPrimalColumnSteepest_H
7 #define AbcPrimalColumnSteepest_H
8 
10 #include <bitset>
11 
12 //#############################################################################
13 class CoinIndexedVector;
14 
15 
24 
25 public:
26 
28 
29 
37  virtual int pivotColumn(CoinPartitionedVector * updates,
38  CoinPartitionedVector * spareRow2,
39  CoinPartitionedVector * spareColumn1);
41  void justDjs(CoinIndexedVector * updates,
42  CoinIndexedVector * spareColumn1);
44  int partialPricing(CoinIndexedVector * updates,
45  int numberWanted,
46  int numberLook);
48  void djsAndDevex(CoinIndexedVector * updates,
49  CoinIndexedVector * spareRow2,
50  CoinIndexedVector * spareColumn1);
52  void djsAndDevex2(CoinIndexedVector * updates,
53  CoinIndexedVector * spareColumn1);
55  void justDevex(CoinIndexedVector * updates,
56  CoinIndexedVector * spareColumn1);
65  CoinPartitionedVector * spareRow2,
66  CoinPartitionedVector * spareColumn1,
67  int type);
68 
70  virtual void updateWeights(CoinIndexedVector * input);
71 
73  void checkAccuracy(int sequence, double relativeTolerance,
74  CoinIndexedVector * rowArray1);
75 
77  void initializeWeights();
78 
87  virtual void saveWeights(AbcSimplex * model, int mode);
89  virtual void unrollWeights();
91  virtual void clearArrays();
93  virtual bool looksOptimal() const;
95  virtual void maximumPivotsChanged();
97 
100  inline int mode() const {
102  return mode_;
103  }
105 
108  enum Persistence {
109  normal = 0x00, // create (if necessary) and destroy
110  keep = 0x01 // create (if necessary) and leave
111  };
112 
114 
115 
123  AbcPrimalColumnSteepest(int mode = 3);
124 
127 
130 
132  virtual ~AbcPrimalColumnSteepest ();
133 
135  virtual AbcPrimalColumnPivot * clone(bool copyData = true) const;
136 
138 
140 
143  inline bool reference(int i) const {
144  return ((reference_[i>>5] >> (i & 31)) & 1) != 0;
145  }
146  inline void setReference(int i, bool trueFalse) {
147  unsigned int & value = reference_[i>>5];
148  int bit = i & 31;
149  if (trueFalse)
150  value |= (1 << bit);
151  else
152  value &= ~(1 << bit);
153  }
155  inline void setPersistence(Persistence life) {
156  persistence_ = life;
157  }
158  inline Persistence persistence() const {
159  return persistence_ ;
160  }
161 
163  //---------------------------------------------------------------------------
164 
165 private:
167  // Update weight
168  double devex_;
170  double * weights_;
176  double * savedWeights_;
177  // Array for exact devex to say what is in reference framework
178  unsigned int * reference_;
184  int state_;
197  int mode_;
202  // This is pivot row (or pivot sequence round re-factorization)
204  // This is saved pivot sequence
206  // This is saved outgoing variable
208  // Iteration when last rectified
210  // Size of factorization at invert (used to decide algorithm)
213 };
214 
215 #endif
void checkAccuracy(int sequence, double relativeTolerance, CoinIndexedVector *rowArray1)
Checks accuracy - just for debug.
virtual void updateWeights(CoinIndexedVector *input)
Updates weights - part 1 - also checks accuracy.
void djsAndDevex(CoinIndexedVector *updates, CoinIndexedVector *spareRow2, CoinIndexedVector *spareColumn1)
Update djs, weights for Devex using djs.
Persistence
enums for persistence
int mode_
0 is exact devex, 1 full steepest, 2 is partial exact devex 3 switches between 0 and 2 depending on f...
AbcPrimalColumnSteepest(int mode=3)
Default Constructor 0 is exact devex, 1 full steepest, 2 is partial exact devex 3 switches between 0 ...
AbcPrimalColumnSteepest & operator=(const AbcPrimalColumnSteepest &rhs)
Assignment operator.
virtual ~AbcPrimalColumnSteepest()
Destructor.
void setReference(int i, bool trueFalse)
virtual bool looksOptimal() const
Returns true if would not find any column.
CoinIndexedVector * alternateWeights_
alternate weight array (so we can unroll)
Primal Column Pivot Abstract Base Class.
void justDjs(CoinIndexedVector *updates, CoinIndexedVector *spareColumn1)
Just update djs.
virtual void maximumPivotsChanged()
Called when maximum pivots changes.
void djsAndDevex2(CoinIndexedVector *updates, CoinIndexedVector *spareColumn1)
Update djs, weights for Devex using pivot row.
CoinIndexedVector * infeasible_
square of infeasibility array (just for infeasible columns)
int partialPricing(CoinIndexedVector *updates, int numberWanted, int numberLook)
Update djs doing partial pricing (dantzig)
void initializeWeights()
Initialize weights.
double * savedWeights_
save weight array (so we can use checkpoint)
virtual AbcPrimalColumnPivot * clone(bool copyData=true) const
Clone.
virtual void saveWeights(AbcSimplex *model, int mode)
Save weights - this may initialize weights as well mode is - 1) before factorization 2) after factori...
bool reference(int i) const
reference would be faster using AbcSimplex&#39;s status_, but I prefer to keep modularity.
void setPersistence(Persistence life)
Set/ get persistence.
Primal Column Pivot Steepest Edge Algorithm Class.
int numberSwitched_
Number of times switched from partial dantzig to 0/2.
Indexed Vector.
virtual int pivotColumn(CoinPartitionedVector *updates, CoinPartitionedVector *spareRow2, CoinPartitionedVector *spareColumn1)
Returns pivot column, -1 if none.
void justDevex(CoinIndexedVector *updates, CoinIndexedVector *spareColumn1)
Update weights for Devex.
Persistence persistence_
Life of weights.
virtual void clearArrays()
Gets rid of all arrays.
int state_
Status 0) Normal -1) Needs initialization 1) Weights are stored by sequence number.
int type()
Returns type (above 63 is extra information)
AbcSimplex * model()
Returns model.
virtual void unrollWeights()
Gets rid of last update.
int doSteepestWork(CoinPartitionedVector *updates, CoinPartitionedVector *spareRow2, CoinPartitionedVector *spareColumn1, int type)
Does steepest work type - 0 - just djs 1 - just steepest 2 - both using scaleFactor 3 - both using ex...