• Journal of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.1179-1194
• /
• 2015

In this paper, we introduce a new iterative algorithm for finding a common element of the set of solutions of a generalized mixed equilibrium problem related to a continuous monotone mapping, the set of solutions of a variational inequality problem for a continuous monotone mapping, and the set of fixed points of a continuous pseudocontractive mapping in Hilbert spaces. Weak convergence for the proposed iterative algorithm is proved. Our results improve and extend some recent results in the literature.

• Management Science and Financial Engineering
• /
• v.10 no.2
• /
• pp.89-102
• /
• 2004

In this paper, we deal with a processor assignment problem that minimizes the total traffic load of an ATM switch controller by optimally assigning processors to ATM interface units. We develop an integer programming (IP) model for the problem, and devise an effective tabu search heuristic. Computational results reveal the efficacy of the proposed tabu search procedure, finding a good quality solution within 5% of optimality gap.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1030-1033
• /
• 2006

In this paper, the assignment problem is considered. We propose an approach based on the solution of a sequence of shortest path sub-problem. We extend the cost reduction method, which is used for finding initial assignment, to solve these sub-problems. The use of the extended reduction method makes it possible to devise an efficient multi-augmenting algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1641-1646
• /
• 2006

This paper deals with a physical access network design problem arising from the deployment of fiber-to-the-home passive optical networks (FTTH-PON). The problem seeks to find an optimal location and capacity assignment of splitters in the network such that the total cost of fiber and splitter is minimized, while satisfying all the demand. We propose tabu search approach for finding a good feasible solution.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.829-840
• /
• 2001

Generally it is not easy task whether the stable systems governed by nonlinear ordinary differential equations are asymptotically stable or not. This problem often appears in studying a collision and avoidance control problem based on the stability theory. In this paper we devoted to finding conditions that the stable system obtained from the collision and avoidance control problem is asymptotically stable.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.1-14
• /
• 2012

In this paper, the problem of determining the optimal car-deriving strategy has been examined. In order to find the optimal driving strategy, we have modified a method based on measure theory. Further, we demonstrate that the modified method is an efficient and practical algorithm for dealing with optimal control problems in a canonical formulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1139-1144
• /
• 1990

In this paper, we consider linear periodic discrete-time control systems under periodic compensation. Such a closed-loop system generally represents a periodic time-varying system. We examine the problem of finding a compensator such that the closed-loop system is realized as LTI model (if possible) with the closed-loop stability being satisfied. We present a necessary and sufficient condition for solving such problem and also give the characterization of realizable LTI models.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.837-844
• /
• 2010

In this paper, a class of initial value problem of hyperbolic equations for fourth order with multiple characteristics is considered and can be solved analytically by variable transforms. Also, similar to Goursat's problem we present a direct integration technique for finding a new solutions of an inhomogeneous hyperbolic equation of fourth order such that the attached conditions are given on its multiple characteristics.

• Journal of the military operations research society of Korea
• /
• v.9 no.2
• /
• pp.57-60
• /
• 1983

We show that the complexity of Simplex Method for Linear Programming problem is equivalent to the complexity of finding just an adjacent basic feasible solution if exists. Therefore a simplex type method which resolves degeneracy in polynomial time with respect to the size of the given linear programming problem can solve the general linear programming problem in polynomial steps.

• East Asian mathematical journal
• /
• v.28 no.3
• /
• pp.305-320
• /
• 2012

The purpose of this paper is to introduce a hybrid projection method for finding a common element of the set of solutions of a generalized equilibrium problem, the set of solutions of a variational inclusion problem and the set of common fixed points of a finite family of strict pseudo-contractions in Hilbert spaces.