MOPS

MOPS – Mathematical optimization system. This paper discusses a software system for solving large scale linear and mixed-integer optimization models. The system in its present form is the result of several years of research and development. The first functional version of MOPS was completed 1987 for the IBM 6150 (a predecessor of the RS/6000) under AIX. A benchmark model from the Petroleum industry with 5563 rows and 6181 columns was solved with MOPS in 5 hours. The newest version solves this model in 6.51 minutes on a MS-DOS PC with i80486 processor (25 Mhz). This paper discusses only LP optimization. The MIP optimizer in MOPS is a prototype version which will undergo major changes in the future. We describe algorithmic aspects, implementation issues and numerical results on Netlib and other real-life LP models. Sophisticated LP optimizers — although simple from a mathematical point of view — are algorithmically very complex. The discussion is therefore limited to a few fundamental issues that we feel are important.


References in zbMATH (referenced in 18 articles , 1 standard article )

Showing results 1 to 18 of 18.
Sorted by year (citations)

  1. Wesselmann, Franz; Koberstein, Achim; Suhl, Uwe H.: Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (2011)
  2. Wiese, Jörg; Suhl, Leena; Kliewer, Natalia: Mathematical models and solution methods for optimal container terminal yard layouts (2010)
  3. Kliewer, Natalia; Gintner, Vitali; Suhl, Leena: Line change considerations within a time-space network based multi-depot bus scheduling model (2008)
  4. Koberstein, Achim: Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (2008)
  5. Koberstein, Achim; Suhl, Uwe H.: Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (2007)
  6. Guo, Yufeng; Mellouli, Taïeb; Suhl, Leena; Thiel, Markus P.: A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases (2006)
  7. Kliewer, Natalia; Mellouli, Taïeb; Suhl, Leena: A time-space network based exact optimization model for multi-depot bus scheduling (2006)
  8. Mellouli, Taïeb: A network flow approach to crew scheduling based on an analogy to an aircraft/train maintenance routing problem (2001)
  9. Jünger, Michael; Thienel, Stefan: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (2000)
  10. Meyr, H.: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (2000)
  11. Fletcher, R.: Block triangular orderings and factors for sparse matrices in LP (1998)
  12. Fletcher, Roger: A new degeneracy method and steepest-edge-based conditioning for LP (1998)
  13. Mathies, S.; Mevert, P.: A hybrid algorithm for solving network flow problems with side constraints. (1998)
  14. Ye, Yinyu: Interior point algorithms. Theory and analysis (1997)
  15. Andersen, Erling D.; Gondzio, Jacek; Mészáros, Csaba; Xu, Xiaojie: Implementation of interior-point methods for large scale linear programs (1996)
  16. Suhl, Uwe H.: MOPS -- Mathematical optimization system (1994)
  17. Suhl, Uwe H.; Szymanski, Ralf: Supernode processing of mixed-integer models (1994)
  18. Suhl, Leena M.; Suhl, Uwe H.: A fast LU update for linear programming (1993)