Discrete nonlinear optimisation by constraint decomposition and designer interaction
by E. Khorshid, A. Seireg
International Journal of Computer Applications in Technology (IJCAT), Vol. 12, No. 2/3/4/5, 1999

Abstract: A procedure is developed for optimising discrete non-linear problems by decomposition of the constraints and the merit function and rearranging the decomposed stages into sequential levels. Forward and backward techniques are used to overcome any infeasibility encountered in the subsystems and to improve the design merit. The complex gear train design problem investigated by Pomrehn and Papalambros [20] is used for illustrating the proposed strategy. The improvement in the design merit and the reduction in computational effort gained as a result of designer interaction are demonstrated.

Online publication date: Sun, 13-Jul-2003

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com