Abstract
Structural dependence in the incidence matrix associated with a system of equations may be used to detect misspecification of the underlying system. The incidence matrix can be represented as a bipartite graph G=(X,Y,E), with the node sets partitioned into the sets X1, X2, Y1 en Y2, such that (a) there are no edges between X1 en Y2, and (b) the cardinality of X1+Y2 is maximum. Such a partition corresponds with the detection of complete and maximal complementary subsets of structually dependent rows and columns. This problem is equivalent to finding a maximum independent vertex set or a minimum edge cover in thebipartite graph under the assumption of no isolated vertices. The problem of finding minimal and complete subsets of structurally dependent rows or columns is shown to be NP-complete. A heuristic approach for the detection of these minimal subsets based on Hall's transversal algorithm has worked satisfactorily in practice.
Keywords
- Structural dependence
- structural rank
- structural nullity
- matching
- bipartite graph
- transversal
- system of distinct representatives
- incidence matrix
- NP-completeness
This is a preview of subscription content, access via your 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
Bisschop, J. and Meeraus, A., "On the Development of a General Algebraic Modeling System in a Strategic Planning Environment", Mathematical Programming Study, Vol. 20 (1982) pp. 1–29.
Bunch, J.R., and Rose, D.J., Sparse Matrix Computations, Academic Press Inc. (1976) pp. 275–280.
Brooke, A., Drud, A., and Meeraus, A., "Modeling Systems and Nonlinear Programming in a Research Environment", in: Computer in Engineering 1985 Volume Three, Edited by R. Raghaven and S.M. Rohde, The American Society of Mechanical Engineers (1985) pp. 213–219.
Drud, A., Grais, W., and Pyatt, G., "The Transaction Value Approach — A Systematic Method of Defining Economywide Models Based on Social Accounting Matrices", in: Dynamic Modelling and Control of National Economies 1983, T. Basar and L.F. Pau, eds., Pergamon Press, New York (1983) pp. 241–248.
Fourer, R., "Modeling Languages Versus Matrix Generators for Linear Programming", ACM Transactions on Mathematical Software, Vol 9, No 2 (1983) pp. 143–183.
Gary, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979.
Hall, P., "On Representatives of Subsets", Journal of the London Mathematical Society, 10 (1935) pp. 26–30.
Lawler E., Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
Pissanetzky, S., Sparse Matrix Technology, Academic Press, Inc., 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag
About this paper
Cite this paper
Bisschop, J., Dorhout, B., Drud, A. (1989). Structural dependence and systems of equations. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083466
Download citation
DOI: https://doi.org/10.1007/BFb0083466
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51797-9
Online ISBN: 978-3-540-46810-3
eBook Packages: Springer Book Archive
