Pages that link to "Item:Q4015388"

The following pages link to Approaches to Diagnosing Infeasible Linear Programs (Q4015388):

Displaying 14 items.

• On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
• Some results concerning post-infeasibility analysis (Q1328606) (← links)
• The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
• Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities (Q1380442) (← links)
• Reasoning on infeasibility in distributed collaborative computing environment (Q1380446) (← links)
• Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables (Q1754029) (← links)
• The ANALYZE rulebase for supporting LP analysis (Q1815829) (← links)
• Automatic repair of convex optimization problems (Q2245690) (← links)
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
• A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
• A New Approach to Partial MUS Enumeration (Q3453242) (← links)
• A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)