Skip to main content
Log in

Outer Approximation Algorithm for One Class of Convex Mixed-Integer Nonlinear Programming Problems with Partial Differentiability

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Duran, M., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307–339 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Fletcher, R., Leyffer, S.: Solving mixed-integer nonlinear programs by outer approximation. Math. Program. 66, 327–349 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237–260 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  4. Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3, 227–252 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295–309 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. 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)

    Article  MATH  Google Scholar 

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. Zǎlinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)

    Book  Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to M. Montaz Ali.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-015-0715-y

Keywords

Mathematics Subject Classification

Navigation