Then, the general nonlinear solver intelligently selects a subset of these to initialize a series of local optimizations. This intelligently generates a set of candidate starting points in the solution space. When limited time makes searching for the global optimum prohibitive, the multistart solver can be a powerful tool for finding good solutions more quickly.
#Solver for excel license
The nonlinear and global license options are required to utilize the global optmization capabilities. Then, it uses the branch-and-bound technique to exhaustively search over these subproblems for the global solution. The global solver converts the original non-convex, nonlinear problem into several convex, linear subproblems. Rather than stopping after the first local optimum is found, the global solver will search until the global optimum is confirmed. If the model is non-convex, other local optima may exist that yield significantly better solutions. Local search solvers are generally designed to search only until they have identified a local optimum. The Nonlinear license option is required to solve nonlinear models. The nonlinear solver takes advantage of sparsity for improved speed and more efficient memory usage. However, to help get a good feasible solution quickly, What's Best! also incorporates Successive Linear Programming (SLP).
What's Best! includes a number of ways to find locally or globally optimal solutions to nonlinear models.įor nonlinear programming models, the primary underlying technique used by What's Best's optional nonlinear solver is based upon a Generalized Reduction Gradient (GRG) algorithm. For linear models, the integer solver does extensive preprocessing and adds constraint "cuts" of several different varieties to greatly improve solution times on large classes of integer models. Depending upon the size and structure of a particular model, the Barrier solver may be significantly faster than the Simplex solvers and can provide exceptional speed on large linear models - particularly on sparse models with more than 5,000 constraints or highly degenerate models.įor models with general and binary integer restrictions, What's Best! includes an integer solver that works in conjunction with the linear and nonlinear solvers. Unlike the Simplex solvers that move along the exterior of the feasible region, the Barrier solver moves through the interior space to find the optimum. The Barrier option utilizes a barrier or interior point method to solve linear models. The optional Barrier solver provides an alternative means of solving linear models. The solver dynamically chooses the best pricing option based upon problem characteristics. Pricing options, for instance, include partial pricing and Devex. The base version includes the Primal and Dual Simplex solvers, which incorporate numerous enhancements for maximum speed and robustness. What's Best! is available with three state of the art solvers for linear models. What's Best! is able to solve complex and numerically difficult problems that competing products simply cannot. Reliabilityĭay in and day out, thousands of companies around the world rely on What's Best! to provide critical solutions to their toughest optimization problems. What's Best! users routinely solve models of well over 100,000 variables. While competing spreadsheet solvers boast of "industrial strength" versions handling LP models of up to 2,000 variables, the largest version of What's Best! has no capacity limit. Its commercial quality Linear Programming solver combines with superior Integer Programming technology to set a new standard in optimization speed. When it comes to speed, What's Best! outperforms stand alone solvers, much less any competing spreadsheet solver. The internal linear, nonlinear and integer solvers utilize state-of-the-art techniques, and our dedication to ongoing development will ensure their continued superiority. What's Best! offers unmatched solution speed, capacity and reliability.
0 kommentar(er)
