VILNIUS TECH University Research Management System (CRIS)
Use this URL to cite this publication: https://hdl.handle.net/20.500.14911/141154

Perrinkimo algoritmų taikymas diskrečiųjų struktūrų optimizavime

Publication Type (CRIS)
Straipsnis nerecenzuojamoje Lietuvos konferencijos medžiagoje / Article in non-peer-reviewed Lithuanian conference proceedings (P2c)
Publication Type (eLABa)
Straipsnis nerecenzuotame konferencijos darbų leidinyje / Article in an un-reviewed conference proceedings (P2)
Author(s)
AuthorAffiliation
Dembovskij, Aleksandr  
Fundamentinių mokslų fakultetas / Faculty of Fundamental Sciences (10)  
Title
Perrinkimo algoritmų taikymas diskrečiųjų struktūrų optimizavime
[lt]
Aleksandr Dembovskij
Title in other language
The usage of re- election algorithms in discreet structures optimization
[en]
Is part of
Matematika (2006 m.balandžio 20 d.). Informatika (2006 m. balandžio 12-13 d.d.): 9-osios Lietuvos jaunųjų mokslininkų konferencijos Mokslas - Lietuvos ateitis medžiaga
Published In
YearStart PageEnd Page
2006
86
93
Publisher
Vilnius : Technika, 2006
Extent
p. 86-93
URI
URI
https://hdl.handle.net/20.500.14911/141154
Cited references
5
Science / Art Area
Gamtos mokslai / Natural Sciences (N)
Field of Science / Art
Matematika / Mathematics (N001)
Abstract (en)

In this work offered an unique discreet structure optimiation technique, when for optimization areused ANSYS structures optimization algorithms. In this paper is described how the plate topological optimization principles can be used for discreet structures topological optimization. There is trying to find the ways for move from one structure to another, there is given a mathematical formulation for structure optimization, analyzed ANSYS programming capabilities for solving this type of tasks.

Resource Type (COAR)
TextConference outputConference proceedingsConference paper
Language
Lietuvių / Lithuanian (lt)
Country
Lietuva / Lithuania (LT)
ISBN (of the container)
9986059976
eLABa ID
3741155