Adaptive solution of truss layout optimization problems with global stability constraints
نویسندگان
چکیده
منابع مشابه
Solution of Some Max–Separable Optimization Problems with Inequality Constraints
Let R be the set of real numbers, ⊕ is the maximum operation so that α⊕ β = max{α, β} for any α, β ∈ R. We assume further that Rn ≡ R× . . .×R (n-times, the Cartesian product). We shall solve optimization problems consisting in the minimization of function F (f(x), g(y)), where F : R2 → R1 is an isotone function and function f(x), f : Rn → R1 is defined as follows f(x) = f(x1, . . . , xn) = f1(...
متن کاملReliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملAn algorithm of global optimization for solving layout problems
The two-dimensional layout problem is known to be NP-complete, and the current research work is basically in the heuristic way. In this paper, we mainly discuss the methods for solving layout problem about the arti®cial satellite module by virtue of graph theory and group theory. Also, an algorithm of global optimization is presented ®rst time. The method given here can be extended to solve oth...
متن کاملGlobal Optimization of Nonconvex Problems with Differential-Algebraic Constraints
Differential-Algebraic Constraints William R. Esposito and Christodoulos A. Floudas Department of Chemical Engineering, Princeton University, Princeton, N.J. 08544-5263,USA Differential-algebraic systems of constraints, in particular, initial value ordinary differential equations, appear in numerous optimization problems in the chemical engineering field. A difficulty in the solution of this fo...
متن کاملGlobal solution of optimization problems with signomial parts
In this paper a new approach for the global solution of nonconvex MINLP (Mixed Integer NonLinear Programming) problems that contain signomial (generalized geometric) expressions is proposed and illustrated. By applying different variable transformation techniques and a discretization scheme a lower bounding convex MINLP problem can be derived. The convexified MINLP problem can be solved with st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural and Multidisciplinary Optimization
سال: 2019
ISSN: 1615-147X,1615-1488
DOI: 10.1007/s00158-019-02312-9