Pages that link to "Item:Q4868828"
From MaRDI portal
The following pages link to Computer Codes for the Analysis of Infeasible Linear Programs (Q4868828):
Displaying 13 items.
- Some results concerning post-infeasibility analysis (Q1328606) (← links)
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem (Q1380443) (← links)
- Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming. (Q1416351) (← links)
- A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries (Q1600859) (← links)
- Analyzing infeasible nonlinear programs (Q1804579) (← links)
- Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- An Interactive Algorithm to Deal with Inconsistencies in the Representation of Cardinal Information (Q3163982) (← links)
- (Q3698636) (← links)
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs (Q3773689) (← links)
- Approaches to Diagnosing Infeasible Linear Programs (Q4015388) (← links)
- Locating Minimal Infeasible Constraint Sets in Linear Programs (Q4025905) (← links)
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)