[galib] Constrainted Optimization

[Mitchell, Scott - AES]

Tobias,

Yes, you can't just delete members of the population as you suggest.
Doing that would mess with the internal structure. Other parts of the
code expect it is there. If you were to just remove the const, and call
the destroy(), it would likely crash somewhere down the line.

Notice that Brian's code doesn't _delete_ the individual, it just
re-initializes it.

You could duplicate Brian's but check for constraint violation instead
of equality, and re-init the violators.

Personally, I would start with your original suggestion of scoring
solutions outside the constraint very poorly. Try it that way first. And
if that isn't satisfactory then try Brian's. Or if the constraints are
really ugly (for example you rarely get a population that satisfies the
constraint), perhaps a variation of the interior/exterior point methods
used by Newtonian optimizations could be applied.


Scott

This e-mail and any files transmitted with it may be proprietary and are intended solely for the use of the individual or entity to whom they are addressed. If you have received this e-mail in error please notify the sender. Please note that any views or opinions presented in this e-mail are solely those of the author and do not necessarily represent those of ITT Corporation. The recipient should check this e-mail and any attachments for the presence of viruses. ITT accepts no liability for any damage caused by any virus transmitted by this e-mail.