[Coin-discuss] Re: BCP : how to compute initial upper bound ?

[Francois Margot]

> 
> Message: 1 Date: Thu, 22 Jul 2004 17:27:07 +0200 From: Viet Hung Nguyen
> <Hung.Nguyen at lip6.fr> To: coin-discuss at www-126.southbury.usf.ibm.com 
> Subject: [Coin-discuss] BCP : how to compute initial upper bound ? 
> Reply-To: coin-discuss at www-124.ibm.com
> 
> Dear Coin, I would like to do a heuristic to find an initial value for the
> upper bound in BCP. I could not do it in BCP_tm_user module. Does the
> unique possbile way to update the upper bound is using 
> generate_heuristic_solution method in BCP_lp_user module (primal 
> heuristic) ? Thanks in advance, Best regards, Nguyen
>

In BCP_tm_user::create_root() (or in a derived class): use

  BCP_tm_prob* p = getTmProblemPointer();
  p->ub((double) value_for_upper_bound);

Francois