A cut map algorithm for design problems with parameter tolerances
暂无分享,去创建一个
The design problem of choosing a set of parameters so that inequality constraints are satisfied for a specified variation of parameter values about their nominal value, is considered. Such problems occur when systems must be synthesized from components whose values are only known to a certain tolerance. Simple algorithms exist for such problems when the constraints are convex. This paper presents an algorithm which is valid for the non-convex case, The algorithm utilizes concepts employed by Eaves and Zangwill in their generalized cutting plane algorithms.
[1] J. Hammersley,et al. Monte Carlo Methods , 1964, Computational Statistical Physics.
[2] B. Eaves,et al. Generalized Cutting Plane Algorithms , 1971 .
[3] Elijah Polak,et al. Computational methods in optimization , 1971 .
[4] C. C. Gonzaga,et al. On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms , 1979 .