Abstract
One of the most important problems in the polynomial class is checking the satisfiabilityof systems of linear inequalities over the rationals. In this paper, we investigate the phase-transition behavior of this problem by adopting a methodology which has been proved very successful on NP-complete problems. The methodology is based on the concept of constrainedness, which characterizes an ensemble of randomly generated problems and allows to predict the location of the phase transition in solving such problems. Our work complements and confirms previous results obtained for other polynomial problems. The approach provides a new characterization of the performance of the Phase I of the Simplex algorithm and allows us to predict its behavior on very large instances by exploiting the technique of finite size scaling.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Bollobas, C. Borgs, J. Chayes, J. Kim, and D. Wilson. The scaling window of the 2-sat transition. Technical report, Microsoft Research, 1999.
Michel Berkelaar. LP Solve 3.2. Available at the URL: ftp://ftp.es.ele.tue.nl/pub/lp_solve/.
R.S. Boyer and J S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Studyof Linear Arithmetic. Machine Intelligence, 11:83–124, 1988.
Vavšek Chvátal. Linear Programming. W. H. Freeman and Company, New York, 1983.
G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963.
I. P. Gent, E. MacIntyre, P. Prosser, and P. Shaw. The constrainedness of arc consistency. Lecture Notes in Computer Science, 1330:327–340, 1997.
I. P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. Scaling effiects in the CSP phase transition. Lecture Notes in Computer Science, 976:70–87, 1995.
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, and Toby Walsh. The constrainedness of search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 246–252, Menlo Park, August 4-8 1996. AAAI Press / MIT Press.
S. A. Grant and B. M. Smith. The arc and path consistencyphase transitions. Lecture Notes in Computer Science, 1118:541–542, 1996.
T. A. Henzinger, P-H. Ho, and H. Wong-Toi. HYTECH: A model checker for hybrid systems. In Proc. 9th International Computer Aided Verification Conference, pages 460–463, 1997.
Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. TOPLAS, 14(3):339–395, July1992.
S. Kirkpatrick and B. Selman. Critical behavior in the satisfiability of random boolean expressions. Science, 264:1297–1301, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armando, A., Peccia, F., Ranise, S. (2001). The Phase Transition of the Linear Inequalities Problem. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_29
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive