A discrete recursive quadratic programming algorithm is developed for a class of mixed discrete constrained nonlinear programming (MDCNP) problems. The symmetric rank one (SR1) Hessian update formula is used to generate second order information. Also, strategies, such as the watchdog technique (WT), the monotonicity analysis technique (MA), the contour analysis technique (CA), and the restoration of feasibility have been considered. Heuristic aspects of handling discrete variables are treated via the concepts and convergence discussions of Part I. This paper summarizes the details of the algorithm and its implementation. Test results for 25 different problems are presented to allow evaluation of the approach and provide a basis for performance comparison. The results show that the suggested method is a promising one, efficient and robust for the MDCNP problem.

This content is only available via PDF.
You do not currently have access to this content.