[Dip-tickets] [Dip] #20: some bug in DualStab implmentation

[Dip]

#20: some bug in DualStab implmentation
--------------------+-------------------------------------------------------
Reporter:  mgalati  |     Owner:  mgalati
    Type:  defect   |    Status:  new    
Priority:  major    |   Version:  trunk  
Keywords:           |  
--------------------+-------------------------------------------------------

Comment(by mgalati):

 Fixed. Since dual=0 is not necessarily dual feasible, we cannot start
 Wegntes with dual=0. Rather, on the first iter we must init the
 dual=dualRM (from LP duals). Then, subsequent duals are dual feasible
 since Wegntes takes convex combinations.

-- 
Ticket URL: <https://projects.coin-or.org/Dip/ticket/20#comment:1>
Dip <https://projects.coin-or.org/Dip>
An extensible software framework for implementing decompositon-based bounding algorithms for use in solving large-scale discrete optimization problems.