Smart Optimizer
SOPT
is an efficient optimizer for linear, integer, and nonlinear programs. It
offers a variety of new and fast algorithms and application capabilities for
industrial decision support systems. Based on breakthrough technologies in math
programming, SOPT solves problems with lightning speed and robustness.
Highlights
Currently SOPT has three versions, SOPT-CP for linear and nonlienar programs,
SOPT-IP for linear and integer programs, and SOPT-SP (SOPT-IP and AMPL).
Each module has practical implementation of unique algorithms, which may help
your solution development to solve complex decision problems.
For Linear Programs:
-
Lightning-fast speed and stable performance
-
No limits on number of variables or constraints
-
Variety of algorithms (e.g., Newton Barrier, Simplex, Cross-over)
|
For Integer Programs:
-
Efficient and practical heuristic searches
-
Easy-to-use customization parameters
-
Quick warm-starts for scenario analysis
|
For Nonlinear Programs:
-
Speedy quadratic optimization
-
Flexible user subroutines for convex functions
-
Global optimization capabilities
|
|
Supported Plaforms:
 
SOPT can be used stand-alone, or as a subroutine library or DLL.
Latest version of SOPT
A new version SOPT 4.2 will be released on August 25. With theis release, SOPT creates a dynamic
optimization log with information on incumbent solution values and elasped times so that users can access the ongoing optmization
status even when SOPT is still solving the problem. This feature is particularly useful for online applications such
as SaaS appliacations.
Recent releases include such features as retrieval of multiple integer solutions from the SOPT data structure, and various
solutions files in the CSV format. Choosing one of multiple near-optiomal solutions is a practical and convenicent way
to identify the best solution for your application, when the best objective value may not mean the best solution.
Recent release note for SOPT is available from here
SOPT Release Note.
Previously we introduced a new search algorithm in version 3. This extended search algorithm uses
cutting planes and sub LP solutions, and it tries to find better integer solutions by moving away from local optima.
It has been applied to difficult combinatorial problems, such as set covering and TSP problems, which are often found
in scheduling and routing applications. The last version also included GUI improvement such as displaying LP and IP
solution performance.
Evaluation Software for Windows
Click here for SOPT
demonstration software (Note that you need to have the
Visual Basic Runtime to use the demo.)
Purchasing SOPT
If you would like to purchase SOPT, please download the
SOPT order form, and fax it to us with your signature. Upon receiving
your order form, we will send you the software. Note that the software
installation requires that you agree with the license contract. You can
download the license agreement by clicking
SOPT License Agreement. For academic institutions, special prices are available; see the SOPT order form for detail.
For commercial VAR application developers, a special version is avaialbe for
SOPT DLL distribution. For business user licensing, please get in touch with us.
|