Abstract
As part of his Intelligent Mathematical Programming System project, Harvey Greenberg investigated theory and developed methods for diagnosing the cause of infeasibility. The emphasis was on developing useful and practical tools for isolating the problem to a small part of a large model and arriving at an understandable explanation, or diagnosis, of the infeasibility. He leveraged known mathematical theorems—and developed new ones—to create the requisite tools for incorporation into his ANALYZE software. This chapter summarizes his contributions to practical methods for analyzing infeasible mathematical programs.
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
Similar content being viewed by others
References
E. Amaldi, V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147, 181–210 (1995)
J.W. Chinneck, Formulating processing network models: viability theory. Naval Res. Logist. 37, 245–261 (1990)
J.W. Chinneck, Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods, International Series in Operations Research and Management Sciences (Springer Science+Business Media, LLC, New York, 2008)
J.W. Chinneck, E.W. Dravnieks, Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3, 157–168 (1991)
L.R. Ford, D.R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, 1962)
D.R. Fulkerson, A network flow feasibility theorem and combinatorial applications. Can. J. Math. 11, 440–451 (1959)
D. Gale, A theorem in networks. Pac. J. Math. 7, 1073–1082 (1957)
H.J. Greenberg, A functional description of ANALYZE: a computer-assisted analysis system for linear programming models. ACM Trans. Math. Softw. 9, 18–56 (1983)
H.J. Greenberg, Computer-assisted analysis for diagnosing infeasible or unbounded linear programs. Math. Program. Stud. 31, 79–97 (1987)
H.J. Greenberg, Diagnosing infeasibility in min-cost network flow problems; Part I: dual infeasibility. IMA J. Math. Manage. 1, 99–109 (1987)
H.J. Greenberg, Diagnosing infeasibility in min-cost network flow problems; Part II: primal infeasibility. IMA J. Math. Manage. 2, 39–50 (1988)
H.J. Greenberg, An industrial consortium to sponsor the development of an intelligent mathematical programming system. Interfaces 20, 88–93 (1990)
H.J. Greenberg, Rule-based intelligence to support linear programming analysis. Decis. Support Syst. 8, 1–23 (1992)
H.J. Greenberg, An empirical analysis of infeasibility diagnosis for instances of linear programming blending models. IMA J. Math. Bus. Ind. 4, 163–210 (1992)
H.J. Greenberg, Intelligent analysis support for linear programs. Comput. Chem. Eng. 16, 659–673 (1992)
H.J. Greenberg, How to analyze the results of linear programs - Part 3: infeasibility diagnosis. Interfaces 23, 120–139 (1993)
H.J. Greenberg, A Computer-Assisted Analysis System for Mathematical Programming Models and Solutions: A User’s Guide for ANALYZE (Kluwer Academic Publishers, Boston, 1993)
H.J. Greenberg, Enhancements of ANALYZE: a computer-assisted analysis system for linear programming. ACM Trans. Math. Softw. (TOMS) 19(2), 233–256 (1993)
H.J. Greenberg, How to analyze the results of linear programs – Part 4: forcing substructures. Interfaces 24, 121–130 (1994)
H.J. Greenberg, The use of the optimal partition in a linear programming solution for postoptimal analysis. Oper. Res. Lett. 15, 179–185 (1994)
H.J. Greenberg, Consistency, redundancy, and implied equalities in linear systems. Ann. Math. Artif. Intell. 17, 37–83 (1996)
H.J. Greenberg, The ANALYZE rulebase for supporting LP analysis. Ann. Oper. Res. 65, 91–126 (1996)
H.J. Greenberg, Mathematical Programming Glossary Supplement: Tolerances, World Wide Web (2003), http://glossary.computing.society.informs.org/notes/tolerances.pdf
H.J. Greenberg, F.H. Murphy, Approaches to diagnosing infeasibility for linear programs. ORSA J. Comput. 3, 253–261 (1991)
O. Guieu, J.W. Chinneck, Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11, 63–77 (1999)
A.J. Hoffman, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proc. Symp. Appl. Math. 10 (1960)
J. van Loon, Irreducibly inconsistent systems of linear inequalities. Eur. J. Oper. Res. 8, 283–288 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Chinneck, J.W. (2021). Harvey Greenberg: Analyzing Infeasible Mathematical Programs. In: Holder, A. (eds) Harvey J. Greenberg. International Series in Operations Research & Management Science, vol 295. Springer, Cham. https://doi.org/10.1007/978-3-030-56429-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-56429-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-56428-5
Online ISBN: 978-3-030-56429-2
eBook Packages: Business and ManagementBusiness and Management (R0)