[Dip-tickets] [Dip] #64: Primal heuristic "Recomposed solution is not feasible " error

[Dip]

#64: Primal heuristic "Recomposed solution is not feasible " error
-------------------+--------------------------------------------------------
Reporter:  vejlin  |       Type:  defect
  Status:  new     |   Priority:  major 
 Version:  trunk   |   Keywords:        
-------------------+--------------------------------------------------------
 This error occurs when using the MILPBlock example:
 - use the atm_5_10_1 instance
 - use the atm_5_10_1_KP.block block file (attached)
 - impose artificial bounds on all columns in the parameter file ("ColumnLB
 = -1.0e4" and "ColumnUB = 1.0e4")

 This yields the following error message:
 Alps0240I Processed 60 nodes, has 31 nodes, best relaxed 59434.622, best
 feasible 59734.659
 COIN Exception [ Recomposed solution is not feasible ] at
 ../../../Dip/src/DecompAlgoPC.cpp:L900 in DecompAlgoPC::solutionUpdateAsIp

-- 
Ticket URL: <https://projects.coin-or.org/Dip/ticket/64>
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.