Harvey Greenberg: analyzing infeasible mathematical programs

DOI10.1007/978-3-030-56429-2_4MaRDI QIDQ2086522zbMATH OpenOpenAlexFDO

Authors John W. Chinneck

Publication date 25 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56429-2_4

zbMATH Keywords

artificial intelligencecomputer-assisted analysisinfeasibilitylarge-scale systemslinear programmingmodelingsensitivity analysis

Mathematics Subject Classification ID

General theory of mathematical modeling (00A71) Sensitivity, stability, well-posedness (49K40) Numerical mathematical programming methods (65K05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51)

Recommendations

• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
• scientific article; zbMATH DE number 1163815
• Analyzing infeasible nonlinear programs
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs

Cited in

(2)

• Harvey J. Greenberg. A legacy bridging operations research and computing
• Generalized filtering algorithms for infeasibility analysis

This page was built for publication: Harvey Greenberg: analyzing infeasible mathematical programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086522)