ParQGHandlerAdvance.h

Go to the documentation of this file.

// 
//     Minotaur -- It's only 1/2 bull
// 
//     (C)opyright 2009 - 2025 The Minotaur Team.
// 
 
#ifndef MINOTAURPARQGHANDLERADVANCE_H
#define MINOTAURPARQGHANDLERADVANCE_H
 
#include <stack>
 
#include "Handler.h"
#include "Engine.h"
#include "Problem.h"
#include "Function.h"
#include "Linearizations.h"
 
namespace Minotaur {
 
struct ParQGStats {
  size_t nlpS;      
  size_t nlpF;      
  size_t nlpI;      
  size_t nlpIL;     
  size_t cuts;      
  size_t rcuts;     
  size_t fracCuts;    
}; 
 
 
class ParQGHandlerAdvance : public Handler {
 
private: 
  EnvPtr env_;
 
  double intTol_;
 
  LoggerPtr logger_;
 
  static const std::string me_;
 
  ProblemPtr minlp_;
 
  std::vector<ConstraintPtr> nlCons_;
 
  EnginePtr nlpe_;
 
  std::stack<Modification *> nlpMods_;
  
  EngineStatus nlpStatus_;
  
  double * solC_;
 
  VariablePtr objVar_;
 
  bool oNl_;
 
  RelaxationPtr rel_;
 
  double relobj_; 
 
  double solAbsTol_;
 
  double solRelTol_;
 
  double objAbsTol_;
 
  double objRelTol_;
  
  LinearizationsPtr extraLin_;
  
  double maxVioPer_;
  
  double objVioMul_;
 
  UInt nodeDep_;
 
  std::vector<double > consDual_; 
 
  std::string cutMethod_;
  
  int lastNodeId_;
 
  ParQGStats *stats_;
 
public:
  ParQGHandlerAdvance(EnvPtr env, ProblemPtr minlp, EnginePtr nlpe); 
  
  ~ParQGHandlerAdvance();
 
 
  //double * getCenter() {return solC_;};
  
  //void setConsDual(std::vector<double > *consDual) {consDual_ = consDual;} 
 
  //void setNodeDep(UInt * nodeDep) {nodeDep_ = nodeDep;} 
  
  
  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();};
 
       
  // Base class method. 
  std::string getName() const;
  
  // Get statistics
  ParQGStats* getStats() {return stats_; };
 
  void nlCons();
  
  void loadProbToEngine();
  
  void setRelaxation(RelaxationPtr rel);
 
  // 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 *, Solution **) {return Finished;};
 
  bool presolveNode(RelaxationPtr, NodePtr, SolutionPoolPtr, ModVector &,
                    ModVector &)
  {return false;};
 
  void postsolveGetX(const double *, UInt, DoubleVector *) {};
 
  void relaxInitFull(RelaxationPtr rel, SolutionPool *, bool *is_inf);
 
  void relaxInitInc(RelaxationPtr rel, SolutionPool *, 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 setObjVar();
  
 
  void solveCenterNLP_(EnginePtr nlpe);
 
  void writeStats(std::ostream &out) const;
 
private:
  void addInitLinearX_(const double *x);
 
  void cutIntSol_(const double *lpx, CutManager *cutMan, 
                  SolutionPoolPtr s_pool, bool *sol_found, 
                  SeparationStatus *status);
 
  void fixInts_(const double *x);
   
  void findCenter_();
  
  bool boundaryPtForCons_(double* xnew, const double *xOut,
                                     std::vector<UInt > &vioCons);
 
  void genLin_(const double *x, std::vector<UInt> vioCons, CutManager *cutMan);
  
  void ECPTypeCut_(const double *x, CutManager *, ConstraintPtr con, double act);
  
  void ESHTypeCut_(const double *lpx, CutManager *cutMan);
  
  void objCutAtLpSol_(const double *lpx, CutManager *,
                                  SeparationStatus *status, bool fracNodes);
 
  void initLinear_(bool *isInf);
  
  bool isIntFeas_(const double* x);
  
  void dualBasedCons_(ConstSolutionPtr sol);
 
  void maxVio_(ConstSolutionPtr sol, NodePtr node,
                               CutManager *cutMan,
                               SeparationStatus *status);
 
  void linearizeObj_();
 
  void linearAt_(FunctionPtr f, double fval, const double *x, 
                 double *c, LinearFunctionPtr *lf, int *error);
  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 consCutsAtLpSol_(const double *lpx, CutManager *cutman,
                    SeparationStatus *status);
 
 
 
  void cutToObj_(const double *nlpx, const double *lpx, CutManager *,
                   SeparationStatus *status);
 
  void relax_(bool *is_inf);
 
  void solveNLP_();
 
  void unfixInts_();
 
  void updateUb_(SolutionPoolPtr s_pool, double nlpval, bool *sol_found);
 
  };
 
  typedef ParQGHandlerAdvance* ParQGHandlerAdvancePtr;
}
#endif