[Clp] printing log to text file with clp.exe
Stephanie Jakus
stephanie.jakus at gmail.com
Mon Oct 22 14:30:19 EDT 2012
Dear Clp mailing list,
I've been using the -barr option to solve problems with quadratic
objective and linear constraints with clp.exe. For many of these
problems, the algorithm produces as result like the following:
83 Primal -2305427.8 Dual -2305427.8 Complementarity 7.0378044e-07 -
77 fixed, rank 901
At end primal/dual infeasibilities 2.5524045e-07/519230.83,
complementarity gap 3.2356465e+15, objective -2305427.8
0 Obj -2305427.8 Primal inf 2.5524045e-07 (1) Dual inf 1e+08 (251)
81 Obj -2305427.8 Dual inf 0.53325108 (160)
118 Obj -2305427.8
Optimal - objective value -2305427.8
Optimal objective -2305427.788 - 118 iterations time 0.672
The complementarity gap seems to get down to 7.0378044e-07 but then it
reports "At end primal/dual infeasibilities 2.5524045e-07/519230.83,
complementarity gap 3.2356465e+15." So why does it give such a huge
number for the complementarity gap?
Also, dual infeasibilities are large. Does that mean I haven't found
an optimal solution?
Thanks for your suggestions.
Sincerely,
Stephanie Jakus
On Thu, Oct 18, 2012 at 3:20 PM, Stephanie Jakus
<stephanie.jakus at gmail.com> wrote:
>
> Thank you so very much! This works wonderfully. As you can tell, I am
> just learning to use the Windows terminal.
>
> Stephanie
>
> On Thu, Oct 18, 2012 at 2:11 PM, William H. Patton <pattonwh at comcast.net> wrote:
> > Try normal os pipe command for stdout?
> >
> > H:\lpsolve-55\glpk445bin>clp >mylog.txt
> > import share2qp.mps
> > barrier
> > solu $
> > quit
> >
> > H:\lpsolve-55\glpk445bin>
> >
> > Produces concatenate of log and solution. Clearly replace $ by
> > mysolution.txt for separate solution file.
> >
> > William
> >
> > Coin LP version 1.03.03, build Nov 8 2006
> > Clp takes input from arguments ( - switches to stdin)
> > Enter ? for list of commands or help
> > Clp:At line 1 NAME SHARE2B
> > At line 2 ROWS
> > At line 100 COLUMNS
> > At line 482 RHS
> > At line 495 QUADOBJ
> > Problem SHARE2B has 96 rows, 79 columns and 694 elements
> > At line 524 ENDATA
> > Model was imported from .\share2qp.mps in 0.002 seconds
> > Clp:Warning - the default ordering is just on row counts! The factorization
> > is being improved
> > Going dense for last 44 rows
> > 2928 elements in sparse Cholesky, flop count 89374
> > 0 Primal 1.88044e+006 Dual -1.66933e+008 Complementarity 1.95907e+008 - 0
> > fixed, rank 271
> > 1 Primal 30581.2 Dual -1.04439e+007 Complementarity 2.69781e+007 - 0 fixed,
> > rank 271
> > 2 Primal 1572.46 Dual -3.08706e+006 Complementarity 6.10843e+006 - 0 fixed,
> > rank 271
> > 3 Primal 310.856 Dual -1.45916e+006 Complementarity 2.50716e+006 - 0 fixed,
> > rank 271
> > 4 Primal 509.428 Dual -501381 Complementarity 606063 - 0 fixed, rank 271
> > 5 Primal 967.293 Dual -105866 Complementarity 115920 - 0 fixed, rank 271
> > 6 Primal 837.844 Dual -52400.5 Complementarity 57435.8 - 0 fixed, rank 271
> > 7 Primal 102.953 Dual -4147.86 Complementarity 4353.34 - 0 fixed, rank 271
> > 8 Primal -311.19 Dual -855.931 Complementarity 551.318 - 0 fixed, rank 271
> > 9 Primal -349.045 Dual -618.451 Complementarity 275.989 - 0 fixed, rank 271
> > 10 Primal -377.725 Dual -436.077 Complementarity 59.7189 - 0 fixed, rank 271
> > 11 Primal -393.652 Dual -415.969 Complementarity 22.9983 - 0 fixed, rank 271
> > 12 Primal -398.791 Dual -403.893 Complementarity 5.24673 - 0 fixed, rank 271
> > 13 Primal -400.188 Dual -402 Complementarity 1.8687 - 0 fixed, rank 271
> > 14 Primal -400.83 Dual -401.048 Complementarity 0.224578 - 0 fixed, rank 271
> > 15 Primal -400.902 Dual -400.948 Complementarity 0.0459498 - 13 fixed, rank
> > 271
> > 16 Primal -400.922 Dual -400.923 Complementarity 0.000311597 - 13 fixed,
> > rank 271
> > 17 Primal -400.923 Dual -400.923 Complementarity 2.5039e-006 - 13 fixed,
> > rank 271
> > 18 Primal -400.923 Dual -400.923 Complementarity 1.73075e-008 - 50 fixed,
> > rank 271
> > 19 Primal -400.923 Dual -400.923 Complementarity 1.69965e-008 - 50 fixed,
> > rank 271
> > 20 Primal -400.923 Dual -400.923 Complementarity 1.64724e-008 - 51 fixed,
> > rank 271
> > At end primal/dual infeasibilities 1.13318e-007/0, complementarity gap 0,
> > objective -400.923
> > Perturbing problem by 0.001 % of 11.7539 - largest nonzero change 0 (% 0) -
> > largest zero change 0
> > 0 Obj 0 Primal inf 6.67725e-007 (2) Dual inf 4.1881e+010 (11)
> > End of values pass after 46 iterations
> > 46 Obj 0 Primal inf 0.42702 (2) Dual inf 1.15925e+011 (35)
> > 50 Obj 0
> > Optimal - objective value 0
> > 0 Obj -381.984 Dual inf 48.2152 (17)
> > 5 Obj -400.917
> > Optimal - objective value -400.917
> > Optimal objective -400.9170115 - 5 iterations time 0.102
> > Clp:
> > 0 010101 0.80133581 -5.0513415e-014
> > 1 010102 1.798893 7.1054274e-015
> > 6 010107 5.8333333 -1.6485137e-014
> > 7 010108 10.1324 4.3104409e-014
> > 8 010120 55.697887 5.8399802e-016
> > 9 010131 18.565962 -1.2930807e-014
> > 10 010132 3.5659625 0
> > 12 010201 1.7564831 4.4408921e-016
> > 13 010202 5.201107 0
> > 14 010203 4.884694 4.4408921e-016
> > 17 010206 3.1577159 4.7184479e-016
> > 18 010220 14.844956 0
> > 19 010231 15 9.9983334e-016
> > 20 010301 1.1768432 5.6843419e-014
> > 23 010304 1.1963472 5.6843419e-014
> > 25 010306 5.8333333 4.5686581e-014
> > 27 010308 1 -8.5178983e-015
> > 29 010310 7.7098839 -8.0486285e-015
> > 30 010320 50.749223 -7.4886881e-016
> > 31 010331 16.916408 -3.2003375e-014
> > 32 010333 5.4823701 0
> > 43 010432 5 0
> > 44 010501 1.1582716 2.8421709e-014
> > 45 010502 0.40966994 0
> > 47 010504 2.3747624 2.4424907e-014
> > 49 010506 1.3682893 -8.437695e-015
> > 51 010508 9.2066367 5.0788948e-015
> > 53 010520 43.55289 2.2143234e-017
> > 54 010531 14.51763 -1.3065606e-014
> > 55 010601 1.2755831 -3.3306691e-016
> > 56 010602 3.999076 -8.8817842e-016
> > 57 010603 5.1587264 -4.4408921e-016
> > 58 010604 1.4349038 0
> > 59 010605 7.1317107 4.4408921e-016
> > 62 010608 1 8.8817842e-016
> > 64 010620 20.528491 0
> > 65 010631 20 -3.9552283e-016
> > 67 010633 20 0
> > 68 010701 1.2412485 -6.6613381e-016
> > 69 010702 3.6261616 8.8817842e-016
> > 70 010703 4.8412736 -6.6613381e-016
> > 71 010704 0.065096158 -3.2441971e-009
> > 73 010706 1.5 6.6613381e-016
> > 74 010707 1 0
> > 75 010708 2.6115452 -6.913306e-016
> > 77 010720 12.68829 -2.1495119e-017
> > 78 010731 14.885325 0
> > Clp:
> >
> >
> >
> > On 10/18/2012 10:52 AM, Stephanie Jakus wrote:
> >>
> >> Dear Clp mailing list,
> >> I am trying to print the results of "log" to a text file when using
> >> clp.exe. I know it can be done because somehow when I started using
> >> clp.exe it was always printing the log to a text file (and at that
> >> point I really wanted to print the solution to txt rather than the
> >> log). Now I can't get back to printing the log to a text file.
> >>
> >> (I'm calling clp.exe from a third party software and I just want some
> >> record of whether or not clp solved successfully.)
> >>
> >> Can anyone help suggest a combination of -printi -log and -solu that
> >> does this? Or is there another command?
> >>
> >> Thanks very much for your time.
> >>
> >> Sincerely,
> >> Stephanie Jakus
> >>
> >>
> >>
> >> On Wed, Oct 17, 2012 at 10:21 AM, Stephanie Jakus
> >> <stephanie.jakus at gmail.com> wrote:
> >>>
> >>> Dear Clp mailing list,
> >>> I'm calling clp.exe from within a windows program and returning the
> >>> results to the program by having clp print the solution to a text
> >>> file, which my program then parses. I'm using the "barrier" option as
> >>> my objective is quadratic.
> >>>
> >>> Could anyone suggest a way to make clp.exe print the complementarity
> >>> gap along with the solution? I'm just looking for a way to return some
> >>> indicator that describes whether or not clp has successfully finished
> >>> solving the problem.
> >>>
> >>> Thanks for your help!
> >>>
> >>> Sincerely,
> >>> Stephanie Jakus
> >>
> >> _______________________________________________
> >> Clp mailing list
> >> Clp at list.coin-or.org
> >> http://list.coin-or.org/mailman/listinfo/clp
> >>
> >
More information about the Clp
mailing list