Talk:Big M method
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
The page uses an overly-simplistic reading of the simplex method.[edit]
The article states "The simplex algorithm is the original and still one of the most widely used methods for solving linear maximization problems. However, to apply it, the origin (all variables equal to 0) must be a feasible point." This might be true for some simplex methods, but not all. In practice "the simplex method" is any active-set method for linear programs for which one new variable enters the basis (and one leaves) at each iteration.
See this website for a more general description of the big-M method (specifically, how it is just one way to eliminate the problem of finding an initial feasible solution, but also it's role in integer programming mdoeling).
Another website discussing "Big-M" in the context of integer programming is here.
- Hi User:Rileyjmurray, this page clearly needs attention from someone with expertise in this area, as a template on the page has proclaimed for nearly a decade. I strongly encourage you to make those edits! - Astrophobe (talk) 05:29, 2 February 2020 (UTC)