• Title/Summary/Keyword: Finding Problems

Search Result 1,197, Processing Time 0.026 seconds

FIXED POINT SOLUTION METHODS FOR SOLVING EQUILIBRIUM PROBLEMS

  • Anh, Pham Ngoc;Hien, Nguyen Duc
    • 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.

Nursing Problems Finding of Neuro-Psychiatric Patients-Obtained through a Study on the Patients Hospitalized in 3 Neuro-Psychiatric Hospitals in Busan (정신질환자의 간호문제규명-부산시내 3개 신경정신과 병동을 중심으로-)

  • Kim Eun Ja;Kim Yn Sun;Kim Gee Sook
    • The Korean Nurse
    • /
    • v.20 no.2 s.110
    • /
    • pp.62-74
    • /
    • 1981
  • From July 1 to August 16, 1980 these writers conducted a study on the problems afflicting 93 patients suffering from neuropsychosis hospitalized in neuro-psychiatric wards of three hospitals in Busan and obtained the following findings with respect to the

  • PDF

NONLINEAR ALGORITHMS FOR A COMMON SOLUTION OF A SYSTEM OF VARIATIONAL INEQUALITIES, A SPLIT EQUILIBRIUM PROBLEM AND FIXED POINT PROBLEMS

  • Jeong, Jae Ug
    • Korean Journal of Mathematics
    • /
    • v.24 no.3
    • /
    • pp.495-524
    • /
    • 2016
  • In this paper, we propose an iterative algorithm for finding a common solution of a system of generalized equilibrium problems, a split equilibrium problem and a hierarchical fixed point problem over the common fixed points set of a finite family of nonexpansive mappings in Hilbert spaces. Furthermore, we prove that the proposed iterative method has strong convergence under some mild conditions imposed on algorithm parameters. The results presented in this paper improve and extend the corresponding results reported by some authors recently.

STRONG CONVERGENCE OF A METHOD FOR VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS OF A NONEXPANSIVE SEMIGROUP IN HILBERT SPACES

  • Buong, Nguyen
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.61-74
    • /
    • 2011
  • In this paper, we introduce a new iteration method based on the hybrid method in mathematical programming and the descent-like method for finding a common element of the solution set for a variational inequality and the set of common fixed points of a nonexpansive semigroup in Hilbert spaces. We obtain a strong convergence for the sequence generated by our method in Hilbert spaces. The result in this paper modifies and improves some well-known results in the literature for a more general problem.

STRONG CONVERGENCE THEOREM OF COMMON ELEMENTS FOR EQUILIBRIUM PROBLEMS AND FIXED POINT PROBLEMS

  • Zhang, Lijuan;Hou, Zhibin
    • East Asian mathematical journal
    • /
    • v.26 no.5
    • /
    • pp.599-605
    • /
    • 2010
  • In this paper, we introduce an iterative method for finding a common element of the set of solutions of an equilibrium problem, the set of common fixed points of an asymptotically strictly pseudocontractive mapping in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the two sets.

A Study of Buffer Allocation in FMS based on Deadlock and Workload (Deadlock과 Workload에 따른 FMS의 버퍼 Capacity 결정에 관한 연구)

  • 김경섭;이정표
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.2
    • /
    • pp.63-73
    • /
    • 2000
  • Due to the complexity of part flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A dynamic programming algorithm to solve the buffer allocation problem is proposed. Computer simulation using Arena is experimented to show the validation of the proposed algorithm.

  • PDF

Analysis of Quotitive Division as Finding a Scale Factor in Enlargement Context (확대 상황 포함나눗셈에 대한 고찰)

  • Yim, Jaehoon
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.21 no.1
    • /
    • pp.115-134
    • /
    • 2017
  • It is necessary to understand the characteristics of each type of division problems in other to help students develop a rich understanding when they learn each type of division problems. This study focuses on a specific type of division problems; a quotitive division as finding a scale factor in enlargement context. First, this study investigated via survey how 4th-6th graders and preservice and inservice elementary teachers solved a quotitive division relating to scaling problem. And semi-structured interviews with preservice and inservice elementary teachers were conducted to explore what knowledge they brought when they tried to solve enlargement quotitive division problems. Most of participants solved the given quotitive division problem in the same way. Only a few preservice and inservice teachers interpreted it as a proportion problem and solved in a different way. From the interviews, it was found that different conceptions of context and decontextualization, and different conceptions of times (as repeated addition or as a multiplicative operator) were connected to different solutions. Finally, three issues relating to teaching enlargement quotitive division were discussed; visual representation of two solutions, conceptions connected each solution, and integrating quotitive division and proportion in math textbooks.

  • PDF

A Heuristic Algorithm for Crew Scheduling Problems (발견적 승무계획 해법의 연구)

  • 김정식
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.9 no.13
    • /
    • pp.79-86
    • /
    • 1986
  • This paper presents a heuristic algorithm for a crew scheduling problem with dead head flights. This paper modifies and improves saving method for finding the Multiple Salesman tours in the graph. The results show that the computing time from this algorithm is implemented very much than those from general crew scheduling algorithms by set covering models.

  • PDF

Robust control for linear systems with structured uncertainty (구조적 불확실성을 갖는 프로세스의 robust control)

  • 김영철;박용식;양흥석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.457-460
    • /
    • 1989
  • This note considers the problems of finding a pole assignment controller for a plant with parameter perturbations. Based on Kharitonov's theorem and its generalized results, we propose a design method of controller using linear transformations such that it guarantees the desired damping ratio.

  • PDF