We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0–1 mixed-integer recourse variables in the first stage and only continuous variables in the second stage. The non-anticipativity constraints are satisfied by means of the twin-node-family strategy. In this work to solve each nonlinear convex subproblem at each node we propose the solution of sequences of quadratic subproblems. Since the convexity of the constraints we can approximate them by means of outer approximations. These methods have been implemented in C\(++\) with the help of Cplex 12.1, which only solves the quadratic approximations. The test problems have been randomly generated by using a C\(++\) code developed by this author. Numerical experiments have been performed and its efficiency has been compared with that of well-known codes.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
Alonso-Ayuso, A., Escudero, L. F., & Ortuño, M. (2003). BFC, a branch-and-fix coordination algorithm framework for solving some types of stochasticpure and mixed 0–1 programs. European Journal of Operational Research, 151, 503–519.
Alonso-Ayuso, A., Escudero, L. F., Garín, M. A., Ortuño, M. T., & Pérez, G. (2005). On the product selection and plant dimensioning problem under uncertainty. Omega, 33, 307–318.
Biegler, L. T., & Grossmann, I. E. (2004). Retrospective on optimization. Computers & Chemical Engineering, 28, 1169–1192.
Bonami, P., Biegler, L. T., Conn, A. R., Cornuéjols, G., Grossmann, I. E., Laird, C. D., et al. (2008). An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2), 186–204.
Borchers, B., & Mitchell, J. E. (1994). An improved branch and bound algorithm for mixed integer nonlinear programming. Computers and Operations Research, 21(4), 359–367.
Escudero, L. F., Garín, M., Merino, M., & Pérez, G. (2009). A general algorithm for solving two-stage stochastic mixed 0–1 first-stage problems. Computers & Operations Research, 36, 2590–2600.
Escudero, L. F., Garín, M., Merino, M., & Pérez, G. (2010). An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects. European Journal of Operational Research, 204, 105–116.
Escudero, L. F., Garín, M., Merino, M., & Pérez, G. (2012). An algorithmic framework for solving large-scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees. Computers & Operations Research, 39(5), 1133–1144.
Floudas, C. A. (1995). Nonlinear and mixed-integer optimization: Fundamentals and applications. London: Oxford University Press.
Grossmann, I. E. (2002). Review of nonlinear mixed-integer and disjunctive programming techniques. Optimization Engineering, 28, 1169–1192.
Heredia, F.J., Corchero, C., & Mijangos, E. (2013). Solving electric market quadratic problems by branch and fix coordination methods. In D. Hömberg, & F. Tröltzsch (Eds.), System modeling and optimization, CSMO 2011 (pp. 511–520). Springer, IFIP AICT 391.
Laporte, G., & Louveaux, F. (2002). An integer l-shaped algorithm for the capacited vehicle routing problem with stochastic demands. Operations Research, 50, 415–423.
Leyffer, S. (2001). Integrating sqp and branch-and-bound for mixed integer nonlinear programming. Computational Optimization and Applications, 18, 295–309.
Mijangos, E. (2013). An algorithm for two-stage stochastic quadratic problems. In D. Hömberg, F. Tröltzsch (Eds.), System modeling and optimization, CSMO 2011 (pp. 177–187). Springer, IFIP AICT 391.
Rockafellar, R. T. (1970). Convex analysis. Princeton, NJ: Princeton University Press.
Sen, S., & Sherali, H. (2006). Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Mathematical Programming Series A, 105, 203–223.
Sherali, H., & Zhu, X. (2006). On solving discrete two-stage stochastic program having mixed-integer first- and second-stage variables. Mathematical Programming Series B, 108, 597–616.
Sherali, H. D., & Fraticelli, B. M. P. (2002). A modification of bender’s decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse. Journal of Global Optimization, 22, 319–342.
Stoer, J., & Witzgall, C. (1970). Convexity and optimization in finite dimensions I. New York: Springer.
Wallace, S. W., Ziemba, W. T. (2005). Applications of stochastic programming. MPS-SIAM Series on Optimization.
Wets, R. J. B. (1966). Programming under uncertainty: The equivalent convex program. SIAM Journal on Applied Mathematics, 14, 89–105.
This research has been partially supported by the grant MTM2013-48462-C2-1-R of the Spanish research program.
About this article
Cite this article
Mijangos, E. An algorithm for two-stage stochastic mixed-integer nonlinear convex problems. Ann Oper Res 235, 581–598 (2015). https://doi.org/10.1007/s10479-015-1899-0
- Stochastic programming
- Convex programming
- Branch-and-fix coordination method
- Mixed-integer nonlinear programming
- Quadratic programming
- Outer approximation