On the Complexity of Minos Package for Linear Programming1

Neculai Andrei

Abstract

Using the numerical computational evidence of the MINOS package, for a number of linear programming problems of NETLIB

collection, into an empirical study refe1Ting to the number of iterations, we conjecture its quasi-linear complexity. Empirically we conjecture that the number of iterations of MINOS, for solving linear programming problems with m constraints and n variables, is quasi-linear in m + n .

Keywords

View full article