RESEARCH PAPERS: Design Automation Papers

Optimization With Discrete Variables Via Recursive Quadratic Programming: Part 1—Concepts and Definitions

[+] Author and Article Information
J. Z. Cha, R. W. Mayne

Department of Mechanical and Aerospace Engineering, SUNY, Buffalo, N.Y.

J. Mech., Trans., and Automation 111(1), 124-129 (Mar 01, 1989) (6 pages) doi:10.1115/1.3258955 History: Received September 01, 1988; Online November 19, 2009


Although a variety of algorithms for discrete nonlinear programming have been proposed, the solution of discrete optimization problems is far from mature compared to continuous optimization techniques. This paper focuses on the recursive quadratic programming strategy which has proven to be efficient and robust for continuous optimization. The procedure is adapted to consider a class of mixed discrete nonlinear programming problems and utilizes the analytical properties of functions and constraints. This first part of the paper considers definitions, concepts, and possible convergence criteria. Part II includes the development and testing of the algorithm.

Copyright © 1989 by ASME
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In