• Title/Summary/Keyword: Optimization problem

Search Result 4,343, Processing Time 0.035 seconds

ON OPTIMIZATION OF METAL FORMING WITH ADAPTABLE CHARACTERISTICS

  • Gitman, Michael B.;Trusov, Peter V.;Redoseev, Sergei A.
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.2
    • /
    • pp.507-516
    • /
    • 2000
  • In the present paper we consider a problem of choosing the rational way to carry on the metal processing (the problem of stochastic optimization) and the problem of determing the unknown characteristics of parameters described with random variables.

Redundancy Optimization under Multiple Constraints (다제약식하에서의 최적중복설계에 관한 연구)

  • Yun Deok-Gyun
    • Journal of the military operations research society of Korea
    • /
    • v.11 no.2
    • /
    • pp.53-63
    • /
    • 1985
  • This paper presents a multi-costraint optimization model for redundant system reliability. The optimization model is usually formulated as a nonlinear integer programming (NIP) problem. This paper reformulates the NIP problem into a linear integer programming (LIP) problem. Then an efficient 'Branch and Straddle' algorithm is proposed to solve the LIP problem. The efficiency of this algorithm stems from the simultaneous handling of multiple variables, unlike in ordinary branch and bound algorithms. A numerical example is given to illustrate this algorithm.

  • PDF

Optimal algorithm of part-matching process using neural network (신경 회로망을 이용한 부품 조립 공정의 최적화 알고리즘)

  • 오제휘;차영엽
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.143-146
    • /
    • 1996
  • In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.

  • PDF

Comparison of the trajectory optimization methods for multi-stage solid boost launcher (다단 고체연료 우주발사체의 비행궤적 최적화기법 비교)

  • 진재현;탁민제
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.413-418
    • /
    • 1991
  • Two methods are applied to the problem of trajectory optimization for launch vehicles which burn solid propellant. One is 'Optimal Control' theory, the other is 'NonLinear Programming' method. Trajectory optimization for solid rocket motors has a special problem. The special problem is that the payload of launch vehicle is not the function of control variable. This paper deals with this special problem.

  • PDF

Optimization in Reliability Design with Lognormally Stress and Lognormally Strength (부하와 강도가 대수정규분포를 하는 신뢰성 설계에서 최적화에 관한 연구(II))

  • 김복만;황의철
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.22
    • /
    • pp.25-34
    • /
    • 1990
  • This paper is to maximize the reliability subject to certain constraints on amounts of resources available for control of the parameters. The lagrange multiplier method is used to optimize t-th lognormal stress-lognormal strength problem. This optimization problem can be reduced to a search problem in one variable. A numerical example is presented to illustrate the optimization problem.

  • PDF

ON DUALITY FOR NONCONVEX QUADRATIC OPTIMIZATION PROBLEMS

  • Kim, Moon-Hee
    • East Asian mathematical journal
    • /
    • v.27 no.5
    • /
    • pp.539-543
    • /
    • 2011
  • In this paper, we consider an optimization problem which consists a nonconvex quadratic objective function and two nonconvex quadratic constraint functions. We formulate its dual problem with semidefinite constraints, and we establish weak and strong duality theorems which hold between these two problems. And we give an example to illustrate our duality results. It is worth while noticing that our weak and strong duality theorems hold without convexity assumptions.

Use of design optimization techniques in solving typical structural engineering related design optimization problems

  • Fedorik, Filip;Kala, Jiri;Haapala, Antti;Malaska, Mikko
    • Structural Engineering and Mechanics
    • /
    • v.55 no.6
    • /
    • pp.1121-1137
    • /
    • 2015
  • High powered computers and engineering computer systems allow designers to routinely simulate complex physical phenomena. The presented work deals with the analysis of two finite element method optimization techniques (First Order Method-FOM and Subproblem Approximation Method-SAM) implemented in the individual Design Optimization module in the Ansys software to analyze the behavior of real problems. A design optimization is a difficult mathematical process, intended to find the minimum or maximum of an objective function, which is mostly based on iterative procedure. Using optimization techniques in engineering designs requires detailed knowledge of the analyzed problem but also an ability to select the appropriate optimization method. The methods embedded in advanced computer software are based on different optimization techniques and their efficiency is significantly influenced by the specific character of a problem. The efficiency, robustness and accuracy of the methods are studied through strictly convex two-dimensional optimization problem, which is represented by volume minimization of two bars' plane frame structure subjected to maximal vertical displacement limit. Advantages and disadvantages of the methods are described and some practical tips provided which could be beneficial in any efficient engineering design by using an optimization method.

A Hybrid Genetic Algorithm for Generating Cutting Paths of a Laser Torch (레이저 토치의 절단경로 생성을 위한 혼합형 유전알고리즘)

  • 이문규;권기범
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.12
    • /
    • pp.1048-1055
    • /
    • 2002
  • The problem of generating torch paths for 2D laser cutting of a stock plate nested with a set of free-formed parts is investigated. The objective is to minimize the total length of the torch path starting from a blown depot, then visiting all the given Parts, and retuning back to the depot. A torch Path consists of the depot and Piercing Points each of which is to be specified for cutting a part. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem To solve the problem, a hybrid genetic algorithm is proposed. In order to improve the speed of evolution convergence, the algorithm employs a genetic algorithm for global search and a combination of an optimization technique and a genetic algorithm for local optimization. Traditional genetic operators developed for continuous optimization problems are used to effectively deal with the continuous nature of piercing point positions. Computational results are provided to illustrate the validity of the proposed algorithm.

Dynamic System Identification Using the Topology Optimization Method (위상최적설계 기법을 이용한 동적 시스템 규명)

  • Lee, Joong-Seok;Kim, Jae-Eun;Kim, Yoon-Young
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.05a
    • /
    • pp.120-123
    • /
    • 2005
  • A dynamic system identification technique based on the topology optimization method is developed. The specific problem in consideration is the damage location identification of a plate structure using the Frequency Response Function (FRF) of a damaged structure. In this work, the identification problem is formulated as a topology optimization problem. The importance of using anti-resonance information in addition to using resonance information is addressed. Though a simple problem was considered here, the possibility of using the topology optimization for damage identification is investigated lot the first time.

  • PDF