Show simple item record

contributor authorJ. Z. Cha
contributor authorR. W. Mayne
date accessioned2017-05-08T23:30:39Z
date available2017-05-08T23:30:39Z
date copyrightMarch, 1989
date issued1989
identifier issn1050-0472
identifier otherJMDEDB-28097#130_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/105768
description abstractA 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.
publisherThe American Society of Mechanical Engineers (ASME)
titleOptimization With Discrete Variables Via Recursive Quadratic Programming: Part 2—Algorithm and Results
typeJournal Paper
journal volume111
journal issue1
journal titleJournal of Mechanical Design
identifier doi10.1115/1.3258956
journal fristpage130
journal lastpage136
identifier eissn1528-9001
keywordsAlgorithms
keywordsOptimization AND Quadratic programming
treeJournal of Mechanical Design:;1989:;volume( 111 ):;issue: 001
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record