Dantzig's simplex algorithm, or simplex method, is an algorithm for solving linear programming problems: optimizing a linear objective function subject to linear equality and inequality constraints. George Dantzig developed it in the mid-1940s while working on planning methods for the United States Army Air Force, refining the formulation by incorporating an objective function in 1947. The algorithm's name comes from the geometric concept of a simplex, a term suggested by T. S. Motzkin, even though simplices are not literally used within the method itself. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Time Complexity
Time Complexity (category)Exponential Time -- O(2^n) 1 Credited ToGeorge Dantzig, mid-1940s. 2 Connections
In Field
Source Wikipedia: Simplex Algorithm
Sources
1. Simplex Algorithm (Wikipedia)
Wikipedia infobox: time complexity exponentialQuote, Wikipedia infobox: time complexity exponential
exponential
2. Wikipedia: Simplex Algorithm
Wikimedia FoundationLead section
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming.
History
George Dantzig worked on planning methods for the US Army Air Force during World War II using a desk calculator. During 1946, his colleague challenged him to mechanize the planning process to distract him from taking another job.
In Field: Algorithms and Complexity Theory, Lead sentence
simplex algorithm (or simplex method) is an algorithm for linear programming.
View the Source Wikidata: Simplex Algorithm
Wikidata Q134164, class allow-list match (w-wdresolver-0926)View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.