LINDO's linear, nonlinear and integer programming solvers have been used by thousands of companies worldwide to maximise profit and minimise cost on decisions involving production planning, transportation, finance, portfolio allocation, capital budgeting, blending, scheduling, inventory, resource allocation and more.

Editions

Click on the Edition to see more information and pricing

LINDO API 12.0

#
#

LINDO API 12.0

Release 12 of LINDO API includes a wide range of performance enhancements and new features.

Better Performance on Linear Models with Improved Simplex Solvers
Enhancements to the Simplex solvers boost speed on linear models. Models solve an average of 18% faster using primal simplex and 15% faster for dual simplex.

Significantly Faster on Large Quadratic Models
Improvements in handling large quadratic matrices, e.g. 1000 x 1000, provide substantial performance improvement solving financial portfolio and other quadratic models.

Improved Handling of Models with Discontinuous Functions
Models that use discontinuous functions such as MOD(x,k), INT(x), ROUND(x), can be solved more quickly.

Faster When Simultaneously Solving LPs Using Different Solvers
In situations in which it may be difficult to predict whether the Primal, Dual or Barrier Solver will provide the fastest solution to a linear model, an improved Multi-Core feature allows you to assign each solver to a separate core and run them concurrently. So, you are ensured the solution in the shortest time regardless of which solver is fastest.

Multi-Start NLP Solver Now Supports a Target Value
Users can specify a target value for the objective function. As soon as any multi-start thread achieves a specified target all threads stop.

New Engineering Design Functions Added
Support has been added for new arithmetic functions, SIGNPOWER, LMTD, RLMTD, that can be useful in various engineering design, e.g., nonlinear network and heat exchanger models.

Addons

Click on the Addon to see more information and pricing

Global Option

#
#

Global Option

Local search solvers are generally designed to search only until they have identified a local optimum.
If the model is non-convex, other local optima may exist that yield significantly better solutions. Rather than stopping after the first local optimum is found, the Global solver will search until the global optimum is confirmed. The Global solver converts the original non-convex, nonlinear problem into several convex, linear subproblems. Then, it uses the branch-and-bound technique to exhaustively search over these subproblems for the global solution. The Nonlinear and Global license options are required to utilize the global optimization capabilities.

Nonlinear Option

#
#

Nonlinear Option

LINDO API is the first full-featured callable solver to offer general nonlinear capabilities. LINDO API includes a number of ways to find locally or globally optimal solutions to nonlinear models.
For nonlinear programming models, the primary underlying technique used by LINDO API's optional nonlinear solver is based upon a Generalized Reduced Gradient (GRG) algorithm. However, to help get to a good feasible solution quickly, LINDO API also incorporates Successive Linear Programming (SLP). The nonlinear solver takes advantage of sparsity for improved speed and more efficient memory usage. The Nonlinear license option is required to solve nonlinear models.