The NEOS Server offers RAPOSa for the solution of global optimization and mixed-integer problems.
Problems can be submitted to RAPOSa in AMPL format on the NEOS server.
RAPOSa (Reformulation Algorithm for Polynomial Optimization -
Santiago) is a global optimization solver, specifically designed for
mixed-integer polynomial programming problems with box-constrained
variables. Written entirely in C++, it is based on the
Reformulation-Linearization Technique developed by Hanif D. Sherali
and Cihan H. Tuncbilek  and subsequently improved by Hanif
D. Sherali, Evrim Dalkiran and collaborators   . To cite
RAPOSa, please refer to this recently accepted paper in the Journal of
The main features of RAPOSa are:
RAPOSa is maintained by the development team of
The user must submit a model in AMPL
format. Examples are provided in
section of the AMPL website.
The problem must be specified in a model file. A data file and commands
files may also be provided. If the commands file is specified, it must
contain the AMPL solve command; however, it must not contain
the model or data commands. The model and data
files are renamed internally by NEOS.
The commands file may include option settings for the solver. To specify
solver options, add
option raposa_options 'OPTIONS';