AbcDualRowSteepest.hpp

Go to the documentation of this file.

/* $Id: AbcDualRowSteepest.hpp 1910 2013-01-27 02:00:13Z stefan $ */
// Copyright (C) 2002, International Business Machines
// Corporation and others, Copyright (C) 2012, FasterCoin.  All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).

#ifndef AbcDualRowSteepest_H
#define AbcDualRowSteepest_H

#include "AbcDualRowPivot.hpp"
class CoinIndexedVector;


//#############################################################################

class AbcDualRowSteepest : public AbcDualRowPivot {
  
public:
  

  
  virtual int pivotRow();
  
  virtual double updateWeights(CoinIndexedVector & input,CoinIndexedVector & updatedColumn);
  virtual double updateWeights1(CoinIndexedVector & input,CoinIndexedVector & updateColumn);
  virtual void updateWeightsOnly(CoinIndexedVector & input);
  virtual void updateWeights2(CoinIndexedVector & input,CoinIndexedVector & updateColumn);
  
  virtual void updatePrimalSolution(CoinIndexedVector & input,
                                    double theta);
  
  virtual void updatePrimalSolutionAndWeights(CoinIndexedVector & weightsVector,
                                              CoinIndexedVector & updateColumn,
                                              double theta);
  virtual void saveWeights(AbcSimplex * model, int mode);
  virtual void recomputeInfeasibilities();
  virtual void clearArrays();
  virtual bool looksOptimal() const;
  
  enum Persistence {
    normal = 0x00, // create (if necessary) and destroy
    keep = 0x01 // create (if necessary) and leave
  };
  


  AbcDualRowSteepest(int mode = 3);
  
  AbcDualRowSteepest(const AbcDualRowSteepest &);
  
  AbcDualRowSteepest & operator=(const AbcDualRowSteepest& rhs);
  
  void fill(const AbcDualRowSteepest& rhs);
  
  virtual ~AbcDualRowSteepest ();
  
  virtual AbcDualRowPivot * clone(bool copyData = true) const;
  

  inline int mode() const {
    return mode_;
  }
  inline void setPersistence(Persistence life) {
    persistence_ = life;
  }
  inline Persistence persistence() const {
    return persistence_ ;
  }
  inline CoinIndexedVector * infeasible() const
  { return infeasible_;}
  inline CoinIndexedVector * weights() const
  { return weights_;}
  inline AbcSimplex * model() const
  { return model_;}
  
  //---------------------------------------------------------------------------
  
private:
  double norm_;
  double factorizationRatio_;
  int state_;
  int mode_;
  Persistence persistence_;
  CoinIndexedVector * weights_;
  CoinIndexedVector * infeasible_;
  CoinIndexedVector * savedWeights_;
};

// For Devex stuff
#undef DEVEX_TRY_NORM
#define DEVEX_TRY_NORM 1.0e-8
#define DEVEX_ADD_ONE 1.0
#endif