• 충청수학회지
• /
• 제27권3호
• /
• pp.433-438
• /
• 2014

A semi-infinite optimization problem involving a quasi-convex objective function and infinitely many convex constraint functions with data uncertainty is considered. A surrogate duality theorem for the semi-infinite optimization problem is given under a closed and convex cone constraint qualification.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.351-360
• /
• 2005

This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.227-235
• /
• 2004

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

• Korean Journal of Mathematics
• /
• 제5권1호
• /
• pp.83-89
• /
• 1997

In this paper we generalize the concept of normality for the problem involving set functions in a view of Jahn. The main result is that the problem with Slater's constraint qualification is normal and stable.

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

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

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1395-1407
• /
• 2011

When a Sequential Quadratic Programming (SQP) method is used to solve the nonlinear programming problems, one of the main difficulties is that the Quadratic Programming (QP) subproblem may be incompatible. In this paper, an SQP algorithm is given by modifying the traditional QP subproblem and applying a class of $l_{\infty}$ penalty function whose penalty parameters can be adjusted automatically. The new QP subproblem is compatible. Under the extended Mangasarian-Fromovitz constraint qualification condition and the boundedness of the iterates, the algorithm is showed to be globally convergent to a KKT point of the non-linear programming problem.

• 대한수학회지
• /
• 제44권4호
• /
• pp.971-985
• /
• 2007

A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and ${\epsilon}$-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we present a proposition with a sufficient condition for an efficient solution to be properly efficient, which are a generalization of the well-known Isermann result for a linear vector optimization problem. An example is given to illustrate the significance of our main results. Also, we give an example showing that the proper efficiency may not imply certain closeness assumption.

• Korean Journal of Mathematics
• /
• 제30권3호
• /
• pp.475-489
• /
• 2022

This paper focuses on a robust semi-infinite interval-valued optimization problem with uncertain inequality constraints (RSIIVP). By employing the concept of LU-optimal solution and Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ), necessary optimality conditions are established for (RSIIVP) and then sufficient optimality conditions for (RSIIVP) are derived, by using the tools of convexity. Moreover, a Wolfe type dual problem for (RSIIVP) is formulated and usual duality results are discussed between the primal (RSIIVP) and its dual (RSIWD) problem. The presented results are demonstrated by non-trivial examples.

• 한국항공우주학회지
• /
• 제41권10호
• /
• pp.827-832
• /
• 2013

극초소형 위성으로 분류되는 큐브위성의 경우, 1U를 기준으로 $10cm{\times}10cm{\times}10cm$의 크기, 1kg 이하의 중량제한을 비롯해 폭발식 구속분리장치의 적용이 불가한 설계요구조건으로 인하여 열선 작동시 나일론선의 절단과 함께 구속을 해제하는 구속분리 방식이 일반적으로 적용되고 있으나 낮은 체결력과 다수 구조물의 구속 시 다수의 열선 적용을 필요로 하는 등 시스템 복잡화의 단점이 존재한다. 본 논문에서는 기존의 큐브위성에 적용되는 열선 절단방식의 단점을 극복하기 위하여 열선절단방식을 적용한 분리너트형 비폭발식 구속분리장치를 고안하였으며, 인증모델의 기능시험, 정하중시험 및 충격시험을 통해 설계 유효성을 입증하였다.