Abstract
For most of the programming problems, there may exist several mathematical models which vary in the number of variables and constraints, but they still show a formulation of a specific problem. For example, in Öncan et al. (2009), more than 10 different formulations are presented for the traveling salesman problem (TSP). Different models of a given problem are expected to be different in the formulation, but they agree with the optimal solution. The main question, arising here, is that which model is better when more than one model exists for a given problem? The response to this question is strongly related to the solution method used to solve the problem and determining the optimal solution. In other words, the better the formulation, the faster the way to get the optimal solution. This chapter addresses the qualitative coparison of models, discusses the impact of the number of variables and constraints on the quality of models and introduces the ideal formulation. Then, some techniques of improving formulations are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Constraint logic programming system.
- 2.
Optimization programming language.
References
Adams WP, Sherali HD. A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems. Ann Oper Res 2005;140(1):21–47.
Balas E. Logical constraints as cardinality rules: tight representation. J Comb Optim 2004;8:115–128.
Bertsimas D, Tsitsiklis JN. Introduction to linear optimization. Athena Scientific;Belmont, MA 1997.
Cheadle AM, Harvey W, Sadler AJ, Schimpf J, Shen K, Wallace MG. ECLiPSe: a tutorial introduction. London: Technical Report IC-Parc-03-1 IC-Parc Imperial College; 2003.
Chen DS, Batson RG, Dang Y. Applied integer programming: modeling and solution. Wiley;Hoboken, NJ 2010.
Chinneck JW. Feasibility and infeasibility in optimization. Springer;New York 2007.
Gleeson J, Ryan J. Identifying minimally infeasible subsystems of inequalities. INFORMS J Comput 1990;2(1):61–63.
Hooker J. Logic-based methods for optimization: combining optimization and constraint satisfaction. Wiley;New York 2000.
Hooker JN. Integrated methods for optimization.New York Springer; 2012.
IBM. IBM ILOG CPLEX 12.4 user’s manual. http://www.ilog.com/products/cplex; 2011.
Klotz E, Newman AM. Practical guidelines for solving difficult mixed integer linear programs. Surv Oper Res Manag Sci 2013;18(1–2):18–32.
MirHassani SA, Mirhadi SM, Rahmani A. A computational approach to convex hull of zero-one MIP problems with special structure. J Inf Optim Sci 2015a;36(3):197–230.
MirHassani SA, Raeisi S, Rahmani A. Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems. Optim Methods Softw 2015b;30(4):756–768.
Öncan T, Altınel IK, Laporte G. A comparative analysis of several asymmetric traveling salesman problem formulations. Comput Oper Res 2009;36(3):637–654.
Sherali HD, Adams WP. A reformulation-linearization technique for solving discrete and continuous nonconvex problems.New York Springer; 1999.
Sherali HD, Adams WP, Driscoll PJ. Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Oper Res 1998;46(3): 396–405.
Taha HA. Integer programming: theory, applications, and computations. Academic;Cambridge, MA 1975.
Van Hentenryck P. The OPL optimization programming language. Cambridge: MIT Press; 1999.
Van Hoeve WJ. The all different constraint: a survey. In: Sixth annual workshop of the ERCIM working group on constraints; 2001.
Williams HP. Logic and integer programming. Springer;New York 2009.
Williams HP. Model building in mathematical programming. Wiley;Hoboken, NJ 2013.
Wolsey LA. Integer programming.New York Wiley; 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
MirHassani, S.A., Hooshmand, F. (2019). Qualitative Comparison of Models. In: Methods and Models in Mathematical Programming. Springer, Cham. https://doi.org/10.1007/978-3-030-27045-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-27045-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27044-5
Online ISBN: 978-3-030-27045-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)