Abstract

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.

Copyright in the material you requested is held by the American Society of Mechanical Engineers (unless otherwise noted). This email ability is provided as a courtesy, and by using it you agree that you are requesting the material solely for personal, non-commercial use, and that it is subject to the American Society of Mechanical Engineers' Terms of Use. The information provided in order to email this topic will not be used to send unsolicited email, nor will it be furnished to third parties. Please refer to the American Society of Mechanical Engineers' Privacy Policy for further information.

Shibboleth is an access management service that provides single sign-on protected resources.
It replaces the multiple user names and passwords necessary to access subscription-based content with a single user name and password that can be entered once per session.
It operates independently of a user's location or IP address.
If your institution uses Shibboleth authentication, please contact your site administrator to receive your user name and password.