Abstract
When considering how to employ a computer for modeling and analysis, there is a tendency to limit the scope to database management and the appropriate solution procedures. Another function, surprisingly neglected, is model management. Clearly, there are functional requirements of model management directly related to database management, such as:
-
Language design;
-
File organization;
-
Query and reporting components; and,
-
Aides for analysis.
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
Preview
Unable to display preview. Download preview PDF.
Annotated Bibliography
R. L. Basmann (1963), “The Causal Interpretation of Non-Triangular Systems of Economic Relations,” Econometrica 31, 3, pp. 439–448. This paper takes issue with Wold’s assertion that causal models are synonomous with triangular systerns. Causal interpretation of non-triangular systems—that is, matricial forms—is given. A reply by Strotz and Wold follows (pp. 449–450), then a rejoiner by Basmann (pp. 451–453).
R. E. Bixby and W. H. Cunningham (1979), “Converting Linear Programs to Network Problems,” Tech. Rept., Northwestern University, also to appear, Math, of Or. This paper describes an algorithm to use elementary row operations to transform a linear program to a network formulation, when possible. Cast in matroid terms, the algorithm also detects when their transformation fails to completely change the formulation; as such, their approach can be extended to search for a maximal embedded network.
G. Bradley, G. Brown, and G. Graves (1977), “Design and Implementation of Large Scale Primal Transshipment Algorithms,” Mgt. Sci. 24, pp. 1–35. This is an anatomy of a system, developed by the authors, to solve network problems. Of particular interest is the lucid tutorial on applying computer science techniques, notably the information structure design.
C. W. Churchman (1971), The Design of Inquiring Systems, Basic, New York. This book attempts to form a theory—actually, a philosophy—about knowledge, which the author intertwines with inquiry. ( An inquiry is an activity that produces knowledge.) He says, “Knowledge can be considered as a collection of information.” The orientation is not on how to design an inquiring system (see Sundgren), but on “design behavior.”
E. F. Codd (1970), “A Relational Model of Data for Large Shared Data Banks,” Comm. Acm. 13, 6, pp. 377–387. This is the pioneering paper that introduces a rigorous notion of database theory, stemming from relations among data items.
G. B. Dantzig (1963), Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey. This is a basic text by the inventor of the simplex method and pioneer of linear programming applications.
A. L. Dulmage and N. S. Mendelsohn (1967), “Graphs and Matrices,” in Graph Theory and Theoretical Physics, F. Harary (ed.), Academic Press, New York, pp. 167–227. This chapter contains a tutorial on graphs and matrices, with focus on non-negative matrices. Of particular interest is the canonical decomposition of a bipartite graph, which refers to the reducibility used by Quirk and Maybee; it also relates to rearranging a square matrix to block diagonal form.
D. H. Fishman (1974), “Experiments with a Deductive Question-Answering System,” TR 74C-10, Computer & Information Science Dept., Univ. Mass., Amherst, Mass. This reports on the use of a system developed by the author, using the concepts published by J. Minker (1978).
A. M. Geoffrion (1976), “The Purpose of Mathematical Programming Is Insight, Not Numbers,” Interfaces 7, 1, 81–92. The author describes a simple approach, which is embodied by diagnostic analysis, towards a strategy of analyzing the meaning of a mathematical programming solution. He uses an application for facility location to illustrate his approach. Of particular interest is his use of an “auxiliary model” designed to be less “complex” (that is, easier to understand).
F. Glover and D. Klingman (1978), “Modeling and Solving Network Problems,” Design and Implementation of Optimization Software, H. J. Greenberg, Ed., Sijthoff & Noordhoff, The Netherlands, pp. 185–224. This summarizes the use of “netforms” for modeling and communication plus the new, powerful software developed by the authors. Their bibliography refers to their previous papers as well as related works of others.
W. M Gorman (1964), “A Wider Scope for Qualitative Economics,” Review of Economic Studies XXXI, 1, pp. 99–123. This paper is an early extension of Lancaster’s pioneering work (1962), formalizing “qualitative calculus.”
H. J. Greenberg (1979), “A New Approach to Analyze Information Contained in a Model,” NBS/DOE Workshop on Energy Model Validation and Assessment, held in 1978 at the National Bureau of Standards. This paper introduces the analysis of matricial forms and a unifying framework of diagnostic analysis.
H. J. Greenberg (1979), “Measuring Complementarity and Qualitative Determinacy in Matricial Forms,” EIA Technical Report, TR/OA/79-xxx, Washington, DC. A general framework is described to capture structural information in a model represented with a matricial accounting structure. A measure of economic correlation is introduced; it is intended to capture the dependency of one variable on another. Qualitative dependence is defined by an induced ordinal measure according to the sign of the economic correlation. This includes a measure of comple-mentarity—that is, movement in the same direction. Problems of qualitative determinacy are then described with results for certain problem classes. The basic mathematical background is graph theory.
J. Greenberg (1979), Information Structures for Matricial Forms: A Focus On Computer-Assisted Analysis and Reporting Functions,1 EIA Technical Report, TR/OA/79-xxx, Washington, DC. This contains a comprehensive design and analysis of an information structure to represent a large, matricial form. This includes fundamental algorithms, and the design is shown to be frugal with time and space to answer queries associated with diagnostic analysis and reporting.
H. J. Greenberg and D. C. Rarick (1977), “Determining GUB Sets Via An Invert Agenda Algorithm,” Math. Prog. 7, 240 - 244. This paper shows the relation between the “min-spike” problem—that is, a rearrangement that is “nearly” triangular —and the “max-GUB” problem—that is, finding a maximal grouping of disjoint rows. The primary result is the concept of an incidence matrix that reflects the problem definitions (see, also, Gunawdane and Schräge ).
G. Gunawardane and L. Schräge (1977), “Identification of Special Structure Constraints in Linear Programs,” Unpublished. This report extends the use of a min-spike procedure to identify special structures, including GVUB and networks, by defining an appropriate incidence matrix.
F. Harary, R. Z. Norman, and D. Cartwright (1965), Structured Models: An Introduction to Theory of Directed Graphs, John Wiley & Sons, New York. This is the pioneering text, based upon the authors’ earlier works, that studies digraphs as a modeling technique. The chapters are intentionally simple to reach a nonmathematician; however, there are many theorems to describe graph properties and associated characteristics of structured models.
E. Hellerman and D. C. Rarick (1971), “Reinversion With the Pre-assigned Pivot Procedure,” Math. Prog. 1, 195–216. This introduces the meaning of spikes in a rearrangement of the basis, which is designed to triangularize, if possible. When triangularization is not possible, forward and backward triangles are determined. A heuristic (P3) is applied to the remainder of the basis, called the kernal,1 oriented towards minimizing the number of spikes in the final rearrangement.
E. Hellerman and D. C. Rarick (1972), “The Partitioned Preassigned Pivot Procedure (P4),” in Sparse Matrices and their Applications, D. J. Rose and R. A. Willoughby, Eds., Plenum Press, New York, pp. 65–76.
This extends P3 by first determining the maximum number of ‘bumps’ in the basis—that is, decomposing the kernal into embedded triangles and smaller non-triangular sections, called bumps. Then, a procedure like P3 is applied to each bump separately.
W. Isard (1960), Methods of Regional Analysis: An Introduction to Regional Analysis, MIT Press, Cambridge, Mass. This book is a nonmathematical treatment of economic accounts (for example, gross national product) and flows (namely, commodites and money). Some discussion pertains to input-output systems analysis and to linear programming.
J. E. Kalan (1971), “Aspects of Large-scale In-core Linear Programming,” Proc. Acm., pp. 304–313. This is the basic reference that introduces supersparsity (along with other aspects of storage reduction) in linear programming. Of particular interest is the author’s agenda algorithm.
M. G. Kendell (1973), “A Computer Method of Analyzing the Structure of Behavior Models,” in Lecture Notes in Economics and Mathematical Systems 80, N. Hawkes (Ed.), Springer-Verlag, Heidelberg, Germany. The author briefly shows how the graph of a matrix describes the associated model’s structure. He distinguishes the use of successive powers to obtain reachability imformation.
T. C. Koopmans (1953), “Identification Problems in Economic Model Construction,” Studies in Econometric Methods, Wiley, New York, pp. 27–48. This pioneering paper complements the work of Simon (1953); it analyzes the question of exploiting triangularity in the model’s structure (that is, the matricial form) to identify “exogenous variables”—that is, where no Gaussian elimination is needed to determine (recursively) the values. He describes implications on performing the associated regression analysis.
T. C. Koopmans and A. F. Bausch (1959), “Selected Topics In Economics Involving Mathematical Reasoning,” Siam Review2, 79–148. This survey includes elements of qualitative analysis, namely tracing causation and the identiflability problem.
G. M. Lady (1967), “The Structure of Qualitatively Determinant Linear Systems,” Rice University, Systems Report No. 19-14, Houston, Texas. This unpublished paper addresses the problem posed by Paul Samuelson (1955). Using graph theory, a constructive proof is given for an equivalence theorem, resulting in an algorithm to test for qualitative determinacy in a square matrix.
K. Lancaster (1962), “The Scope of Qualitative Economics,” Rev. Econ. Studies 29, 99–132. This is the first definitive work on Samuelson’s (1955) posed problem: can we determine the direction of change in some variables when all we know are the directions of change—that is, given y=Ax, where we know only the signs of the coefficients in A, can we determine the signs of x for some (all) y’s?
K. Lancaster (1965), “The Theory of Qualitative Linear Systems,” Econometrica 33, 395–408. This is a sequel to the former paper.
J. Maybee and J. Quirk (1969), “Qualitative Problems in Matrix Theory,” Siam Rev. 11, 30–51. This review not only surveys the state-of-the art, synthesizing earlier results, but includes new perspectives both in the mathematics and the economics. Its applications focus on related, but distinct, aspects of stability and determinacy.
J. Minker (1978), Search Strategy and Selection Function for An Inferential Relational System,: ACM Trans, on Data-base Systems 3, 1, 1–31. This paper considers implied facts (called “virtual relations”), given explicit facts and axioms. The author builds on a relational data-base foundation and emphasizes the algorithmic process. (See, also, Fishman. )
A. Nijenhuis and H. S. Wilf (1975), Combinatorial Algorithms, Academic Press, New York. This book contains a collection of combinatorial algorithms with accompanying Fortran listings. Of particular interest is the algorithm to obtain a spanning forest of a graph (pp. 102–108 ).
S. B. Noble (1960), “Some Flow Models of Production Constraints,” Naval. Res. Logist. Quart. 7, 4, 401–419. One of the interesting notions in this early paper is on independence: “a model gives predictive results only if the inputs are independent of the composition of the outputs.” That is, the shares of inputs and outputs do not dependent upon total flow.
W. Orchard-Hays (1968), Advanced Linear Programming Computing Techniques, McGraw-Hill, New York. This basic text describes the accumulated knowledge from the author’s pioneering development of mathematical programming systems betwen 1953 and 1967. Of particular interest are the invert agenda algorithms, information structures, fundamental algorithms, and user-oriented design features.
J. P. Quirk and R. Ruppert (1965), “Qualitative Economics and the Stability of Equilibrium,” Rev. Econ. Studies 32, 311–326. This basic paper shows how the stability of an equilibrium, when only the signs of coefficients are known, can be cast in graph-theoretic terms. A fundamental equivalence theorem is presented, whereby the question of qualitative stability is a question of cyclic structure.
F. S. Roberts (1976), Discrete Mathematical Models with Applications to Social, Bibliographical, and Environmental Problems, Englewood Cliffs, New Jersey. This is a lucid text on structured models, as pioneered by Harary. It contains important extensions of the theory and a wealth of applications, previously published by the author.
D. J. Rose ( 1970, “Triangulated Graphs and the Elimination Process,” Journ. Math. Anal, and Appl. 32, 597–609. This is the early formalization of agenda algorithms for sparse matrices, casting it as a graph problem.
D. J. Rose (1973), “A Graph-Theoretic Study of the Numerical Solution of Sparse Positive Definite Systems of Linear Equations,” Graph Theory and Computing, R. Read, Ed., Academic Press, New York, pp. 183–217. This extends results in sparse matrix theory, which grew during the 1960fs out of linear programming developments and applications of other matrix processing associated with economic models. It deepens the ties with graph theory and associated combinatorial problems.
D. Rosenblatt (1957), “On Linear Models and the Graphs of Minkowski-Leontief Matrices,” Econometrica 25, 325–338. This early paper related matrices and graphs, although the theorems were limited to special matrices associated with input-output systems analysis.
D. Rosenblatt (1957), “On the Graphs and Asymptotic Forms of Finite Boolean Relation Matrix and Stochastic Matrices,” Naval Res. Logis. Quart. 4, 2, 151–167. This is a companion to the previous paper. One of the problems addressed is: When is the fundamental matrix, I-A, nonsingular, given that A is stochastic? P. A. Samuelson (1955), The Foundations of Economic Analysis, Harvard University Press, Cambridge, Mass., pp. 23–28. This is where Samuelson first posed the problem of qualitative determinacy.
P. A. Samuelson (1974), “Complementarity—An Essay on the 40th Anniversary of the Hicks-Allen Revolution in Demand Theory,” Journ. Econ. Lit. 12. This paper contains a comprehensive review of complementar-ity, substitutability, and independence of the quantities demanded for goods. He builds an appreciation for the problem and the many proposals for measuring complementarity. He highlights the Hicks-Allen measure.
E. Seneta (1973), Non-Negative Matrices, John Wiley & Sons, New York. This text provides a full account of Perron-Frobenius theory and extensions. Special attention, though limited, is given to qualitative analysis (pp. 49–54 ).
L. B. Shepard (1967), “A Geometric Interpretation of Substitutable, Independent, and Complementary Commodities in Consumption,” Masters Thesis, Oregon State University, Corvallis, Oregon. This contains a tutorial on complementarity, with an important resolution of the gap that exists between Hick’s verbage and his mathematics.
H. Simon (1953), “Causal Ordering and Identifiability,” Studies in Econometric Method, Wiley, New York, pp. 49–74. This is the pioneering paper in tracing causation—in the Wold sense—and identifying exogenous variables. Little is offered in large-scale algorithmic analysis, compared to the later developments in mathematical programming systems, and treatment of sparse matrices. The conceptual foundation, however, is still relevant to the more general analysis of matricial forms, including, for example, linear programming models.
B. Sundgren (1975), Theory of Data Bases, Petrocelli/Charter, New York. This book provides a comprehensive treatment of a theory of databases, with focus on the anatomy and structural components, based on Churchman’s concept of “Inquiring Systems.” In principle, this is a relational database construct, but the mathematics introduced by Codd is absent.
R. Tarjan (1972), “Depth-first Search and Linear Graph Algorithms,” Siam Journ. Comput. 1, 146–160. This introduces a systematic way to search for paths, components, spanning trees, and so forth. Its complexity depends upon the information structure used.
V. Vemuri (1978), Modeling of Complex Systems: An Introduction, Academic Press, New York. This book begins by defining “system” (a set of interrelated elements) and related terms. Chapter 7 is of particular interest, introducing static equilibrium models. The book also covers reducibility (pp. 234–239), stability (pp. 328–334), and hierarchical analysis (pp. 304–314).
J. N. Warfield (1974), “Developing Subsystem Matrices in Structured Modeling,” and “Developing Interconnection Matrices in Structured Modeling,” IEEE Trans. Smc 4, 1, 74–80; 81–87. These two companion papers focus on the reachability matrix, drawing from the basic works of Harary, et al. (1965). He asserts, “Transitive inference is employed to reduce the number of data inputs required for the development of the [reachability] matrix.”
J. N. Warfield (1974a), “Toward Interpretation of Complex Structural Models,” IEEE Trans. Smc 4, 5, 405–424. This complements the author’s previous two papers, including a review of his work. Of particular interest is his algorithm to construct a minimal digraph from a given one—that is, one with the same reachability matrix. The method is similar to a topological sort with loop detection.
R. L. Weil and D. V. Steward (1967), “The question of Determinacy in Square Systems of Equations,” Zeitschrift Fur Nationalökonomie 27, 261–266. This early paper presents greater formalism than Lancaster’s initial effort.
R. L. Weil and P. C. Kettler (1971), “Rearranging Matrices to Block-Angular Form for Decomposition (and Other) Algorithms,” Mgt. Sci. 18, 1, 98–108. This paper describes a heuristic to perform the rearrangement to a block-angular form. Although the orientation is for computational efficiency, the rearrangement offers valuable insight for diagnostic analysis.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Plenum Press, New York
About this chapter
Cite this chapter
Greenberg, H.J. (1981). Implementation Aspects of Model Management: A Focus on Computer-Assisted Analysis. In: Bayraktar, B.A., Cherniavsky, E.A., Laughton, M.A., Ruff, L.E. (eds) Energy Policy Planning. Nato Conference Series, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-1080-8_29
Download citation
DOI: https://doi.org/10.1007/978-1-4684-1080-8_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-1082-2
Online ISBN: 978-1-4684-1080-8
eBook Packages: Springer Book Archive