min_max and minimize

From: Aminu, Farouk <f.aminu_at_lancaster.ac.uk>
Date: Sun 08 Jun 2003 10:52:17 AM GMT
Message-ID: <7F332A8009EE5D4CB62C87717A3498A1646CB1@exchange-be1.lancs.ac.uk>
Dear All,

I have been trying to find the fundamental differences between min_max and minimize predicates in fd library. Apart from the basic definitions of the two predicates and the fact that for example, minimize(?Goal, ?C)  does not take negative C, that is, -C, are there any other operational differences between the two? I tried to understand them by using both on the same minimization problem, I found out that even though they find the same optimum value, they took different computing times to find the provable optimum value. I will be very grateful with some explanations on the working pattern of the min_max/2 when used to solve maximization problems, that is, when it is set up as min_max(?Goal, ?-C). Any information will be highly aprreciated.

thanking you,

Received on Sun Jun 08 11:57:26 2003

This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:24 PM GMT GMT