Hostname: page-component-6766d58669-bp2c4 Total loading time: 0 Render date: 2026-05-19T00:45:16.534Z Has data issue: false hasContentIssue false

Preference-directed design

Published online by Cambridge University Press:  27 February 2009

Joseph G. D’Ambrosio
Affiliation:
Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109
William P. Birmingham
Affiliation:
Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109

Abstract

Current design practices mandate that engineering designs be evaluated based on multiple attributes, e.g., cost, power, and area. For multiattribute design problems, generation and evaluation of the Pareto optimal set guarantees the optimal design will be found, but is not practical for a large class of problems. Iterative techniques can be applied to most problems, but sacrifice optimality. In this paper, we introduce a new technique that extends the set of design problems that can be solved optimally. By first constructing an imprecise value function, the number of nondominated alternatives that must be generated is reduced. We describe an implementation based on combinatorial optimization and constraint satisfaction which achieves additional performance gains by decomposing the value function to identify dominated design-variable assignments. Test results indicate that our approach extends the set of problems that can be solved optimally.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable