QGHandler.MotivationStats.h

// 
//     Minotaur -- It's only 1/2 bull
// 
//     (C)opyright 2009 - 2025 The Minotaur Team.
// 
 
#ifndef MINOTAURQGHANDLER_H
#define MINOTAURQGHANDLER_H
 
#include <stack>
 
#include "Handler.h"
#include "Engine.h"
#include "Problem.h"
#include "Function.h"
#include "Solution.h"
 
namespace Minotaur {
 
struct QGStats {
  size_t nlpS;      
  size_t nlpF;      
  size_t nlpI;      
  size_t nlpIL;     
  size_t cuts;      
  size_t inactiveCuts;      
  size_t cutsAtRoot; // Num of cuts added at root
}; 
 
struct vioInterval {
  double zero;     
  double first;     
  double second;    
  double third;     
  double fourth;    
  double fifth;     
  double all;     
};
 
class QGHandler : public Handler {
 
private: 
  EnvPtr env_;
 
  EngineStatus sepNLPStatus_;
  EngineStatus rootNLPStatus_;
  UInt inactiveCutsAtRoot_;      
  double rootObjVio_;
  double rootMaxVio_;
  double rootMinVio_;
  double rootAvgVio_;
  int lastNodeId_;
  double intNodes_;
  double fracNodes_;
  vioInterval *vioInt_;
  double * solNLP_;   // root nlp sol
  double nlpObjVal_;    // root nlp obj value
  double lpDist_; // distance of root lp sol from continuous feasiblre region
 
  double intTol_;
 
  LoggerPtr logger_;
 
  static const std::string me_;
 
  ProblemPtr minlp_;
 
  std::vector<ConstraintPtr> nlCons_;
 
  EnginePtr nlpe_;
 
  std::stack<Modification *> nlpMods_;
 
  EngineStatus nlpStatus_;
  
 
  VariablePtr objVar_;
 
  bool oNl_;
 
  RelaxationPtr rel_;
 
  double relobj_; 
 
  double solAbsTol_;
 
  double solRelTol_;
 
  double objATol_;
 
  double objRTol_;
  
  QGStats *stats_;
 
  //ConstSolutionPtr rootNLPSol_;
 
public:
  QGHandler(EnvPtr env, ProblemPtr minlp, EnginePtr nlpe); 
  
  ~QGHandler();
   
  Branches getBranches(BrCandPtr, DoubleVector &, RelaxationPtr,
                       SolutionPoolPtr)
  {return Branches();};
 
  void getBranchingCandidates(RelaxationPtr, 
                              const DoubleVector &, ModVector &,
                              BrVarCandSet &, BrCandVector &, bool &) {};
 
  ModificationPtr getBrMod(BrCandPtr, DoubleVector &, RelaxationPtr,
                           BranchDirection)
  {return ModificationPtr();};
 
  double * getRootNlpSol() {return solNLP_;}
  double getRootNlpObjVal() {return nlpObjVal_;}
       
  // Base class method. 
  std::string getName() const;
 
  // Base class method. Check if x is feasible. x has to satisfy integrality
  // and also nonlinear constraints.
  bool isFeasible(ConstSolutionPtr sol, RelaxationPtr relaxation, 
                  bool & should_prune, double &inf_meas);
 
  SolveStatus presolve(PreModQ *, bool *) {return Finished;};
 
  bool presolveNode(RelaxationPtr, NodePtr, SolutionPoolPtr, ModVector &,
                    ModVector &)
  {return false;};
 
  void postsolveGetX(const double *, UInt, DoubleVector *) {};
 
  void relaxInitFull(RelaxationPtr rel, bool *is_inf);
 
  void relaxInitInc(RelaxationPtr rel, bool *is_inf);
 
  void relaxNodeFull(NodePtr node, RelaxationPtr rel, bool *is_inf);
 
  void relaxNodeInc(NodePtr node, RelaxationPtr rel, bool *is_inf);
 
 
  void separate(ConstSolutionPtr sol, NodePtr node, RelaxationPtr rel, 
                CutManager *cutman, SolutionPoolPtr s_pool, ModVector &p_mods,
                ModVector &r_mods, bool *sol_found, SeparationStatus *status);
 
  void writeStats(std::ostream &out) const;
 
  //ConstSolutionPtr getRootNLPSol_() {return rootNLPSol_;}
 
private:
  void addInitLinearX_(const double *x);
 
  void consVio_(ConstSolutionPtr sol);
 
  void cutIntSol_(ConstSolutionPtr sol, CutManager *cutMan, 
                  SolutionPoolPtr s_pool, bool *sol_found, 
                  SeparationStatus *status);
 
  void fixInts_(const double *x);
 
  void initLinear_(bool *isInf);
 
  bool isLinPart_(ConstraintPtr con);
 
  void linearAt_(FunctionPtr f, double fval, const double *x, 
                 double *c, LinearFunctionPtr *lf, int *error);
 
  void linearizeObj_();
 
  void cutToCons_(const double *nlpx, const double *lpx, CutManager *,
                    SeparationStatus *status);
  
  void addCut_(const double *nlpx, const double *lpx, ConstraintPtr con, 
               CutManager *cutman, SeparationStatus *status);
  
 
  void cutsAtLpSol_(const double *lpx, CutManager *cutman,
                    SeparationStatus *status);
 
  //void objCutAtLpSol_(const double *lpx, CutManager *cutman,
                    //SeparationStatus *status);
 
      
  void cutToObj_(const double *nlpx, const double *lpx, CutManager *,
                   SeparationStatus *status);
 
  void relax_(bool *is_inf);
 
  void rootLPVio_(ConstSolutionPtr sol);
 
  void solveNLP_();
 
  void shortestDist_(ConstSolutionPtr sol);
 
  void unfixInts_();
 
  void updateUb_(SolutionPoolPtr s_pool, double nlpval, bool *sol_found);
 
  };
 
  typedef QGHandler* QGHandlerPtr;
}
#endif