The Maximum Feasible Subsystem problem  Home page

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

MaxFS problem: Given an infeasible linear system , 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.

News

Contents

• A detailed description of the MaxFS problem.
  
• A (growing) list of applications of MaxFS.
  
• Some of the methods applied to solve MaxFS.
  
• A list of publications in the area of MaxFS.
  

Downloads

Current software for MaxFS will soon be available for download.

Links

• The Infeas project at the ZIB Institute, Berlin.
• Loopp (Learning, Observing and Outputting Protein Patterns): a Protein Folding recognition software (old version).
• The Feasopt feature in Ilog Cplex: an infeasibility analysis tool that "...accepts an infeasible model and selectively relaxes the bounds and constraints, minimizing a [user defined] weighted penalty function."