Originally posted by: SystemAdmin
[prubin said:]
[quote author=malak link=topic=864.msg2547#msg2547 date=1232639845]
Just a general question about MP solvers. What does the number of iterations performed by the solver to solve a problem indicate about the problem charectaristics? I mean does a larger number of iterations say anything about the memory used or the complexity of the problem in hand ?
Not necessarily. For MIPs, memory use usually increases with execution time (you're piling up live nodes in the search tree). On the other hand, if you tell the solver to go depth-first, you'll tend to experience longer execution times than you would with a best-bound search, but you'll use a lot less memory (since only nodes along a single dive through the tree are live at any given time).
I'm not sure there's much to be inferred from execution time on a single instance of a problem, other than how lucky you are. :-)
/Paul
#DecisionOptimization#MathematicalProgramming-General