0
$\begingroup$

why not solve a linear programming problem with a global opt method, or a local search method as SQP or Newton methods? I am writting a solver facing linear and non linear problems, and I wonder whether it could be accurate to implement single optimization method that can crack all problems. Why not do so?

Thanks for your thoughts on this issue.

  • 0
    "Crack all problems..." Have you heard of NP-hard problems?2012-03-17

1 Answers 1

3

What makes you think they aren't? Simplex algorithms are local search, and interior point methods are global optimisation.