‎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 sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

‎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 sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

Mixed-integer quadratic programming (MIQP) is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing that if the decision version of mixed-inte...

Concave Mixed-Integer Quadratic Programming is the problem of minimizing a concave quadratic polynomial over the mixed-integer points in a polyhedral region. In this work we describe two algorithms that find an -approximate solution to a Concave Mixed-Integer Quadratic Programming problem. The running time of the proposed algorithms is polynomial in the size of the problem and in 1/ , provided ...