Computer Codes for the Analysis of Infeasible Linear Programs
From MaRDI portal
Publication:4868828
DOI10.1057/jors.1996.6zbMath0842.90079OpenAlexW2024625102MaRDI QIDQ4868828
Publication date: 6 August 1996
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1996.6
Related Items (7)
An Interactive Algorithm to Deal with Inconsistencies in the Representation of Cardinal Information ⋮ An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming. ⋮ Generalized filtering algorithms for infeasibility analysis ⋮ A two-phase relaxation-based heuristic for the maximum feasible subsystem problem ⋮ A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries
Uses Software
This page was built for publication: Computer Codes for the Analysis of Infeasible Linear Programs
