Using the numerical computational evidence of the MINOS package, for a number of linear programming problems of NETLIB collection, into an empirical study referring 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 .
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).