The Maximum Feasible Subsystem problem
 Home page

[ Home | People | Papers | Software | Instances | Links ]

Welcome to the MaxFS home page. This site is under construction.

MaxFS problem: Given an infeasible linear system $ A{\bf x} \geq {\bf b}$, find a Maximum Feasible Subsystem, i.e., a feasible subsystem containing a maximum number of inequalities.

Variants of this NP-hard problem have interesting applications in a variety of fields.


[June 2006] The MaxFS web pages are on line.



We have collected a set of instances of MaxFS from the above applications. These are in LP format or in a compact format more suited for large instances.

Current software for MaxFS will soon be available for download.


This page is maintained by Pietro Belotti.