|Solution methods for MaxFS|
Here are some of the methods used to solve MaxFS.
Combinatorial Benders' cuts
Combinatorial Benders' cuts (Codato & Fischetti 04).
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."
It is a simple algorithmic framework for solving systems of linear inequalities, see e.g. [11,22]. At every iteration the attention is focused on
reducing the violation of a single inequality. Given a feasible system
, as well as
a starting point
such a method generates a
This page is maintained by Pietro Belotti.