algorithm - find max of a function that is minimized of a group of functions -

I want to find an algorithm that meets the maximum of a function that is least of a group of other functions. This problem can be described as following: search the maximum f (x) . F (x) = minutes (F1 (x), f2 (x), ..., fn) with a & lt; = X & lt; = B .

This is a classic maximin problem, commonly used in tree searching to hide pay-trees. is.

In a maximum, "current maximum" is kept. Then, for every repetition of X, loop through (1-> N) If any FN comes with the value & lt; Existing maximum, there is no point in continuing (as the minimum of all functions will be of course

Without knowing the function function, there is no analytical method to get answers without any transactions.