[ library(fd) | Reference Manual | Alphabetic Index ]
Find the solution of Goal that minimizes C.
- A callable term.
- A linear term.
A solution of the goal Goal is found that minimizes the value of C.
The solution is found using the branch and bound method. Whenever
a better solution is found, the upper cost bound is tightened and
the search for a better solution continues. Every time a new
better solution is found, the event 280 is raised, its default
handler prints the current cost.
Note: Operationally, the difference with min_max/2 is that, after
finding a solution, the search is not abandoned and restarted, but
continued with a tightened cost bound.
Fails if there is no solution to Goal.
min_max / 2, min_max / 4, min_max / 5, min_max / 6, min_max / 8, minimize / 4, minimize / 5, minimize / 6, minimize / 8, minimize_bound_check / 0