• fminsearch

  • Referenced in 183 articles [sw07467]
  • Convergence properties of the Nelder--Mead simplex method in low dimensions The Nelder--Mead simplex...
  • GLPK

  • Referenced in 144 articles [sw04560]
  • following main components: primal and dual simplex methods, primal-dual interior-point method, branch...
  • OSL

  • Referenced in 95 articles [sw09295]
  • different computational kernels than the traditional simplex method. In particular, the matrices we must deal ... considerably denser than those assumed in simplex implementations. Severe rank deficiency must also be accommodated ... machine architectural features. In particular, interior methods can benefit greatly from use of vector architectures...
  • DEVEX

  • Referenced in 96 articles [sw08378]
  • code. Pivot column and row selection methods used by the Devex code since ... iteration advantages over the standard simplex methods used today. The final illustration highlights why these...
  • lp_solve

  • Referenced in 63 articles [sw04006]
  • programming solver based on the revised simplex method and the Branch-and-bound method...
  • subplex

  • Referenced in 19 articles [sw04818]
  • SUBPLEX is a subspace-searching simplex method for the unconstrained optimization of general multivariate functions ... Like the Nelder-Mead simplex method it generalizes, the subplex method is well suited ... much more efficient than the simplex method. It can be used like the Matlab fminsearch...
  • WinGULF

  • Referenced in 14 articles [sw19224]
  • assist students to understand principals of simplex method and branch-and-bound algorithm in linear ... problem using simplex method, the package may be used to check correctness of your interim ... special extended version of primal simplex method developed by B.Martos[1] with various pivoting rules...
  • PipLib

  • Referenced in 19 articles [sw23763]
  • algorithm followed by the parameterized dual simplex method. The PIP Library (PipLib for short...
  • PARSMI

  • Referenced in 7 articles [sw22139]
  • linear programming problems using the revised simplex method, two common variants are the incorporation ... minor iterations of the standard simplex method applied to a small subset of the variables ... which computational components of the revised simplex method with Devex pricing are either overlapped...
  • ASYNPLEX

  • Referenced in 8 articles [sw02174]
  • asynchronous variant of the revised simplex method which is suitable for parallel implementation ... with fast inter-processor communication. The method overlaps simplex iterations on different processors. Candidates...
  • Algorithm 520

  • Referenced in 8 articles [sw25818]
  • Algorithm 520. An automatic revised simplex method for constrained resource network scheduling [H]. Subroutine ARSME...
  • MarPlex

  • Referenced in 21 articles [sw06750]
  • starting point in the simplex algorithm. Three different methods for finding a basic feasible solution ... test examples. We show that our two methods on the Netlib test problems have better ... number of iterations required by the simplex algorithm to find the optimal solution...
  • EVPI

  • Referenced in 17 articles [sw02644]
  • these dynamic problems, including the simplex and interior-point methods and nested Benders decomposition, which...
  • XA

  • Referenced in 6 articles [sw21986]
  • solving linear problems. The primal/dual simplex method is very robust, and in most cases...
  • SYNPLEX

  • Referenced in 2 articles [sw22140]
  • task-parallel scheme for the revised simplex method. .. This presentation will describe SYNPLEX, a task ... parallel scheme for the revised simplex method. SYNPLEX eliminates the numerical instability of the schemes...
  • neldermead

  • Referenced in 1 article [sw23545]
  • search optimization algorithms based on the simplex method. The provided algorithms are direct search algorithms ... algorithms are available: the fixed shape simplex method of Spendley, Hext and Himsworth (unconstrained optimization ... fixed shape simplex), the variable shape simplex method of Nelder and Mead (unconstrained optimization with ... variable shape simplex made), and Box’s complex method (constrained optimization with a variable shape...
  • LUMOD

  • Referenced in 2 articles [sw12658]
  • Suitable as basis package for dense simplex method, or for updating sparse factorizations...
  • FELICITY

  • Referenced in 5 articles [sw12294]
  • discretized by a finite element method on unstructured simplex grids. It uses a Domain-Specific...
  • CyLP

  • Referenced in 1 article [sw24590]
  • solvers with python. Implementations of the simplex method differ mostly in specific aspects such ... pivot rule. Similarly, most relaxation methods for mixed-integer programming differ mostly in the type ... dual pivot rules for the simplex method, by building upon COIN-OR’s open-source...