• Lightning-fast speed and stable performance
• No limits on number of variables or constraints
• Variety of algorithms (e.g., Newton Barrier, Simplex, Cross-over)

• Efficient and practical heuristic searches
• Easy-to-use customization parameters
• Quick warm-starts for scenario analysis

• Speedy quadratic optimization
• Flexible user subroutines for convex functions
• Global optimization capabilities

Latest version of SOPT

A new version SOPT 4.0 has been released on March 30, 2007. With this version, we can now retrieve multiple number of integer solutions from the SOPT data structure. Or users can use one of the SOPT output files is a CSV file, which stores multiple number of integer solutions found in the SOPT search program. It is a practical and convenicent way to identify the best solution for your application, when the best objective value may not automatically imply the best solution. A release note for SOPT 4.0 is available from here SOPT4.0.

Previously we introduced a new search algorithm in version 3.4. This extended search algorithm uses cutting planes and sub LP solutions, and it tries to find better integer solutions by moving away from local optimals. 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 includes GUI improvement such as displaying LP and IP solution performance.