A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models

BREARLEY, A.L., MITRA, G., AND WILLIAMS, H.P. Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8 (1975), 54-83.

BIXBY, R.E., AND CUNNINGHAM, W.H. Converting linear programs to network problems. Math. Oper Res. 5 (1980), 321-357.

BRADLEY, G., BROWN, G., AND GRAVES, G. Design and implementation of large scale primal transshipment algorithms. Manage. Sc~. 24, (1977), 1-35.

GEOFFRION, A.M. The purpose of mathematical programming is insight, not numbers. Interfaces 7, 1 (1976), 81-92.

GILMORE, P., GREENBERG, H.J., AND KURATOR, W. A simplification analysis of the midterm energy market model and the national coal model. EIA Tech. Rep., Washington, D.C., 1980.

GLOVER, F., AND KLINGMAN, D. Modeling and solving network problems. In Design and Implementatmn of Opt~m~zatmn Software, H J. Greenberg (Ed.), Sijthoff & Noordhoff, The Netherlands, 1978, pp. 185-224.

GREENBERG, H.J. A new approach to analyze information contained in a model. In Validation and Assessment Issues of Energy Models, S.I Gass (Ed.), NBS Pub. 569, Washington, D.C., 1979, pp. 517-524.

GREENBERO, H.J. A tutorial on computer-assisted analysis. In Advanced Techniques in the Practtce of OR, H.J. Greenberg, F.H. Murphy, and S.S. Shaw (Eds.), American Elsevier, New York, 1982, pp. 212-249.

GREENBERG, H.J., AND KALAN, J.E. Enhancing Fortran to aid manipulation of large, structured matrices. J. Res. N.B S. 84 (1979), 21-50.

GREENBERG, H.J., AND MAYBEE, J.S. Computer-Assisted Analysis and Model Simplification, Academic Press, New York, 1981.

GREENBERG, H.J., LUNDGREN, J.R., AND MAYBEE, J.S. Graph theoretic methods for the qualitative analysis of rectangular matrices. Smm J. Alg. D=screte Methods 2 (1981), 227-239.

GREENBERG, H.J, LUNDGREN, J.R., AND MAYBEE, J.S. Inverting graphs of rectangular matrices. D=screte Appl. Math., to be published.

GREENEERG, H.J., AND RARICK, D.C. Determinmg GUB sets via an invert agenda algorithm. Math Program. 7 (1977), 240-244.

GUNAWARDANE, G., HOFF, S., AND SCHRAGE, L. Identification of special structure constraints in linear programs. Math. Program. 21 (1981), 90-97.

HELLERMAN, E., AND RARICK, D.C. Reinversmn wlth the preassigned pivot procedure. Math. Program. 1 (1971), 215-216

HELLERMAN, S., AND RARICK, D.C. The partitioned preassigned pivot procedure (P4). In Sparse Matrices and Their Apphcatmns. D.J. Rose and R.A. Willoughby (Eds.), Plenum, New York, 1972, pp. 65-76~

JOHNSON, D.B. Finding all the elementary ctrcmts of a directed graph. SIAM J. Comput. 4, (1975), 77-84

KALAN, J.E. Aspects of large-scale in-core linear programming. In Proc. 1971 Ann. Conf., ACM, New York, 1971, pp. 304-313.

KENDELL, M.G. A computer method of analyzing the structure of behavior models. In Lecture Notes in Economics and Mathematical Systems 80, N. Hawkes (Ed.), Springer, Heidelberg, Germany.

KLEE, V., AND LADNER, R. Quahtative matrices: Strong sign-solvability and weak satisfiabihty. In H.J. Greenberg and J.S. Maybee, Computer-Assisted Analysis and Model Simplification, Academic Press, New York, 1981, pp. 293-320.

KOOPMANS, T.C, AND BAUSCH, A.F. Selected topics in economics involving mathematical reasoning. SIAM Rev. 1, 2 (1959), 79-148.

KURATOR, W.G, AND O'NEILL, R.P PERUSE: An mteractive system for mathematical programs. ACM Trans. Math Softw. 6, 4 (Dec. 1980), 489-509.

KNUTH, D. The Art of Computer Programming, vol I, Fundamental Algorithms. Addison- Wesley, Reading, Mass., 1968.

ORCHARD-HAYS, W. Advanced Linear-Programming Computing Techmques. McGraw-Hill, New York, 1968

ROBERTS, F.S. Discrete Mathematwal Models with Applications to Soctal, Blologwal, and Environmental Problems Prentice-Hall, Englewood Cliffs, N.J., 1976.

RosE, D.J. Triangulated graphs and the elimination process. J. Math. Anal Appl. 32 (1970), 597-609.

SCHRACE, L. Some comments on hidden structures in linear programs. In H.J. Greenberg and J.S. Maybee, Computer-AssistedAnalys~s andModelS~mplification, Academic Press, New York, 1981, pp. 389-395

SHEIR, D.R., AND WITZGALL, C. Arc tolerances in shortest path and network flow problems. Networks 10 (1980), 277-291.

SIMON, H. Causal ordering and identifiability. In Studies in Econometric Method. Wiley, New York, 1953, pp 49-74.

TARJAN, R Depth-first search and linear graph algorithms. SIAM J Comput. 2 (1972),146-160.

WILLIAMS, H.P. Model Budding ~n Mathematical Programming. Wiley-Interscience, New York, 1978.