[Dip-tickets] [Dip] #24: doPriceCut gives infeasible when doCut and doRelaxCut solve

[Dip]

#24: doPriceCut gives infeasible when doCut and doRelaxCut solve
--------------------+-------------------------------------------------------
Reporter:  mosu001  |       Type:  defect
  Status:  new      |   Priority:  major 
 Version:  0.8.7    |   Keywords:        
--------------------+-------------------------------------------------------

Comment(by mgalati):

 The first step to debugging this one, is to create the necessary input
 files for MILPBlock. All I need is the MPS file and a blocks file.

 Please produce the MPS file and a blockFile.txt which will be used to
 define which rows belong to which block. We can then try this using
 MILPBlock. If it fails in there, it should be easy for me to debug. If it
 works fine there, then we know the problem is related to Dippy.

 You can find information about MILPBlock and the blockFile format here:
 https://projects.coin-
 or.org/Dip/browser/trunk/Dip/examples/MILPBlock/README.txt.in

 You can provide either format below:

 {{{
 81 (1) BlockFileFormat = Pair
 82        For example, see
 ${DIP_ROOT}/data/MILP/block/retail/retail4.block.
 83        Each line contains: <block-id> <row-id>
 84
 85      (2) BlockFileFormat = List
 86        For example, see
 ${DIP_ROOT}/data/MILP/block/atm/atm_5_10_1.block
 87         <block-id1> <number of rows in block1>
 88         <rows in block 1...>
 89         <block-id2> <number of rows in block2>
 90         <rows in block 2...>
 91         ...
 92
 }}}

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