[Coin-discuss] RE: Running the BranchAndCut example
Laszlo Ladanyi
ladanyi at us.ibm.com
Mon Apr 7 09:47:06 EDT 2003
Uh-oh... I haven't looked at the examples in a while. I'll check all today.
I can already tell what the problem with the Branch&Cut example:
"Cutting" is done by designating some of the rows as being in the matrix to
start with and after solving each LP the rest of the rows are tested for
feasibility. Whichever is violated is added to the formulation. This is the
"cutting". Now when a feasible solution is found it is sent back to the tree
manager and there, just to make sure, it is checked whether it violates any of
the constraints and that assertion fails. Roundoff errors can make that happen
(though not likely). I'll check it out in any case.
Can you tell me what operating system and compiler (including version) have
you used?
Thanks,
--Laci
On Mon, 7 Apr 2003, Jesper Hansen wrote:
> Sorry, thanks to Tommy T., I managed to link... needed to remove comments in
> Makefiles.location.
>
> Running Mkc, I get the following output:
>
> BCP_parameters::read_from_stream Scanning parameter stream.
> BCP_parameters::read_from_stream Scanning parameter stream.
> BCP_parameters::read_from_stream Scanning parameter stream.
> BCP_parameters::read_from_stream Scanning parameter stream.
> BCP_parameters::read_from_stream Scanning parameter stream.
> BCP_parameters::read_from_stream Scanning parameter stream.
> Coin0001I At line 1 NAME
> Coin0001I At line 2 ROWS
> Coin0001I At line 3415 COLUMNS
> Coin0001I At line 15064 RHS
> Coin0001I At line 15297 BOUNDS
> Coin0001I At line 20621 ENDATA
> Coin0002I Problem has 3411 rows, 5325 columns and 17038 elements
> MKC: Global lower bound is minus infinity.
> Segmentation fault
>
> ???
>
> 'Jesper
>
> -----Original Message-----
> From: coin-discuss-admin at www-124.ibm.com
> [mailto:coin-discuss-admin at www-124.ibm.com]On Behalf Of Jesper Hansen
> Sent: Monday, April 07, 2003 11:50 AM
> To: coin-discuss at oss.software.ibm.com
> Subject: RE: [Coin-discuss] RE: Running the BranchAndCut example
>
>
> Now, in the Mkc example I get a linking error:
>
> Linking bcps ...
>
> /home/jesper/COIN/Examples/Mkc/Linux-g/MKC_lp.o: In function
> `MKC_lp::initialize_solver_interface(void)':
> /home/jesper/COIN/Examples/Mkc/LP/MKC_lp.cpp:87: undefined reference to
> `OsiVolSolverInterface::OsiVolSolverInterface(void)'
> /home/jesper/COIN/Examples/Mkc/Linux-g/MKC_lp.o: In function
> `MKC_lp::modify_lp_parameters(OsiSolverInterface *, bool)':
> /home/jesper/COIN/Examples/Mkc/LP/MKC_lp.cpp:104: undefined reference to
> `OsiVolSolverInterface type_info function'
> collect2: ld returned 1 exit status
>
> 'Jesper
>
> -----Original Message-----
> From: coin-discuss-admin at www-124.ibm.com
> [mailto:coin-discuss-admin at www-124.ibm.com]On Behalf Of Tommy Thomadsen
> Sent: Monday, April 07, 2003 11:02 AM
> To: coin-discuss at oss.software.ibm.com
> Subject: Re: [Coin-discuss] RE: Running the BranchAndCut example
>
>
> Hi,
>
> I get the same errors (both the branchandcut example and the MaxCut
> example) with the newest version of COIN.
> You can check out a version from 2003/03/22, then the MaxCut example works
> for me. I don't know if anybody is working on correting it?
>
> Regards,
>
> Tommy Thomadsen
>
> > I further tried the MaxCut example, but I can't make it compile. I get the
> > following message:
> >
> > Compiling MC_lp_branch.cpp
> > /home/jesper/COIN/Examples/MaxCut/LP/MC_lp_branch.cpp: In method
> > `OsiSolverInterface *MC_lp::solveToOpt
> > (OsiVolSolverInterface *, const BCP_lp_result &, const BCP_vec<BCP_var *>
> &,
> > const BCP_vec<BCP_cut *>
> > &, double &)':
> > /home/jesper/COIN/Examples/MaxCut/LP/MC_lp_branch.cpp:319: could not
> convert
> > `ClpSimplex(clpModelPtr)'
> > to `ClpSimplex &'
> > /home/jesper/COIN/include/ClpSimplex.hpp:324: in passing argument 1 of
> > `ClpSimplex::returnModel
> > (ClpSimplex &)'
> > /home/jesper/COIN/Examples/MaxCut/LP/MC_lp_branch.cpp:397: could not
> convert
> > `ClpSimplex(clpModelPtr)'
> > to `ClpSimplex &'
> > /home/jesper/COIN/include/ClpSimplex.hpp:324: in passing argument 1 of
> > `ClpSimplex::returnModel
> > (ClpSimplex &)'
> > /home/jesper/COIN/Examples/MaxCut/LP/MC_lp_branch.cpp:407: could not
> convert
> > `ClpSimplex(clpModelPtr)'
> > to `ClpSimplex &'
> > /home/jesper/COIN/include/ClpSimplex.hpp:324: in passing argument 1 of
> > `ClpSimplex::returnModel
> > (ClpSimplex &)'
> > make[1]: *** [/home/jesper/COIN/Examples/MaxCut/Linux-g/MC_lp_branch.o]
> > Error 1
> >
> > Please help.
> >
> > Jesper Hansen
> >
> > -----Original Message-----
> > From: Jesper Hansen [mailto:jesper at carmen.se]
> > Sent: Monday, April 07, 2003 9:36 AM
> > To: coin-discuss at www-124.ibm.com
> > Subject: Running the BranchAndCut example
> >
> >
> > Hi COIN-OR
> >
> > I'm trying out the example in BCP. It seems to work fine until it aborts
> > with an assertion. Below I've snipped the first and last part of the
> output.
> > Any ideas?
> >
> > Best regards
> >
> > Jesper Hansen
> >
> > --------------------------
> >
> > BCP_parameters::read_from_stream Scanning parameter stream.
> > BCP_parameters::read_from_stream Scanning parameter stream.
> > BCP_parameters::read_from_stream Scanning parameter stream.
> > BCP_parameters::read_from_stream Scanning parameter stream.
> > BCP_parameters::read_from_stream Scanning parameter stream.
> > BCP_parameters::read_from_stream Scanning parameter stream.
> > Coin0001I At line 15 NAME P0033
> > Coin0001I At line 16 ROWS
> > Coin0001I At line 34 COLUMNS
> > Coin0001I At line 109 RHS
> > Coin0001I At line 118 BOUNDS
> > Coin0001I At line 152 ENDATA
> > Coin0002I Problem P0033 has 16 rows, 33 columns and 98 elements
> > Coin0008I P0033 read with 0 errors
> > Clp0005I 0 Objective 0 Primal infeas 27.2175 (10)
> > Clp0005I 19 Objective 2520.57
> > Clp0000I Optimal - objective value 2520.57
> >
> > --------------------
> >
> > LP: *** Starting iteration 2 ***
> > Clp0005I 0 Objective 3053.44 Primal infeas 2.16911 (9)
> > Clp0005I 6 Objective 3089
> > Clp0001I Primal infeasible - objective value 3089
> > LP: Matrix size: 33 vars x 33 cuts
> > LP: Solution value: 3089.0000 / 36 , 6
> > LP: Default test_feasibility() executed.
> > LP: Default test_full() executed.
> > LP: Terminating and fathoming due to proven high cost.
> > LP: Deleting 5 rows from the matrix.
> > TM: Pruning NODE 8 LEVEL 4 instead of sending it.
> > TM: Pruning NODE 11 LEVEL 6 instead of sending it.
> > TM: Pruning NODE 13 LEVEL 7 instead of sending it.
> > TM: Pruning NODE 10 LEVEL 5 instead of sending it.
> > TM: Pruning NODE 16 LEVEL 8 instead of sending it.
> > TM: Pruning NODE 15 LEVEL 8 instead of sending it.
> > TM: Running time: 0.340
> > TM: search tree size: 31 max depth: 8
> > LP statistics:
> > time in cut generation : 0.060 sec
> > time in var generation : -0.000 sec
> > time in heuristics : -0.000 sec
> > time in solving LPs : 0.140 sec
> > time in strong branching: 0.110 sec
> >
> > TM: The best solution found has value 3089.000000
> > bcps: /home/jesper/COIN/Examples/BranchAndCut/TM/BB_tm.cpp:234: void
> > BB_tm::display_feasible_solution (const BCP_solution *): Assertion `lhs[i]
> > >= desc.rlb_core[i] - 1e-6 && lhs[i] <= desc.rub_core[i] + 1e-6' failed.
> > Aborted
> >
> >
> > _______________________________________________
> > Coin-discuss mailing list
> > Coin-discuss at www-124.ibm.com
> > http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-discuss
> >
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at www-124.ibm.com
> http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-discuss
>
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at www-124.ibm.com
> http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-discuss
>
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at www-124.ibm.com
> http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-discuss
>
More information about the Coin-discuss
mailing list