MISQP - Mixed-Integer Sequential Quadratic Programming

 

Purpose:

MISQP solves mixed-integer nonlinear programming problems by a modified sequential quadratic programming (SQP) method. It is not assumed that integer variables are relaxable, i.e., problem functions are evaluated only at integer points. The code is applicable also to nonconvex optimization problems.

Numerical Method:

The algorithm is stabilized by a trust region method including Yuan's second order corrections. The Hessian of the Lagrangian function is approximated by BFGS updates subject to the continuous and integer variables. Successively, mixed-integer quadratic programs must be solved.

Program Organization:

MISQP is a double precision FORTRAN subroutine where all data are passed by subroutine arguments. Function and gradient values must be submitted through reverse communication. Partial derivatives subject to integer variables are approximated internally at grid points. The generated mixed-integer quadratic programming subproblems must be solved by the code MIQL.

Special Features:

1. separate handling of upper and lower bounds
2. boolean, integer, and continuous variables
3. accepts non-relaxable integer/boolean variables
4. no partial derivatives subject to integer variables required
5. extensive numercal tests (186 examples)
6. full documentation by initial comments
7. reverse communication
8. FORTRAN source code (close to F77, conversion to C by f2c possible)
   

Applications:

The development of MISQP was supported by the Shell GameChanger program, and MISQP is included in Shell's simulation packages. In addition, the code is in use at General Electric, Epcos, Dassault/Simulia (iSight), ANSYS (DesignXplorer), BASF (ChemaSim) and at several smaller companies and research institutes.

Reference:

	O. Exler, K. Schittkowksi (2007): A trust region SQP algorithm for mixed-integer nonlinear programming, Optimization Letters, Vol. 1, 269-280
	O. Exler, T. Lehmann, K. Schittkowski (2012): MISQP: A Fortran subroutine of a trust region SQP algorithm for mixed-integer nonlinear programming - user's guide, Report, Department of Computer Science, University of Bayreuth
	O. Exler, K. Schittkowski, T. Lehmann (2012): A comparative study of numerical algorithms for nonlinear and nonconvex mixed-integer optimization, to appear: Mathematical Programming Computation

Availability:

For more details contact the author or click here for free license for members and students of academic institutions.