• 대한조선학회지
• /
• 제17권4호
• /
• pp.46-54
• /
• 1980

The ship structural design problem is formulated as a general nonlinear optimization problem with constraints. Characteristics of the general structural problems and various optimization techniques are discussed, with special emphasis on penalty function method for constrained problems. A simple example of the solution of a midship structure design of cargo vessel, which complies with the rules of the Korean Register of Shipping is shown using SUMT-exterior method with some search methods.

• East Asian mathematical journal
• /
• 제27권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.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제5권2호
• /
• pp.137-147
• /
• 2001

Nonconvex Quadratic Optimization Problems (QOP) are solved approximately by SDP (semidefinite programming) relaxation and SOCP (second order cone programmming) relaxation. Nonconvex QOPs with special structures can be solved exactly by SDP and SOCP. We propose a method to formulate general nonconvex QOPs into the special form of the QOP, which can provide a way to find more accurate solutions. Numerical results are shown to illustrate advantages of the proposed method.

• Journal of applied mathematics & informatics
• /
• 제41권6호
• /
• pp.1419-1432
• /
• 2023

In this study, we take into account interval-valued vector optimization problems (IVOP) and obtain their relationships to interval vector variational inequalities (IVVI) of Stampacchia and Minty kind in aspects of convexificators, as well as the (IVOP) LU-efficient solution under the LU-convexity assumption. Additionally, we examine the weak version of the (IVVI) of the Stampacchia and Minty kind and determine the relationships between them and the weakly LU-efficient solution of the (IVOP). The results of this study improve and generalizes certain earlier results from the literature.

• 대한산업공학회지
• /
• 제13권1호
• /
• pp.61-67
• /
• 1987

A tool for optimizing simulated discrete variable stochastic systems, SIMICOM was developed and presented in [5]. In this paper an evaluation of its performance and results of comparisons with other popular methods for dealing with simulation-optimization problems will be provided. Based on several test problems it is concluded that SIMICOM dominates those methods.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.463-467
• /
• 2008

Heuristic optimization using hybrid algorithms have provided a robust and efficient approach for solving many optimization problems. In this paper, a new hybrid algorithm using adaptive genetic algorithm (aGA) and particle swarm optimization (PSO) is proposed. The proposed hybrid algorithm is applied to solve numerical optimization functions. The results are compared with those of GA and other conventional PSOs. Finally, the proposed hybrid algorithm outperforms others.

• 한국전산유체공학회지
• /
• 제5권2호
• /
• pp.55-63
• /
• 2000

In this paper, the numerical study has been done for the improvement of the superdetonative ram accelerator performance and for the design optimization of the system. The objective function to optimize the premixture composition is the ram tube length, required to accelerate projectile from initial velocity V/sub 0/ to target velocity V/sub e/. The premixture is composed of H₂, O₂, N₂ and the mole numbers of these species are selected as design variables. RSM(Response Surface Methodology) which is widely used for the complex optimization problems is selected as the optimization technique. In particular, to improve the non-linearity of the response and to consider the accuracy and the efficiency of the solution, design space stretching technique has been applied. Separate sub-optimization routine is introduced to determine the stretching position and clustering parameters which construct the optimum regression model. Two step optimization technique has been applied to obtain the optimal system. With the application of stretching technique, we can perform system optimization with a small number of experimental points, and construct precise regression model for highly non-linear domain. The error compared with analysis result is only 0.01% and it is demonstrated that present method can be applied to more practical design optimization problems with many design variables.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4357-4378
• /
• 2017

In cooperative multi-relay networks, the relay nodes which are selected are very important to the system performance. How to choose the best cooperative relay nodes is an optimization problem. In this paper, multi-relay selection schemes which consider either single objective or multi-objective are proposed based on evolutionary algorithms. Firstly, the single objective optimization problems of multi-relay selection considering signal to noise ratio (SNR) or power efficiency maximization are solved based on the quantum bee colony optimization (QBCO). Then the multi-objective optimization problems of multi-relay selection considering SNR maximization and power consumption minimization (two contradictive objectives) or SNR maximization and power efficiency maximization (also two contradictive objectives) are solved based on non-dominated sorting quantum bee colony optimization (NSQBCO), which can obtain the Pareto front solutions considering two contradictive objectives simultaneously. Simulation results show that QBCO based multi-relay selection schemes have the ability to search global optimal solution compared with other multi-relay selection schemes in literature, while NSQBCO based multi-relay selection schemes can obtain the same Pareto front solutions as exhaustive search when the number of relays is not very large. When the number of relays is very large, exhaustive search cannot be used due to complexity but NSQBCO based multi-relay selection schemes can still be used to solve the problems. All simulation results demonstrate the effectiveness of the proposed schemes.

• 한국항공우주학회지
• /
• 제35권3호
• /
• pp.212-217
• /
• 2007

Alienor method는 전역적 최적화 문제들을 해결하기위한 효과적인 방법이다. 이 방법은 다변수 문제를 한 개의 변수에 의존하는 문제로 변환시킨다. 어떠한 일차원 전역 최적화 방법도 변환된 문제의 해결에 사용할 수 있다. Alienor method와 연결된 여러 가지의 일차원 전역 최적화 방법들이 수학적으로 제안되었으며, 제안된 방법들은 예제를 통하여 성공적으로 증명되었다. 그러나 실제 엔지니어링 문제에 이 방법들을 적용하기에는 여러 가지 문제가 있다. 본 논문에서는 Lipschitz 상수를 사용하지 않는 Lipschitzian 최적화 방법이 Alienor method와 결합되었고, 이 결합된 최적화 알고리즘을 예제에 적용하였다. 본 예제를 통하여 제안된 방법이 보다 우수하게 전역적 최적화 문제에 적용 가능함을 보였다

• 한국전산구조공학회논문집
• /
• 제21권3호
• /
• pp.233-238
• /
• 2008

본 논문에서는 등기하 해석법을 이용하여 선형 탄성문제에 대한 형상 최적설계 기법을 개발하였다. 실용적인 공학문제에 대한 많은 최적설계 문제에서는 초기의 데이터가 CAD 모델로부터 주어지는 경우가 많다. 그러나 대부분의 설계 최적화 도구들은 유한요소법에 기초하고 있기 때문에 설계자는 이에 앞서 CAD 데이터를 유한요소 데이터로 변환해야 한다. 이 변환과정에서 기하 모델의 근사화에 따른 수치적 오류가 발생하게 되고, 이는 응답 해석뿐만 아니라 설계민감도 해석에 있어서도 정확도 문제를 발생시킨다. 이러한 점에서 등기하 해석법은 형상 최적설계에 있어서 유망한 방법론 중 하나가 될 수 있다. 등기하 해석법의 핵심은 해석에 사용되는 기저 함수와 기하 모델을 구성하는 함수가 정확히 일치한다는 것이다. 이러한 기하학적으로 정확한 모델은 설계민감도 해석 및 형상 최적설계에 있어서도 사용된다. 이로 인해 높은 정확도의 설계민감도를 얻을 수 있으며, 이는 설계구배 기반의 최적화에 있어서 매우 중요하게 작용한다. 수치 예제를 통하여 본 논문에서 제시된 등기하 해석 기반의 형상 최적설계 방법론이 타당함을 확인하였다.