[Coin-symphony] Issue with find_first_feasible
Ted Ralphs
tkralphs at lehigh.edu
Mon Mar 14 19:56:34 EST 2005
Paul,
These issues should be resolved now. If you do a CVS update, everything
should work. Please let me know if you have nay more problems.
Would you mind if I included your model as an example in the repository?
Cheers,
Ted
Paul Pacheco wrote:
> I compiled SYMPHONY for parallel using pvm.
>
> It works great, thank you very much.
>
> I try finding the first feasible solution to a problem by setting:
> find_first_feasible 1
> in a parameter file.
>
> The program finds a solution, but instead of printing it, it displays: "No
> solution found".
>
> If I remove the parameter, it works fine.
>
> I am seing the same issue if I set
> gap_limit 1.0
>
> It finds a solution, but it exits with the message "No solution found".
>
>
> *******************************************************
> * This is SYMPHONY Version 5.1alpha *
> * Copyright 2000-2005 Ted Ralphs *
> * All Rights Reserved. *
> * Distributed under the Common Public License 1.0 *
> *******************************************************
>
> SYMPHONY was called with the following arguments:
> /mnt/sfw/symphony/symphony_m_tm
> -f params
> -F bill.mod
> -D small/0.dat
>
> ============= Other Parameter Settings =============
>
> # amount of processors in the net
> max_active_nodes 10
>
>
> #time_limit 300
>
> find_first_feasible 1
>
> #diving_strategy 2
>
> do_reduced_cost_fixing 1
>
> #keep_warm_start 1
> #logging 1
>
> #tree_log_file_name tree.log
> #cut_log_file_name cut.log
>
>
> #generate_cgl_rounding_cuts 1
>
> #gap_limit 1.0
>
> #do_logical_fixing 1
>
> #do_primal_heuristic 1
> ====================================================
>
> Reading model section from bill.mod...
> 283 lines were read
> Reading data section from small/0.dat...
> 471 lines were read
> Generating OnePlanPerUser...
> Generating CalcPeakOverageMinutes...
> Generating CalcDCOverageMinutes...
> Generating RestrictNightstoPlan...
> Generating CalculateGroupOverage...
> Generating CalculateDCGroupOverage...
> Generating cost...
> Model has been successfully generated
> [t4019e] BEGIN
> [t4019f] BEGIN
> [t280085] BEGIN
> [t800f8] BEGIN
> [t3c0022] BEGIN
> [t280086] BEGIN
> [t800f9] BEGIN
> [t3c0023] BEGIN
> [t800fa] BEGIN
> [t3c0024] BEGIN
> [t3c0023]
> [t3c0023] ****** Found Better Feasible Solution !
> [t3c0023] ****** Cost: 91785.000000
> [t3c0023]
> [t3c0023] EOF
> [t3c0024] EOF
> [t280086] EOF
> [t800f8] EOF
> [t800f9] EOF
> [t800fa] EOF
> [t3c0022] EOF
> [t4019f] EOF
> [t280085] EOF
>
> ****************************************************
> * Branch and Cut Finished *
> * Now displaying stats and best solution found... *
> ****************************************************
>
> ====================== Misc Timing =========================
> Problem IO 0.101
> ======================= CP Timing ===========================
> Cut Pool 0.000
> ====================== LP/CG Timing =========================
> LP Solution Time 2.251
> Variable Fixing 0.008
> Pricing 0.000
> Strong Branching 7.212
> Separation 1.724
> =================== Parallel Overhead ======================
> Communication 0.118
> Ramp Up Time (TM) 1.793
> Ramp Up Time (LP) 2.707
> Ramp Down Time 0.018
> Idle Time (Node Pack) 0.020
> Idle Time (Nodes) 0.512
> Idle Time (Names) 0.269
> Idle Time (Diving) 3.449
> Idle Time (Cuts) 0.000
> Total User Time 11.413
> Total Wallclock Time 7.685
>
> ====================== Statistics =========================
> Number of created nodes : 857
> Number of analyzed nodes: 437
> Depth of tree: 40
> Size of the tree: 857
> Number of Chains: 66
> Number of Diving Halts: 67
> Number of cuts in cut pool: 0
> Lower Bound in Root: 91422.088
>
> No Solution Found
>
> _______________________________________________
> Coin-symphony mailing list
> Coin-symphony at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/coin-symphony
--
Dr. Ted Ralphs
Assistant Professor
Industrial and Systems Engineering
Lehigh University
(610)758-4784
tkralphs at lehigh.edu
www.lehigh.edu/~tkr2
More information about the Symphony
mailing list