By Topic

Generalised cut map algorithms for tolerance and tolerance-tuning problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Alexander Voreadis ; Hellenic Navy, Athens, Greece

The problem considered is the choice of a set of system parameters, so that inequality constraints are satisfied or can be satisfied by tuning, for a specified variation of parameter values about their nominal value. Such problems occur when systems must be synthesised from components whose values are known only to certain tolerances. Fully implementable algorithms that are suitable for the general nonconvex cases and utilise concepts employed by Eaves and Zangwill in their generalised cutting plane algorithms are presented. The algorithms generalise earlier algorithms for the pure tolerance (no tuning) and the tolerance-tuning problems that are suitable only for the case when the tolerance and tuning regions are constant.

Published in:

IEE Proceedings G - Electronic Circuits and Systems  (Volume:129 ,  Issue: 4 )