scholarly journals Optimal Hierarchical Decomposition Synthesis Using Integer Programming

1997 ◽  
Vol 119 (4) ◽  
pp. 440-447 ◽  
Author(s):  
R. S. Krishnamachari ◽  
P. Y. Papalambros

Decomposition synthesis in optimal design is the process of creating an optimal design model by selecting objectives and constraints so that it can be directly partitioned into an appropriate decomposed form. Such synthesis results are not unique since there may be many partitions that satisfy the decomposition requirements. Introducing suitable criteria an optimal decomposition synthesis process can be defined in a manner analogous to optimal partitioning formulations. The article presents an integer programming formulation and solution techniques for synthesizing hierarchically decomposed optimal design problems. Examples for designing a pressure vessel, an automotive caliper disc brake and a speed reducer are also presented.

Author(s):  
Ramprasad S. Krishnamachari ◽  
Panos Y. Papalambros

Abstract Decomposition synthesis in optimal design is the process of creating an optimal design model by selecting objectives and constraints so that it can be directly partitioned into an appropriate decomposed form. Such synthesis results are not unique since there may be many partitions that satisfy the decomposition requirements. Introducing suitable criteria an optimal decomposition synthesis process can be defined in a manner analogous to optimal partitioning formulations. The article presents an integer programming formulation and solution techniques for synthesizing hierarchically decomposed optimal design problems. Examples for designing a pressure vessel, an automotive caliper disc brake and a speed reducer are also presented.


VLSI Design ◽  
2000 ◽  
Vol 11 (4) ◽  
pp. 381-396
Author(s):  
Chaeryung Park ◽  
Taewhan Kim ◽  
C. L. Liu

This paper presents an integrated approach to data path synthesis which solves three important design problems: scheduling, allocation, and hardware partitioning with power minimization as a key design objective. Based on the rules of thumbs introduced in prior work on synthesis for low power we derive an integer programming formulation for solving the problems. We then, based on the formulation, develop an efficient algorithm which performs scheduling, allocation and hardware partitioning simultaneously so that the effects of them on power consumption are exploited more fully and effectively. Our experimentation results show that the algorithm is quite effective, producing designs with significant savings in power consumption.


2013 ◽  
Vol 376 ◽  
pp. 327-330 ◽  
Author(s):  
Ming Hua Lin ◽  
Jung Fa Tsai

The mathematical model for optimal design of a speed reducer is a generalized geometric programming problem that is non-convex and not easy be globally solved. This paper applies a deterministic approach including convexification strategies and piecewise linearization techniques to globally solve speed reducer design problems. A practical speed reducer design problem is solved to demonstrate that this study obtains a better solution than other methods.


Sign in / Sign up

Export Citation Format

Share Document