Intelligent Math Programming Software

TD25.1 MProbe: Software for Analyzing Mathematical Programs

• John W. Chinneck; Carleton University, Systems & Computer Eng., 1125 Colonel By Dr., Ottawa, Ontario, K1S 5B6 , Canada; chinneck@sce.carleton.ca

During formulation and debugging you often need analytic information about your model. Example questions: What are the shapes of the nonlinear functions and constrained region? How effective are the constraints? Which constraints are redundant? MProbe is a software tool for answering analytic questions such as these.

TD25.2 Linking ANALYZE with AMPL

• Harvey J. Greenberg; University of Colorado, Mathematics Dept., CB 170, PO Box 173364, Denver, CO 80217-3364; hgreenbe@carbon.cudenver.edu

I wrote an interface that takes AMPL's output files plus a new file type in my ANALYZE utility and produces 2 files as input to ANALYZE. The first is the packed (binary) file that contains LP and solution information; the second is the syntax file that enables English translations and other commands.

TD25.3 Modern Sensitivity Analysis Software

• Allen Holder; Trinity University, Math Dept., 715 Stadium Dr., San Antonio, TX 78212; aholder@trinity.edu

While interior point solvers are readily available, no software is currently available that allows users to perform post-solution analysis based upon strictly complementary solutions. We discuss the new software Sleuth that uses a strictly complementary solution provided by most interior point solvers.

TD25.4 A Common Framework for Infeasibility, Redundancy & Minimal Representations

• Richard J. Caron; University of Windsor, Fac. of Science, PO Box 33830, Detroit, MI 48232; rcaron@uwindsor.ca
• Tim Traynor; University of Windsor, 401 Sunset, Rm. 9117 LAM, Windsor, Ontario, N9B 3P4 , Canada; tt@uwindsor.ca

We present a common framework from which to examine infeasibility, redundancy and minimal representations for general constraint sets arising in mathematical programming problems. The framework leads naturally to a probabilistic algorithm for finding the data for a certain set-covering problem the analysis of which leads to the identification of an irreducible infeasible system or a minimal representation.