Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
"Crack all problems..." Have you heard of NP-hard problems? – Dirk Mar 17 '12 at 21:18

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

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.