Shape Optimization as a Discrete Optimization Problem — Solution Procedures Using Continuous Approximations

1989 ◽  
pp. 40-47
Author(s):  
Martin Philip Bendsøe
Keyword(s):  
Shape Optimization ◽  
Discrete Optimization ◽  
Optimization Problem ◽  
Problem Solution ◽  
Discrete Optimization Problem ◽  
Continuous Approximations

Optimal Viscous Damper Placement Using Level Set Topology Optimization Method

2010 ◽  
Author(s):  
Masoud Ansari ◽  
Amir Khajepour ◽  
Ebrahim Esmailzadeh
Keyword(s):  
Topology Optimization ◽  
Level Set ◽  
Discrete Optimization ◽  
Optimization Problem ◽  
Minimum Energy ◽  
Optimization Method ◽  
Discrete Optimization Problem ◽  
Placement Problem ◽  
New Approach ◽  
Optimal Damping

Vibration control has always been of great interest for many researchers in different fields, especially mechanical and civil engineering. One of the key elements in control of vibration is damper. One way of optimally suppressing unwanted vibrations is to find the best locations of the dampers in the structure, such that the highest dampening effect is achieved. This paper proposes a new approach that turns the conventional discrete optimization problem of optimal damper placement to a continuous topology optimization. In fact, instead of considering a few dampers and run the discrete optimization problem to find their best locations, the whole structure is considered to be connected to infinite numbers of dampers and level set topology optimization will be performed to determine the optimal damping set, while certain number of dampers are used, and the minimum energy for the system is achieved. This method has a few major advantages over the conventional methods, and can handle damper placement problem for complicated structures (systems) more accurately. The results, obtained in this research are very promising and show the capability of this method in finding the best damper location is structures.

scholarly journals Are Stable Instances Easy?

2012 ◽  
Vol 21 (5) ◽  
pp. 643-660 ◽  
Author(s):  
YONATAN BILU ◽  
NATHAN LINIAL
Keyword(s):  
Polynomial Time ◽  
Discrete Optimization ◽  
Optimization Problem ◽  
Discrete Optimization Problem ◽  
Hard Problem ◽  
Np Hard ◽  
Max Cut Problem ◽  
Np Hard Problem ◽  
Hard Problems ◽  
Np Hard Problems

We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP-hard problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard problem. The paper focuses on the Max-Cut problem, for which we show that this is indeed the case.

scholarly journals CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS

2011 ◽  
Vol 03 (01) ◽  
pp. 101-119 ◽  
Author(s):  
VARDGES MELKONIAN
Keyword(s):  
Discrete Optimization ◽  
Related Problem ◽  
Optimization Problem ◽  
Reliability Theory ◽  
Logic Circuit ◽  
Discrete Optimization Problem ◽  
Combinatorial Algorithm ◽  
Circuit Integration

Reducing the size of a logic circuit through lattice identities is an important and well-studied discrete optimization problem. In this paper, we consider a related problem of integrating several circuits into a single hypercircuit using the recently developed concept of lattice hyperterms. We give a combinatorial algorithm for integrating k-out-of-n symmetrical diagrams which play an important role in reliability theory. Our results show that the integration can reduce the number of circuit gates by more than twice.

Sign in / Sign up

Export Citation Format

Share Document