FilMINT

The NEOS Server offers FilMINT for the solution of mixed integer nonlinearly constrained optimization problems in AMPL format.

FilMINT is based on the LP/NLP algorithm by Quesada and Grossmann implemented in a branch-and-cut framework. It combines the MINTO branch-and-cut framework for MILP with filterSQP, an active set solver, used to solve the nonlinear programs that arise as subproblems in the algorithm. Through MINTO, we are able to exploit a range of modern MILP features, such as enhanced branching and node selection rules, primal heuristics, preprocessing, and cut generation routines.

FilMINT was developed by Jeff Linderoth, and Sven Leyffer, and Kumar Abhishek.

Using the NEOS Server for FilMINT

The user must submit a model in AMPL format to solve a mixed integer nonlinearly constrained optimization problem. Examples of models in AMPL format can be found in the MacMINLP library.

The model is specified by a model file, and optionally, a data file and a commands file.

If the command file is specified it must contain the AMPL solve command.

The commands file can contain any AMPL command or set options for FilMINT . Printing directed to standard out is returned to the user with the output.
Enter the location of the ampl model (local file)
Model File:

Enter the location of the ampl data file (local file)
Data File:

Enter the location of the ampl commands file (local file)
Commands File:

Comments:

Put in priority queue

e-mail address:

_{DOE disclaimer

DOE Web privacy policy}