RAPOSa is a global optimization solver, specifically designed for 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   .
Run directly on NEOS Server or from AMPL, Pyomo, JuMP or nl files
RAPOSa currently solves problems directly from AMPL, Pyomo, JuMP and via a .nl input file obtained with AMPL, Pyomo or JuMP. RAPOSa also solves problems directly from a .nl file. See the examples section for more information. One can also run RAPOSa on NEOS Server using this link
You choose the auxiliary solvers
RAPOSa leans on two subsolvers, one for the auxiliary linear subproblems and one local optimizer. They are used to generate lower and upper bounds, respectively. To date, RAPOSa can connect with the following subsolvers (some free and some commercial).
- Supported linear solvers
- Supported non-linear local solvers
(1) If you want to use gurobi, you must have a gurobi license.
(2) If you want to use knitro, CONOPT or MINOS, you must have the corresponding solver with its license.
Sequential or parallel version, you choose
The branch-and-bound scheme in which the Reformulation Linearization Technique is based takes great advantage of current parallelization procedures. A parallel version of RAPOSa is also available (on demand). It can benefit on the number of cores you have access to and which can improve significantly the performance of the algorithm.
- Implementation of the basic RLT algorithm introduced in 
- Efficient generation of bound factors via J-Sets
- Warm start of LP solver at each node (just for Gurobi)
- Warm generation of J-Sets at each node
- Products of constraint factors and bound factors
- Bound tightening techniques
- SDP cuts
- Different branching criteria
RAPOSa has been benchmarked with general global optimization solvers for nonlinear programming problems like BARON, Couenne and SCIP using two different test sets: DS-TS (taken from  and it can be downloaded in AMPL and .nl format at DS-TS) and MINLPLib-TS (taken from www.minlplib.org and it can be downloaded in AMPL and .nl format at MINLPLib-TS).
The four graphics show the performance profiles (). The graphics located on the left represent the performance associated with the running time, while the graphics on the right show those related with the optimality gap.The figure shows that, in instances from DS-TS, RAPOSa performs better than BARON, Couenne and SCIP. The difference becomes especially notorious in the difficult problems, those that were not solved in less than 10 minutes. On the other hand, in instances from MINLPLib-TS, RAPOSa performs better than BARON and Couenne in terms of optimality gap while it performs worse in terms of time.
More details on these tests can be seen in .
Core developing team
- Ignacio Gómez Casares (Univ. de Santiago de Compostela)
- Julio González Díaz (Univ. de Santiago de Compostela)
- Brais González Rodríguez (Univ. de Santiago de Compostela)
- Beatriz Pateiro López (Univ. de Santiago de Compostela)
- Current collaborators: Gabriel Álvarez Castro, Raúl Alvite Pazo, Samuel Alvite Pazo, Bissan Ghaddar, Iria Rodríguez Acevedo and Sofía Rodríguez Ballesteros
- Past collaborators: Pepa Arán Paredes, Ángel M. González Rueda, Joaquín Ossorio Castillo, Sergio Rodríguez Delgado, Diego Rodríguez Martínez and David Rodríguez Penas
: Sherali, H. D. and Tuncbilek, C. H., 1992. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization, 2(1), pp. 101-112.
: Sherali, H. D., Dalkiran, E. and Liberti, L., 2012. Reduced RLT representations for nonconvex polynomial programming problems. Journal of Global Optimization, 52(3), pp. 447-469.
: Sherali, H. D., Dalkiran, E. and Desai, J., 2012. Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts. Computational Optimization and Applications, 52(2), pp. 483-506.
: Dalkiran, E. and Sherali, H.D., 2013. Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality. Journal of Global Optimization, 57(4), pp. 1147-1172.
: Dalkiran, E. and Sherali, H.H., (2013). RLT-POS: Reformulation-Linearization Technique-based optimization software forsolving polynomial programming problems. Mathematical Programming Computation, 8, pp. 337–375.
: Gay, D. M., 2005. Writing .nl files. Optimization and Uncertainty Estimation.
: Dolan, E. D. and Moré J. J., 2002. Benchmarking optimization software with performance profiles. Mathematical Programming, 91, pp. 201–213.
: González-Rodríguez, B., Ossorio-Castillo J., González-Díaz J., González-Rueda A. M., Rodríguez-Penas D. and Rodríguez-Martínez D., 2021. Computational advances in polynomial optimization: RAPOSa, a freely available global solver. Tech. rep., Optimization Online, 942.