[Coin-lpsolver] Clp and cbc consttants in code.

[William H. Patton]

I am new to cbc. I have just compiled CBC in VS8
Cbc-1.1.0-win32-msvc8.

I am surprised to see the warnings about implicit conversion of
double to float in Cbc-1.1.0-win32-msvc8.  It is clear that floats
are intentionally used. Is the memory used so large as to need
this? If so, I think it would be safer to use a CBC private type
so the assignment overload can pass thru protective code to deal
carefully with the too large exponents.  I think particularly
about the 1.0e+100 apparent infinity of clp constants.
CbcBranchActual.cpp(2141): double bestEstimate = 1.0e100;
CbcBranchActual.cpp(2139): double bestCriterion=-1.0e50;
CbcFathomDynamicProgramming.cpp(262):
CoinFillN(cost_,size_,FLT_MAX);
My compiler definitions show range limits as
#define DBL_MAX         1.7976931348623158e+308 /* max value */
#define FLT_MAX         3.402823466e+38F        /* max value */

The other source maintenance concern I have is the presence of
many constants in the code.  Attached is a list of the nearly 400
instances of doubles that I could find with an easy regex search..
I think good practice calls for these to deserve names so they can
be consistently used.  They could be #defined but better for an
API oriented extensible framework, they should have API get and
set access functions
for user tinkering. I think there are about 30 distinct values in
the 400 lines.

You may have a better search that can find the rest of the not 0
or 1 manifest constants in the code.  I see .5, .005. 0.5 swept
along in the attached search
CbcNode.cpp(2402): double upPenalty =
CoinMin(upCost[i],1.0e110)*(1.0-value);
CbcNode.cpp(2403): double downPenalty =
CoinMin(downCost[i],1.0e110)*value;
CbcNode.cpp(2443): sort[iBestGot]=-1.0e120;
CbcBranchCut.cpp(540): if (djTolerance_<1.0e10) {
CbcCompareActual.cpp(278): if (treeSize_*size>5.0e7)
CbcHeuristic.cpp(719): distance = floor(distance+1.05e-8);
assert (lower[iColumn]>-1.0e20);

I am impressed by the branch and cut performance on the test
problem that brought me to the site. I think the Feasibility Pump
is really quite a neat feature.

William