[CarVac]

Simplex methods can handle those tough situations, though.

[FabHK]

Simplex is not applicable. Simplex only minimises a linear function (f(x)=c'x) under linear inequality constraints (Ax≤b). The minimisation problem here is unconstrained, but (very) non-linear.

[CarVac]

I guess I wasn't being precise, I meant Nelder-Mead.