Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/188370
Authors: 
Pastor, Rafael
Year of Publication: 
2008
Citation: 
[Journal:] Journal of Industrial Engineering and Management (JIEM) [ISSN:] 2013-0953 [Volume:] 1 [Year:] 2008 [Issue:] 2 [Pages:] 4-15
Abstract: 
It is well-known that the efficiency of mixed integer linear mathematical programming depends on the model (formulation) used. With the same mathematical programming solver, a given problem can be solved in a brief calculation time using one model but requires a long calculation time using another. In this paper a new, unexpected feature to be taken into account is presented: the order of the constraints in the model can change the calculation time of the solver considerably. For a test problem, the Response Time Variability Problem (RTVP), it is shown that the ILOG CPLEX 9.0 optimizer returns a ratio of 17.47 between the maximum and the minimum calculations time necessary to solve optimally 20 instances of the RTVP, according to the order of the constraints in the model. It is shown that the efficiency of the mixed integer linear mathematical programming depends not only on the model (formulation) used, but also on how the information is introduced into the solver.
Subjects: 
mixed integer linear mathematical programming
response time variability problem
combinatorial optimization
Persistent Identifier of the first edition: 
Creative Commons License: 
https://creativecommons.org/licenses/by-nc/3.0/
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.