Hello, I have a problem of maximizing f1(X) and f2(X) and minimzing f3(X) where f1(X) = f2(X)/ f3(X) and X is a vector of real variables in [0,1] ^ 10
f2 and f3 are blackbox computer functions. My target is to find the max f1(X) with constraints: f2(X) >= min2>0 _and_ f3(X) <= max3 and inherentyl f3(X)>0 1. Can nlopt be used for such a problem? 2. Can the problem be simplified to dealing just with f2 and f3? Regards, MM
_______________________________________________ NLopt-discuss mailing list [email protected] http://ab-initio.mit.edu/cgi-bin/mailman/listinfo/nlopt-discuss
