• 대한수학회논문집
• /
• 제36권1호
• /
• pp.103-119
• /
• 2021

In this article, we study a system of generalized set-valued parametric ordered variational inclusion problems with operator ⊕ in ordered Banach spaces. We introduce the concept of the resolvent operator associated with (α, λ)-ANODSM set-valued mapping and establish the existence theorem of solution for the system of generalized set-valued parametric ordered variational inclusion problems in ordered Banach spaces. In order to prove the existence of solution, we suggest an iterative algorithm and discuss the convergence analysis under some suitable mild conditions.

• 한국컴퓨터정보학회논문지
• /
• 제20권12호
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• 한국산업정보학회논문지
• /
• 제7권1호
• /
• pp.58-65
• /
• 2002

정수계획법모형에서 목적함수와 선형 제약조건식에 만족하는 최적해를 유도할 때, 선형 제약조건식으로 이루어지는 모든 가능해의 Convex set K에서 정수인 extreme point 또는 수정된 정수인 extreme point를 유도하여 목적함수Z의 최적해로 결정한다. 본 논문에서는 기저변수 벡터 $X_{B}$의 성분이 정수가 아닐 때 Branch & Bound 방법을 확장하여 $X_{B}$가 정수가 되도록 한다. 그리고 목적함수의 계수 $C_{j}$의 변동에 의하여 단계적으로 변하는 최적화를 유도함을 목적으로 한다. 한다.

• 정보과학회 논문지
• /
• 제42권1호
• /
• pp.86-92
• /
• 2015

레벨 셋 트리는 다차원에 정의된 확률 밀도 함수를 표현하는데 유용하다. 복잡한 데이터의 구조를 트리 형태로 시각화하여 데이터의 형태를 효율적으로 파악할 수 있으며 클러스터링 분석에 효과적으로 이용할 수 있다. 본 논문에서는 미지의 확률 밀도 함수에서 생성된 데이터 샘플로부터 레벨 셋 트리를 생성하는 알고리즘을 제안한다. 제안된 알고리즘은 레벨을 0에서부터 무한대로 증가시키며 밀도 함수의 각 레벨 셋을 추정하고, 이로부터 레벨 셋 트리를 생성한다. 이를 위해 본 논문에서는 one-class 서포트 벡터 머신 (OC-SVM)을 이용하여 직접적으로 레벨 셋을 추정한다. 이때 다양한 레벨 값에 대해 OC-SVM 학습을 반복해야 하는데, OC-SVM 솔루션 path 알고리즘을 통해 빠른 시간 안에 모든 레벨값에 해당하는 레벨 셋를 추정할 수 있다.

• 한국경영과학회지
• /
• 제27권2호
• /
• pp.153-171
• /
• 2002

In this paper, we present an efficient pricing strategy, the pivot and probe Algorithm for Network Flow Problems(PAPANET), specifically for solving capacitated, linear network flow problem (NPs). The PAPANET begins with an initial relaxed network problem(RNP), consisting of all the nodes and initial candidate arcs(possibly a few least cost arcs form the original problem and a set of all the artificial and slack arcs). After an initial solution to the RNP is derived by pivoting, the PROBE procedure identifies a set of most violated arcs from the noncandidate arcs that are not considered to be in the current RNP, and adds them to the RNP. The procedure also discards a set of least favorable, zero flow, nonbasic arcs from the RNP. The new RNP is solved to optimality and the procedure continues until all of the dual constraints of the noncandidate arcs are satisfied by the dual solution to the RNP. The PAPANET effectively reduces the problem size, time per pivot, and solution CPU time by eliminating noncandidate arcs. Computational tests on randomly generated problems indicate that PAPANET achieves and average savings of 50-80% of the solution CPU time of that of a comparable standard network simplex implementation.

• 소성∙가공
• /
• 제11권4호
• /
• pp.355-362
• /
• 2002

In this study, an axi-symmetric finite element program for elastic analysis of the die set shrink fitted in cold extrusion was developed. The geometrical constraint according to shrink fit was enforced by employing the Lagrange multiplier method. The numerical results for strain and stress distributions in the die set including single and multi stress rings assembled by shrink fit were compared well with the Lame's equation for thick-walled solution available in the literature. To extend the applicability of the analysis program developed, various cases without or with stress ring and with pre-stress applied on stress ring were numerically investigated as well. This numerical approach enables the optimization study to determine optimal dimensions of die set to improve tool life for practical use in industry.

• 대한수학회지
• /
• 제46권6호
• /
• pp.1319-1338
• /
• 2009

In this paper, using proximal-point mappings technique of Raccretive mappings and the property of the fixed point set of set-valued contractive mappings, we study the behavior and sensitivity analysis of the solution set of the system of parametric generalized quasi-variational inclusions involving R-accretive mappings in real uniformly smooth Banach space. Further under suitable conditions, we discuss the Lipschitz continuity of the solution set with respect to parameters. The technique and results presented in this paper can be viewed as extension of the techniques and corresponding results given in [3, 23, 24, 32, 33, 34].

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권3호
• /
• pp.181-187
• /
• 2014

Dealing with uncertainty is always a challenging problem. Intuitionistic fuzzy sets was presented to manage situations in which experts have some membership and non-membership value to assess an alternative. Hesitant fuzzy sets was used to handle such situations in which experts hesitate between several possible membership values to assess an alternative. In this paper, the concept of intuitionistic hesitant fuzzy set is introduced to provide computational basis to manage the situations in which experts assess an alternative in possible membership values and non-membership values. Distance measure is defined between any two intuitionistic hesitant fuzzy elements. Fuzzy technique for order preference by similarity to ideal solution is developed for intuitionistic hesitant fuzzy set to solve multi-criteria decision making problem in group decision environment. An example is given to illustrate this technique.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.353-356
• /
• 2001

In this paper, we study the existence of fuzzy solution for the following differential system with fuzzy coefficient using the different two methods: (equation omitted), where a, b is the fuzzy natural number generated by fuzzy number l . The a-level set of the fuzzy number (equation omitted). The -level set of a is (equation omitted) and -level set of b is (equation omitted).

• 한국수학교육학회지시리즈A:수학교육
• /
• 제28권1호
• /
• pp.41-45
• /
• 1989

Subdifferentiability of a vector-valued set function is defined first. Then in terms of zero-like functions, a perperly efficient solution of a convex programming problem with set functions will be characterized.