Everything about Revised simplex method

🧭 Start here: a 6-step reading path

1. Read the overview: Revised simplex methodA 5-minute orientation
2. Skim a recent paper: Performance Optimization of a Steam Generator Level Control System via a Revised Simplex Search-Based Data-Driven Optimization MethodologyInfluential work since 2022
3. Pick up a classic book: Introduction to operations researchThe most-reprinted book on the subject
4. Read the landmark paper: Parallelizing the dual revised simplex methodCited 471 times
5. Go sideways: Linear programmingA closely related topic
6. Go sideways: Interior-point methodA closely related topic

🏆 Landmark papers (most cited)

• Parallelizing the dual revised simplex method

  Q. Huangfu, J. A. J. Hall · 2017 · Mathematical Programming Computation · 471 citations

• A revised simplex method for linear multiple objective programs

  J. P. Evans, R. E. Steuer · 1973 · Mathematical Programming · 206 citations

• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]

  Jan Weglarz, Jacek Blazewicz, Wojciech Cellary · 1977 · ACM Transactions on Mathematical Software · 46 citations

• Some new results in linear programs with trapezoidal fuzzy numbers: Finite convergence of the Ganesan and Veeramani’s method and a fuzzy revised simplex method

  A. Ebrahimnejad · 2011 · Applied Mathematical Modelling · 31 citations

• Hyper-Sparsity in the Revised Simplex Method and How to Exploit it

  J. A. J. Hall, K. I. M. McKinnon · 2005 · Computational Optimization and Applications · 28 citations

• Revised simplex method and its application for solving fuzzy linear programming problems

  S.H. Nasseri, H. Attari, A. Ebrahimnejad · 2012 · European J. of Industrial Engineering · 21 citations

• Efficient Revised Simplex Method for SVM Training

  C. Sentelle, G. C. Anagnostopoulos, M. Georgiopoulos · 2011 · IEEE Transactions on Neural Networks · 18 citations

• A Revised Simplex Method for Quadratic Programming

  M. H. Rusin · 1971 · SIAM Journal on Applied Mathematics · 14 citations

🆕 Influential since 2022

• Performance Optimization of a Steam Generator Level Control System via a Revised Simplex Search-Based Data-Driven Optimization Methodology

  Xiangsong Kong, Changqing Shi, Hang Liu · 2022 · Processes · 11 citations

• Solving Linear Fractional Programming Problems Via Revised Simplex Method

  · 2024 · Eurasian Journal of Science and Engineering · 0 citations

• Revised simplex method: An alternative solver to the out-of-kilter method for water balance model decision support system

  S M Ngoepe, P O Oviroh, T C Jen · 2026 · Journal of the South African Institution of Civil Engineering · 0 citations

📚 Books worth reading

• Introduction to operations researchFrederick S. Hillier · 1967
• 📕Computational algorithm of the revised simplex method ...George B. Dantzig · 1953
• 📕Background, development, and extensions of the revised simplex methodW. Orchard-Hays · 1955
• La recherche opérationnelle par l’exempleHervé Coilland · 2013
• Linear ProgrammingJames E. Calvert, William L. Voxman · 1989
• Linear optimization in applicationsS. L. Tang · 1999
• The Gale encyclopedia of childhood & adolescenceJerome Kagan, Susan B. Gall · 1998
• Diesel engine maintenance training manual, U.S. Navy. February, 1946United States. Navy Dept. Bureau of Ships. · 1946

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• 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…
• Interior-point method Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs…
• Linear complementarity problem In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known…
• Sequential quadratic programming Sequential quadratic programming (SQP) is an iterative method for constrained nonlinear optimization, also known as Lagrange-Newton method. SQP methods…
• Quadratic programming Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks…
• Mehrotra predictor–corrector method Mehrotra's predictor–corrector method in optimization is a specific interior point method for linear programming. It was proposed in 1989 by Sanjay Mehrotra…
• 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…
• Karush–Kuhn–Tucker conditions In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes…