Variations in the efficiency of a mathematical programming solver according to the order of the constraints in the model
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2099/7046
Tipus de documentArticle
Data publicació2008-12
EditorSchool of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-CompartirIgual 3.0 Espanya
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
CitacióPastor, R. Variations in the efficiency of a mathematical programming solver according to the order of the constraints in the model. Journal of Industrial Engineering and Management, 2008, v.1, n.2, p. 4-15
Dipòsit legalDL: B-28744-2008
ISSN2013-0953
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
pastor.pdf | 734,4Kb | Visualitza/Obre |