• Communications of the Korean Mathematical Society
• /
• v.36 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.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.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.58-65
• /
• 2002

When we estimate the optimal solution satisfy the objective function and subjective equation in the integer programming, The optimal solution of the objective function Z is decided by the positive integer at extreme point or revised extreme point in the convex set. The convex set is made up the linear subjective equation. The purpose of the paper is thus to establish a stepwise optimization in the integer programming model by estimating the variation △C/sub j/ of the constant term C/sub j/ in the linear objective function, after an application of the modified Branch & Bound method.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.86-92
• /
• 2015

A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.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.

• Transactions of Materials Processing
• /
• v.11 no.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.

• Journal of the Korean Mathematical Society
• /
• v.46 no.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
• /
• v.14 no.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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• 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).

• The Mathematical Education
• /
• v.28 no.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.