• Journal of The Korean Society of Integrative Medicine
• /
• v.11 no.1
• /
• pp.71-78
• /
• 2023

Purpose : This study was purposed to analyze the effectiveness of PBL (Problem-Based Learning) classes and to derive class improvement plans. Methods : The subjects of the study were 48 students who took the 4th grade clinical dental hygiene course at S University located in Chungcheongnam-do of South Korea in 2021. A single-group pre and post experimental study was designed to verify whether there were significant changes in the research variables of students who participated in the class to which problem-based learning was applied. A paired-sample t-test was conducted for the collected data of 46 respondents. Results : As a result, the degree of improvement in problem clarification, cause analysis, and alternative development among the five sub-areas of problem-solving ability was statistically significant. This means that the problem-based learning class positively affects dental hygiene major students' ability to clarify problems, the ability to analyze causes to collect and analyze information, and the ability to develop alternatives to make decisions, thereby improving overall problem-solving abilities. However, the improved post-score was not statistically significant in the planning/execution and performance evaluation of the remaining two subdomains. In addition, post-scores of the leader aspect, opinion exchange, opinion evaluation, and opinion integration, which are sub-domains of collaborative self-efficacy, all showed great statistical significance. Problem-based learning improved the collaborative efficacy of dental hygiene major students overall by positively influencing the ability to lead a team, exchange and evaluate each other's views, and constructively integrate different views. Conclusion : It was found that both the subject's problem-solving ability and cooperation efficiency improved under the influence of problem-based learning. On the other hand, implications for improvement of the future class such as the necessity of supplementing strategies to promote planning and execution ability for problem solving, and ability to evaluate problem solving performance was suggested.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.853-867
• /
• 2013

In this paper a methodology is developed to solve a nonlinear fractional programming problem, whose objective function and constraints are interval valued functions. Interval valued convex fractional programming problem is studied. This model is transformed to a general convex programming problem and relation between the original problem and the transformed problem is established. These theoretical developments are illustrated through a numerical example.

• Education of Primary School Mathematics
• /
• v.7 no.1
• /
• pp.1-14
• /
• 2003

The purpose of this research is to explore teachers' role actions in teaching mathematical problem solving and to analyze the influences of the teachers'role actions on their students' activities and beliefs about problem solving. The results obtained in this study suggested that the teachers' role actions brought qualitative differences to students' activities, and students' beliefs about mathematical problem solving were consistent with the perspective held by their teachers. Therefore, teachers should help students build up desirable beliefs about problem solving. They should understand teaching mathematical problem solving and play proper roles in various situations of teaching mathematical problem solving.

• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.21-37
• /
• 1995

This paper suggests a procedure of decomposing a multi-stage dynamic location problem into stages with respect stage. The problem can be formulated as a mixed integer programming problem, which is difficult to be solved directly. We perform a series of transformations in order to divide the problem into stages. In the process, the assumption of PSO (production-system-only) plays a critical role. The resulting subproblem becomes a typical single-stage dynamic location problem, whose efficient algorithms have been developed efficiently. An extension of this study is to find a method to integrate the solutions of subproblems for a final solution of the problem.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.77-85
• /
• 1998

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations.

• Communications of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.919-928
• /
• 2018

In this paper, we consider the admissible control problem for the linear systems by using the solution of the Hausdorff moment problem. In addition, we consider the admissible control problem for SIR epidemic model.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.307-312
• /
• 1994

The authors have been devoted to researches on fuzzy theories and their applications, especially control theory and application problems, for recent years. In this paper, the authors present results on a comparison of optimal solutions between ones of an ordinary-typed mathematical linear programming problem(O.M.I.P. problem) and ones of a Zimmerman-typed fuzzy mathematical linear programming problem (F.M.L.P. problem), and comment about the sensitivity (differences and fuzziness on between O.M.L.P. problem and F.M.L.P. problem) on optimal solutions of these mathematical linear programming problems.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.1
• /
• pp.31-40
• /
• 2017

In this paper, we consider a nonsmooth multiobjective robust optimization problem with more than two locally Lipschitz objective functions and locally Lipschitz constraint functions in the face of data uncertainty. We prove a nonsmooth sufficient optimality theorem for a weakly robust efficient solution of the problem. We formulate a Wolfe type dual problem for the problem, and establish duality theorems which hold between the problem and its Wolfe type dual problem.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.1-23
• /
• 2005

The decentralized static output feedback design problem is considered. A constrained trust region method is developed that solves this optimal control problem when a complete set of state variables is not available. The considered problem is interpreted as a non-linear (non-convex) constrained matrix optimization problem. Then, a decentralized constrained trust region method is developed for this problem class exploiting the diagonal structure of the problem and using inexact computations. Finally, numerical results are given for the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.95-104
• /
• 2001

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.