t -> min
subjected to
t >= f0(x)
t >= f1(x)
...
t >= fk(x)
Let me note that the NLP problem obtained is always constrained (in addition to constraints lb, ub, A, Aeq, c, h from original mmp we get new non-linear inequality constraints written above).

No comments:
Post a Comment