Logical testing for new approaches to mathematical programming modeling and analysis

  • Fred Glover
  • Harvey J. Greenberg


We describe the use of network methods to aid model formulation and analysis, particularly when using certain approaches, notably GAMs or Structured Modeling. When mapping a relational description to an algebraic representation, it is desirable to check logical consistency, redundancy and forcing structures that may be present, Sometimes these could be purposeful, but often they reflect modeling errors. In either case it is useful to reveal these properties efficiently. Here we describe an algorithmic framework, based on topological sorting, which applies not only to mathematical programming modeling, but also to, rule-base management in an expert system.

Key words

Logical testing structured modeling computer-assisted analysis rule-base management model management network algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aho, A.V., Garey, M.R., and Ullman, J.D., ‘The transitive reduction of a directed graph’, SIAM J. Comput. 1 (1972) 131–137.Google Scholar
  2. Balinski, M.L., ‘On a selection problem’, Mgt. Sci. 17 (1970) 230–231.Google Scholar
  3. Blair, C.E., Jeroslow, R.G., and Lowe, J.K., ‘Some results and experiments in programming techniques for propositional logic’, to appear in Comp. and OR.Google Scholar
  4. Bramer, M.A., ‘Expert Systems: The vision and the reality’, in Research and Development in Expert Systems, M.A. Bramer (ed.), Cambridge University Press, 1985, pp. 1–12.Google Scholar
  5. Ford, Jr. L.R. and Dulkerson, D.R., Flows in Networks, Princeton University Press, 1962.Google Scholar
  6. Geoffrion, A.M., ‘Integrated modeling systems’, Computer Science in Economics and Management 2 (1989) 3–15 (this issue).Google Scholar
  7. Glover, F., Klingman, D., Mote, J., and Whitman, D., ‘Comprehensive Evaluation and Enhancement of Maximum Flow Algorithms’, Applications of Management Science 3 (1983) 109–175.Google Scholar
  8. Greenberg, H.J., Lundgren, J.R., and Maybee, J.S., ‘Inverting graphs of rectangular matrices’, Disc. Appl. Math. 8 (1984) 255–265.Google Scholar
  9. Greenberg, H.J., Lundgren, J.R., and Maybee, J.S., ‘Digraph inversion’, University of Colorado.Google Scholar
  10. Harary, F. Norman, R.Z. and Cartwright, D., Structural Models: An Introduction to the Theory of Directed Graphs, Wiley, 1965.Google Scholar
  11. Jeroslow, R.G., ‘Computation-oriented reductions of predicate to propositional logic’, to appear in Dec. Supp. Systems.Google Scholar
  12. Johnson, E.L., and Padberg, M.W., ‘Degree-two inequalities, clique facets, and biperfect graphs’, Annals Disc. Math. 16 (1982) 169–187.Google Scholar
  13. Knuth, D.E., The Art of Computer Programming, Volume 1: Fundamental Algorithms, Addison-Welsey, Reading, MA, 1968.Google Scholar
  14. Meeraus, A., ‘General Algebraic Modeling System,’ to appear.Google Scholar
  15. Picard, J.C. ‘Maximal Closure of a Graph and Applications to Combinatorial Problems’, Mgt. Sci. 22 (1976) 1268–1272.Google Scholar
  16. Rhys, J.M.W., ‘Shared fixed cost and network flows’, Mgt. Sci. 17 (1970) 200–207.Google Scholar
  17. Sethi, R., ‘Testing for the Church-Rosser property’, J. ACM 21 (1974) 671–679.Google Scholar
  18. Valdes, J., Tarjan, R.E. and Lawler, E.L., ‘The recognition of series parallel digraphs’, SIAM J. Comput. 11 (1982) 298–313.Google Scholar

Copyright information

© Kluwer Academic Publishers 1989

Authors and Affiliations

  • Fred Glover
    • 1
  • Harvey J. Greenberg
    • 2
  1. 1.Center for Applied Artificial Intelligence, Graduate School of BusinessUniversity of ColoradoBoulderUSA
  2. 2.Mathematics DepartmentUniversity of Colorado at DenverDenverUSA

Personalised recommendations