• Bulletin of the Society of Naval Architects of Korea
• /
• v.17 no.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
• /
• 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.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.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
• /
• v.41 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.13 no.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.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• 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.

• Journal of computational fluids engineering
• /
• v.5 no.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)
• /
• v.11 no.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.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.3
• /
• pp.212-217
• /
• 2007

The Alienor method is a powerful tool for solving global optimization problems. It allows the transformation of a multi-variable problem into a new one that depends on a single variable. Any one-dimensional global optimization method can then be used to solve the transformed problem. Several one-dimensional global optimization methods coupled with the Alienor method have been suggested by mathematicians and it is shown that the suggested methods are successful for test functions. However, there are problems with these methods in engineering practice. In this paper, Lipschitzian optimization without using the Lipschitz constant is coupled with the Alienor method and applied to the test functions. Using test functions, it is shown that the suggested method can be successfully applied to global optimization problems.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.3
• /
• pp.233-238
• /
• 2008

In this paper, a shape design optimization method for linearly elastic problems is developed using isogeometric approach. In many design optimization problems for practical engineering models, initial raw data usually come from a CAD modeler. Then, designers should convert the CAD data into finite element mesh data since most of conventional design optimization tools are based on finite element analysis. During this conversion, there are some numerical errors due to geometric approximation, which causes accuracy problems in response as well as design sensitivity analyses. As a remedy for this phenomenon, the isogeometric analysis method can be one of the promising approaches for the shape design optimization. The main idea of isogeometric approach is that the basis functions used in analysis is exactly the same as the ones representing the geometry. This geometrically exact model can be used in the shape sensitivity analysis and design optimization as well. Therefore the shape design sensitivity with high accuracy can be obtained, which is very essential for a gradient-based optimization. Through numerical examples, it is verified that the shape design optimization based on an isogeometic approach works well.