The NEOS Server offers FEASPUMP2 for the solution of mixed-integer linear
feasibility problems in
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.
FEASPUMP2 is a further development of both variants by Fischetti and Salvagnin.
FP2 uses the CPLEX library.
This solver was implemented by
Hans Mittelmann and at
Using the NEOS Server for FEASPUMP2
The user must submit a mixed-integer linear programming problem in
Examples of models in AMPL format can be found in the
MIPLIB 2003 library.
Only a model and a datafile may be submitted no command file.
The reason is that an MPS file is produced from the AMPL model and a
file is put out that shows the correspondence of the variable names
in the AMPL script and the MPS file respectively.
Note: Do not use an "end" at the end of the model file!
The administrator of FEASPUMP reserves the right to keep and use problem
instances submitted through NEOS for testing and debugging purposes.
Enter the complete path to the AMPL model file (linear, minimization, no commands, no "end")
Enter the complete path to the AMPL data file (optional, no commands)
Choose the FP version (ab, bfl)
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5
Please do not click the 'Submit to NEOS' button more than once.