Abstract
In this paper, we mainly study one convex mixed-integer nonlinear programming problem with partial differentiability and establish one outer approximation algorithm for solving this problem. With the help of subgradients, we use the outer approximation method to reformulate this convex problem as one equivalent mixed-integer linear program and construct an algorithm for finding optimal solutions. The result on finite steps convergence of the algorithm is also presented.
Similar content being viewed by others
References
Duran, M., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307–339 (1986)
Fletcher, R., Leyffer, S.: Solving mixed-integer nonlinear programs by outer approximation. Math. Program. 66, 327–349 (1994)
Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237–260 (1972)
Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3, 227–252 (2002)
Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295–309 (2001)
Quesada, I., Grossmann, I.E.: An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16, 937–947 (1992)
Bonami, P., Biegler, L., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186–204 (2008)
Eronen, V.-P., Makela, M.M., Westerlund, T.: On the generalization of ECP and OA methods to nonsmooth convex minlp problems. Optimization 63, 1057–1073 (2014)
Zǎlinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)
Acknowledgments
The authors are grateful to the referee for careful reading this paper and valuable comments which help us to improve the original version. This research was supported by the National Natural Science Foundations of P. R. China (Grant Nos. 11401518 and 11261067) and the IRTSTYN, and by the Claude Leon Foundation of South Africa.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wei, Z., Ali, M.M. Outer Approximation Algorithm for One Class of Convex Mixed-Integer Nonlinear Programming Problems with Partial Differentiability. J Optim Theory Appl 167, 644–652 (2015). https://doi.org/10.1007/s10957-015-0715-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-015-0715-y