feaspump

The NEOS Server offers FEASPUMP for the solution of mixed-integer linear feasibility problems in MPS format, or in CPLEX-LP format. See these notes on formats and conversion. FEASPUMP stops after having found one feasible point. As an alternative you may use SCIP with limits/solutions = 1

The feasibility pump (FP) algorithm was originally developed by Fischetti, Glover, and Lodi for finding feasible points of binary LPs. It was then generalized to mixed-integer LPs by Bertacco, Fischetti, and Lodi ("BFL"). Achterberg and Berthold ("AB"; ZIB Berlin) developed this algorithm further. FP uses the CPLEX library. Source code and literature are available here.

This implementation permits to call the original BFL version of FP or the AB version. For a feasibility benchmark, see here.

This solver was implemented by Hans Mittelmann and executes at under

Using the NEOS Server for FEASPUMP

The user must submit a mixed-integer linear programming problem in one of the formats given above. When submitting via e-mail or XML-RPC delete empty tokens!

Enter the complete path to the MPS format data file
FP data (MPS format file):

Alternatively, enter the complete path to the CPLEX-LP file
FP data (CPLEX-LP format file):

Choose the FP version (AB=ab, BFL=bfl)
FP version:

Comments:

e-mail address:

Please do not click the 'Submit to NEOS' button more than once.

_{DOE disclaimer

DOE Web privacy policy}