Several optimization solvers have improved their performance over that of SAS/OR 13.2 as follows:
The interior point linear programming (LP) solver is 30% faster.
The branch-and-cut mixed integer linear programming (MILP) solver is 35% faster.
When METHOD=AUTO (the default setting), the decomposition (DECOMP) algorithm is 130% faster in finding an optimal MILP solution and 240% faster in finding a solution with a 5% optimality gap.
The active set algorithm in the nonlinear programming (NLP) solver is 4% faster for the entire test suite and 10% faster for the more difficult problems in the test suite.