E-mail this page
Request WebMeeting
XPRESS Solver for Linear and Mixed Integer Programming
The XPRESS solver is a high-performance Linear Programming (LP) and Mixed Integer Programming (MIP) solver. XPRESS can also be used to solve Quadratic Program (QP) and Mixed Integer Quadratic Program (MIQP) problems.
XPRESS features three Optimization algorithms:
- The simplex optimizer, which includes primal and dual methods, solves Linear Programming problems, and is also used within a branch-and-bound framework to solve Mixed Integer Programming and Mixed Integer Quadratic Programming problems.
- The Newton barrier optimizer is an interior point method for solving Linear Programming and Quadratic Programming problems. XPRESS uses efficient sparse matrix handling. A presolve procedure reduces the size of the problem before it is solved, sometimes by an order of magnitude. Solver XPRESS is also noted for its ability to solve numerically hard or unstable problems.
- The Mixed Integer Programming and Mixed Integer Quadratic Programming optimizer uses a sophisticated branch-and-bound algorithm to solve Mixed Integer Programming and Mixed Integer Quadratic Programming problems, and it can find high quality solutions fast. XPRESS uses modern features like cutting planes and heuristics to find integer solutions.
About XPRESS
XPRESS is developed and supported by FICO. XPRESS is a registered trademark of FICO (Fair Isaac Corporation).”
XPRESS solver supported Versions
AIMMS supports the solver links only for XPRESS 15 - 19.
Try XPRESS in AIMMS
In case you have your own XPRESS license, you can get a free license to try XPRESS as the Linear and Mixed Integer Programming solver in AIMMS.
