• Korean Journal of Computational Design and Engineering
• /
• v.18 no.1
• /
• pp.49-57
• /
• 2013

In this paper, orthogonal projection of a point onto a 2D planar curve is discussed. The problem is formulated as finding a point on a curve where the tangent of the curve is perpendicular to the vector connecting the point on the curve and a point in the space. Existing methods are compared and novel approaches to solve the problem are presented. The proposed methods are tested with examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.41-50
• /
• 1997

In this paper, we presents the method for finding the compensatory solution for fuzzy multiobjective nonlinear programming problem with fuzzy parameters involved in the problem-formulation process and fuzzy equal goals of the decision maker for each of the objective functions. The fuzzy parameters in the objective functions and the constraints characterized by fuzzy numbers. The proposed method can be applied to case with multiobjective problems and guarantee an efficient solution. An illustrative numerical example is presented.

• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.467-478
• /
• 2016

In this paper, we propose an Ishikawa-type extra-gradient iterative algorithm for finding a solution of split feasibility, fixed point problems and equilibrium problems of quasi-nonexpansive mappings. It is proven that under suitable conditions, the sequences generated by the proposed iterative algorithms converge weakly to a solution of the split feasibility, fixed point problems and equilibrium problems. An example is given to illustrate the main result of this paper.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.161-173
• /
• 2009

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inverse-strongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extend and improve the corresponding results announced by many others.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.375-388
• /
• 2013

In this paper, we introduce an iterative sequence for finding solution of a system of mixed equilibrium problems and the set of fixed points of a nonexpansive mapping in Hilbert spaces. Then, the weak and strong convergence theorems are proved under some parameters controlling conditions. Moreover, we apply our result to fixed point problems, system of equilibrium problems, general system of variational inequalities, mixed equilibrium problem, equilibrium problem and variational inequality.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.2
• /
• pp.109-116
• /
• 1989

In many cases, production-inventory systems involves significant demand variations. Actual demand is probabilistic and the production capacity is also limited. Finding the proper production lot sizes to this problem usually requires heavy computational procedures. Therefore a heuristic approach were under various assumptions is highly recommended. In this paper, an approach with consideration of probabilistic demand and limited production capacity is proposed.

• Communications of the Korean Mathematical Society
• /
• v.27 no.3
• /
• pp.505-512
• /
• 2012

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mappings and nonspreading mappings and the set of solution of an equilibrium problem on the setting of real Hilbert spaces.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.479-499
• /
• 2014

In this paper, we propose new iteration methods for finding a common point of the solution set of a pseudomonotone equilibrium problem and the solution set of a monotone equilibrium problem. The methods are based on both the extragradient-type method and the viscosity approximation method. We obtain weak convergence theorems for the sequences generated by these methods in a real Hilbert space.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.1-18
• /
• 1993

The family disaggregation model of hierarchical production planning (HPP) is the problem of (0 -1) mixed integer programming that minimizes the total sum of setup costs and inventory holding costs over the planning horizon. This problem is hard in a practical sense since optimal solution algorithms have failed to solve it within reasonable computation times. Thus effective familoy disaggregation algorithm should be developed for HPP. The family disaggregation algorithm developed in this paper consists of the first stage of finding initial solutions and the second stage of improving initial solutions. Some experimental results are given to verify the effectiveness of developed disaggregation algorithm.

• Communications of the Korean Mathematical Society
• /
• v.15 no.1
• /
• pp.143-153
• /
• 2000

In [8], Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we propose the block diagonal preconditioners. The preconditioned conjugate residual method is robust in that the convergence is uniform as the parameter, v, goes to $\sfrac{1}{2}$. Computational experiments are included.