BCP_cg.hpp

Go to the documentation of this file.

// Copyright (C) 2000, International Business Machines
// Corporation and others.  All Rights Reserved.
#ifndef _BCP_CG_H
#define _BCP_CG_H

// This file is fully docified.

#include <cfloat>

#include "BCP_math.hpp"
#include "BCP_message_tag.hpp"
#include "BCP_vector.hpp"
#include "BCP_buffer.hpp"
#include "BCP_cg_param.hpp"
#include "BCP_parameters.hpp"
#include "BCP_process.hpp"

class BCP_cg_user;
class BCP_user_pack;
class BCP_message_environment;
class BCP_problem_core;
class BCP_var;
class BCP_cut;

class BCP_cg_prob : public BCP_process {
private:
   BCP_cg_prob(const BCP_cg_prob&);
   BCP_cg_prob& operator=(const BCP_cg_prob&);
public:

   // User provided members ---------------------------------------------------
   BCP_cg_user* user;

   BCP_user_pack* packer;

   BCP_message_environment* msg_env;

   BCP_buffer  msg_buf;

   BCP_parameter_set<BCP_cg_par> par;

   BCP_problem_core* core;
   
    //   int tree_manager;

   double upper_bound;

   // the lp solution, its sender and at which node in which iteration the lp
   // solution was generated.
   BCP_vec<BCP_var*> vars;
   BCP_vec<double>   x;
   int sender;


   int phase;
   int node_level;
   int node_index;
   int node_iteration;

public:
   BCP_cg_prob(int my_id, int parent);
   virtual ~BCP_cg_prob();
   inline bool has_ub() const { return upper_bound < BCP_DBL_MAX / 10; }
   inline double ub() const   { return upper_bound; }
   inline void ub(const double bd) { upper_bound = bd; }

   bool probe_messages();
   BCP_var* unpack_var();
   //--------------------------------------------------------------------------
   virtual BCP_buffer& get_message_buffer() { return msg_buf; }
   virtual void process_message();
};

// This function is used only internally. 
bool
BCP_cg_process_message(BCP_cg_prob& p, BCP_buffer& buf);

#endif