• 대한수학회지
• /
• 제40권2호
• /
• pp.287-305
• /
• 2003

Second order necessary optimality condition for properly efficient solutions of a twice differentiable vector optimization problem is given. We obtain a nonsmooth version of the second order necessary optimality condition for properly efficient solutions of a nondifferentiable vector optimization problem. Furthermore, we prove a second order necessary optimality condition for weakly efficient solutions of a nondifferentiable vector optimization problem.

• East Asian mathematical journal
• /
• 제37권5호
• /
• pp.543-551
• /
• 2021

Recently, semidefinite optimization problems have been intensively studied since many optimization problem can be changed into the problems and the the problems are very computationable. In this paper, we consider a semidefinite linear vector optimization problem (VP) and we establish the optimality theorems for (VP), which holds without any constraint qualification.

• 대한기계학회논문집A
• /
• 제30권8호
• /
• pp.889-896
• /
• 2006

The concept of reliability has been applied to the topology optimization based on a reliability index approach or a performance measure approach. Since these approaches, called double-loop single vector approach, require the nested optimization problem to obtain the most probable point in the probabilistic design domain, the time for the entire process makes the practical use infeasible. In this work, new reliability-based topology optimization method is proposed by utilizing single-loop single-vector approach, which approximates searching the most probable point analytically, to reduce the time cost. The results of design examples show that the proposed method provides efficiency curtailing the time for the optimization process and accuracy satisfying the specified reliability.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.685-692
• /
• 2009

We consider the linearized (approximated) problem for differentiable vector optimization problem, and then we establish equivalence results between a differentiable vector optimization problem and its associated linearized problem under the proper efficiency.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권2호
• /
• pp.203-207
• /
• 2008

In [1], Mishra and Wang established relationships between vector variational-like inequality problems and non-smooth vector optimization problems under non-smooth invexity in finite-dimensional spaces. In this paper, we generalize recent results of Mishra and Wang to infinite-dimensional case.

• 대한수학회보
• /
• 제30권1호
• /
• pp.1-7
• /
• 1993

Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .

• 한국공간구조학회논문집
• /
• 제8권3호
• /
• pp.75-82
• /
• 2008

본 연구에서는 방향벡터(direction vector)를 이용한 지역 탐색법과 유전자 알고리즘을 결합한 새로운 알고리즘인 D-GA를 제안한다. 새로운 개체(individual)를 찾기 위한 방향벡터로는 진화과정 중에 습득되는 정보를 활용하기 위한 학습방향벡터(Loaming direction vector)와 진화와는 무관하게 한 개체의 주변을 탐색하는 랜덤방향벡터(random direction vector) 등 두 가지를 구성하였다. 그리고, 10 부재 트러스 설계 문제에 단순 유전자 알고리즘과 D-GA를 적용하여 최적화를 수행하였고, 그 결과를 비교 검토함으로써 단순 GA에 비하여 D-GA의 정확성 및 효율성이 향상되었음을 확인하였다.

• 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.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.539-551
• /
• 2005

In this paper, sufficient optimality conditions and duality results for nonsmooth vector optimization problems are given under near invexity and infineness assumptions. Also, weak vector saddle-point theorems are obtained under near invexity-infineness assumptions.

• East Asian mathematical journal
• /
• 제39권5호
• /
• pp.505-514
• /
• 2023

In this paper, we consider a second-order cone linear fractional vector optimization problems (FVP), and obtain sequential optimality theorems for (FVP) which hold without any constraint qualification and which are expressed by sequences.