sufficient global optimality conditions for general mixed integer nonlinear programming problems

اسناد مشابه

• Sufficient global optimality conditions for general mixed integer nonlinear programming problems

  مقاله۲۰۱۶Bulletin of the Iranian Mathematical SocietyJ. Quan, Z. Y. Wu, G. Q. Li

  In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable suff

• Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water networks under uncertainty

  سند علمی۲۰۰۸Computers & Chemical EngineeringRamkumar Karuppiah, Ignacio E. Grossmann

  The problem of optimal synthesis of an integrated water system is addressed in this work, where water using processes and water treatment operations are combined into a single network such that the total cost of designing the network and operating it optimally is globally minimiz

• A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures

  سند علمی۲۰۰۸J. Global OptimizationRamkumar Karuppiah, Ignacio E. Grossmann

  In this work we present a global optimization algorithm for solving a class of large-scale nonconvex optimization models that have a decomposable structure. Such models are frequently encountered in two-stage stochastic programming problems, engineering design, and also in planni

• Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO

  مقاله‌ی دسترسی آزاد۲۰۱۶European Journal of Operational ResearchFaniBoukouvala, RuthMisener, Christodoulos A.Floudas

• Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water networks under uncertainty

  مقاله‌ی دسترسی آزاد۲۰۰۸Computers & Chemical EngineeringRamkumarKaruppiah, Ignacio E.Grossmann

• A New Sequential Cutting Plane Algorithm for Solving Mixed Integer Nonlinear Programming Problems

  سند علمی۲۰۰۷Claus Still

  This paper presents a new algorithm for solving mixed integer nonlinear programming problems. The algorithm uses a branch and bound strategy where a nonlinear programming problem is solved in each integer node of the tree. The nonlinear programming problems, at each integer node