Live briefing
Everything about Simplex algorithm
Algorithm for linear programming
In mathematical optimization, Dantzig's simplex algorithm is an algorithm for linear programming. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Simplex algorithmA 5-minute orientation
- Skim a recent paper: Super‐evolutionary mechanism and Nelder‐Mead simplex enhanced salp swarm algorithm for photovoltaic model parameter estimationInfluential work since 2022
- Pick up a classic book: The network simplex algorithmThe most-reprinted book on the subject
- Read the landmark paper: A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum LikelihoodCited 14,680 times
- Go sideways: Basic feasible solutionA closely related topic
- Go sideways: Bland's ruleA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
A practicable steepest-edge simplex algorithm
Cycling in the dual simplex algorithm
The Composite Simplex Algorithm
A numerically stable form of the simplex algorithm
Minimizing multimodal functions by simplex coding genetic algorithm
A continuous‐time network simplex algorithm
A generalized dual phase-2 simplex algorithm
🆕 Influential since 2022
Super‐evolutionary mechanism and Nelder‐Mead simplex enhanced salp swarm algorithm for photovoltaic model parameter estimation
Experimental optimization during epoxidation of a high-oleic palm oil using a simplex algorithm
Accelerated Control Using Stochastic Dual Simplex Algorithm and Genetic Filter for Drone Application
Fuel cell parameter analysis and constraint optimization based on Nelder-Mead simplex algorithm considering performance degradation
Gradient pyramid mechanism and Nelder-Mead simplex enhanced Colony Predation Algorithm for optimal power flow problems
📚 Books worth reading
- 📕The network simplex algorithmSheng-Roan Kai · 1987
Linear programmingHoward Karloff · 1991
Linear optimizationGlenn H. Hurlbert · 2010
La programmation linéaire dans les modèles de productionJean-Marc Boussard · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Basic feasible solution In the theory of linear programming, a basic feasible solution (BFS) is a solution with a minimal set of non-zero variables. Geometrically, each BFS corresponds…
- Bland's rule In mathematical optimization, Bland's rule (also known as Bland's algorithm, Bland's anti-cycling rule or Bland's pivot rule) is an algorithmic refinement…
- Dual linear program The dual of a given linear program (LP) is another LP that is derived from the original (the primal) LP in the following schematic way: Each variable in…
- Criss-cross algorithm In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm…
- Linear-fractional programming In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear…
- Linear programming Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical…
- Cutting-plane method In mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective…
- Klee–Minty cube The Klee–Minty cube or Klee–Minty polytope (named after Victor Klee and George J. Minty) is a unit hypercube of variable dimension whose corners have been…