[Scip] Branching on variables in the original problem

[Shahin Gelareh]

Dear SCIPers

It is clean that one can explicitly express the original variables as
combination of the master variables.
My original variables are binary.
But when one has \sum_i(\lambda_ij_x_ij )= x_j \in {0,1} there will be dual
variables associated to these sets of constraint.
How are these constraints which also include the lambdas would contribute
in some way in building the  pricing problem objective?

My results show that they cannot be  neglected even if they are equality
constraints otherwise it may never converge. So how we do we actually
handle them in  SCIP ?

Cheers
Shahin

















On Thu, Jan 10, 2013 at 8:44 AM, Marco Luebbecke <
marco.luebbecke at rwth-aachen.de> wrote:

> Dear Victor,
>
> the easiest way is to explicitly express the original variables as
> combination of your master variables. You can then directly branch on
> these original variables, also the elimination of master variables
> that are incompatible to the branching decisions is for free then (in
> the binary case). You only need to tell your pricing problem about
> branching decisions, see
>
> http://scip.zib.de/doc/html/FAQ.shtml#Q5.3
>
>
> Best regards,
> Marco
> _______________________________________________
> Scip mailing list
> Scip at zib.de
> http://listserv.zib.de/mailman/listinfo/scip
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20140427/57863691/attachment.html>