• 지식경영연구
• /
• 제7권1호
• /
• pp.1-12
• /
• 2006

The previous empirical research suggests that problem finding is more important than problem solving in the creative process. Problem finding is increasingly recognized in theories of creativity. In spite of the importance of problem finding, there is little research to explain problem finding in Korea. This article reviews the research about problem finding and examines the nature of problem finding, the type of problems, the relation of problem finding and problem solving, the relation of problem finding and creativity, and the serendipity. Finally, theoretical and educational implications are discussed.

• 유통과학연구
• /
• 제15권2호
• /
• pp.15-20
• /
• 2017

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

• Human Ecology Research
• /
• 제54권4호
• /
• pp.351-363
• /
• 2016

This study examined in depth what teachers experience in a practical problem-based home economics class. This study established the research question, "What do teachers experience in the practical problem-based home economics class?" and selected three teacher participants who had steadily performed a practical problem-based home economics class to directly observe classes and conducted intensive interviews with the class performing teachers. The three research participants performed the practical problem-based class as a method of practicing their educational beliefs and based on a problem consciousness that textbook centered classes focusing on concepts cannot manage. They also tried to make efforts to reconstruct the textbook centered with practical problems to promote the critical thinking abilities of students. In practicing the practical problem-based class, the research participants recognized that it was important to show the present problems in reality to the students, teach broad value concepts, and establish rapport with students. They tried to make class content correspond to class evaluation. They felt awarded in how they influenced the development of students and the perception of home economics subjects in a positive way as well as experienced various actual difficulties in performing the practical problem-based class. The three research participants examined themselves through the agony and reflection of the class, and integrated the class with daily activities by applying problem solving methods of practical problem-based classes to their lives.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

• 한국경영과학회지
• /
• 제28권4호
• /
• pp.131-143
• /
• 2003

In this paper, we present a survey about the various graph partition problems including the clustering problem, the k-cut problem, the multiterminal cut problem, the multicut problem, the sparsest cut problem, the network attack problem, the network disconnection problem. We compare those problems focusing on the problem characteristics such as the objective function and the conditions that the partitioned clusters should satisfy. We also introduce the mathematical programming formulations, and the solution approaches developed for the problems.

• 한국경영과학회지
• /
• 제26권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.

• 한국경영과학회지
• /
• 제20권1호
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. 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. The algorithm can be easily implemented using only linear programming method.

• 한국경영과학회지
• /
• 제15권1호
• /
• pp.23-35
• /
• 1990

A mathematical model for a dynamic capacitate facility location problem is formulated by a mixed integer problem. The objective of the model is to minimize total discounted costs that include fixed charges and distributed costs. The Cross Decomposition method of Van Roy is extended and applied to solve the dynamic capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework. It successively solves a transportation problem and a dynamic uncapacitated facility location problem as two subproblems. Computational results are compared with those of general mixed integer programming.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제9권2호
• /
• pp.125-133
• /
• 2005

This paper investigates student conceptual understanding and application on algebra using problem-based curricula. Seven principles which National Research Council announced were considered because these seven principles all involved in the development of a deep conceptual understanding. A problem-based curriculum itself provides a significant contribution to improving student learning. A problem-based curriculum encourages students to obtain a more conceptual understanding in algebra. From the results the national curriculum developers in Korea consider the problem-based curriculum.

• 한국국방경영분석학회지
• /
• 제35권3호
• /
• pp.47-59
• /
• 2009

A hybrid Genetic Algorithm is applied to military resource allocation problem. Since military uses many resources in order to maximize its ability, optimization technique has been widely used for analysing resource allocation problem. However, most of the military resource allocation problems are too complicate to solve through the traditional operations research solution tools. Recent innovation in computer technology from the academy makes it possible to apply heuristic approach such as Genetic Algorithm(GA), Simulated Annealing(SA) and Tabu Search(TS) to combinatorial problems which were not addressed by previous operations research tools. In this study, a hybrid Genetic Algorithm which reinforces GA by applying local search algorithm is introduced in order to address military optimization problem. The computational result of hybrid Genetic Algorithm on Missile Interceptor Allocation problem demonstrates its efficiency by comparing its result with that of a simple Genetic Algorithm.