Hi All, Peter Lin sent me a manual for Xpress-MP (a Fair Isaac product), since we'd been discussing some work in the operations research / optimization domain.
In that manual, the first problem that the authors give is the following: The Chess Set Problem ===================== A small joinery makes two different sizes of boxwood chess sets. The small set requires 3 hours of machining on a lathe, and the large set requires 2 hours. There are four lathes with skilled operators who each work a 40 hour week, so we have 160 lathe-hours per week. The small chess set requires 1 kg of boxwood, and the large set requires 3 kg. Unfortunately, boxwood is scarce and only 200 kg per week can be obtained. When sold, each of the large chess sets yields a profit of $20, and one of the small chess set has a profit of $5. Q. How many sets of each kind should be made each week so as to maximize profit. Now, I happen to play chess and I do own an ebony and boxwood chess set, so I couldn't resist trying to solve this problem using rules and Jess. I am posting my solution, but don't peek if you want to try it yourself! :-) I think that it shows how elegant and powerful the Jess language is. Cheers, Jason ----------------------------------------------------------- Morris Technical Solutions LLC [EMAIL PROTECTED] (517) 304-5883
chessset.clp
Description: Binary data
