Subj : Re: efficient way of processing m combinations of n numbers in p sets
To   : comp.programming
From : Willem
Date : Tue Aug 16 2005 04:22 pm

Mike wrote:
) I think the problem is one of minimization (n horses with fixed odds,
) placing variable bets on each and finding the best "loss" after taking
) into account total cost for placing a bet on each)

It could be that the actual function is quite simple, and therefore
egligible for algebraic or analytical (or whateve you call it) solving.

It would be enlightening if you could post the actual calculation here.

Say the bets are  a, b, c, d, e, f  then what would the 'loss' be ?

) Thanks for the search pointers.  I had a look at combinatorial
) optimization and simulated annealing which seem a likely solution, but
) being able to apply these to this scenario may be tricky for me :-)

Those pointers were half in jest, by the way.


SaSW, Willem
-- 
Disclaimer: I am in no way responsible for any of the statements
            made in the above text. For all I know I might be
            drugged or something..
            No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT

.