• 전기의세계
• /
• 제21권1호
• /
• pp.13-16
• /
• 1972

Dynamic Programming is regarded as a very powerful tool for solving nonlinear optimization problem subject to a number of constraints of state and control variables, but has definite disadvantages that it requires much more computing time and consumes much more memory spaces than other technigues. In order to eliminate the above-mentioned demerits, this paper suggests a news technique called Multiple Dynamic Programming. The underlying principles are based on the concept of multiple passes that, instead of forming fin lattices in time-state plane as adopted in the conventional Dynamic Programming, the Multiple Dynamic Programming constitutes, at the first pass, coarse lattices in the feasible domain of time-state plane and determines the optimal state trajectory by the usual method of Dynamic Programming, and at the second pass again constitutes finer lattices in the narrower domain surrounded by both the upperand lower edges next to the lattice edges through which the first pass optimal trajectory passes and determines the more accurate optimal trajectory of state, and then at the third pass repeats the same processes, and so on. The suggested technique insures remarkable curtailment in amounts of computer memory spaces and conputing time, and its applicability has been demonstrated by a case study on the hydro-thermal power coordination in Korean power system.

• 대한수학회지
• /
• 제43권1호
• /
• pp.11-28
• /
• 2006

The existence, uniqueness and iterative approximation of solutions for a few classes of functional equations arising in dynamic programming of multistage decision processes are discussed. The results presented in this paper extend, improve and unify the results due to Bellman [2, 3], Bhakta-Choudhury [6], Bhakta-Mitra [7], and Liu [12].

• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2005년도 추계학술대회 발표 논문집
• /
• pp.443-454
• /
• 2005

The purpose of this study is to show the operations and implementations of ASP web database which uses open-source web site packages called bighitonline video shop. Some literature reviews have been done to reveal robust theoretical background for this research And also, some basic experiments as Preparatory Processes have also been made by using some softwares such as Windows XP professional, IIS, MS SQL Server and others. The main purpose of these experiments is to show strong theoretical and practical backgrounds. These experimental results in the micro-level showed to be successful to understand the Interrelations of web components and web-site architectures.

• 산업경영시스템학회지
• /
• 제19권37호
• /
• pp.53-61
• /
• 1996

Recently the business transformaton of a company is achieved through the business process re-design and total quality management concept. This paper focused on the decision of the critical measurement point(CMP) for maximizing the effectiveness of the business process reengineering. In general, the types of business processes can be classified into two kinds, serial processes with IPO(input/process/output) type and non-serial processes with workflow type. The traditional method of selecting the CMP relies on the experiences and intuitions of the process owners. We suggest a mathematical method for more objective selection of CMP by using Dynamic Programming.

• 경영과학
• /
• 제32권4호
• /
• pp.19-28
• /
• 2015

This study presents a mathematical programming model to develop production planning in the manufacturing processes for photovoltaic silicon ingots and wafers. The model is formulated as a linear programming model that maximizes total growth margin, which is composed of production cost, inventory cost, shortage cost, and sales profit while considering the constraints associated with the production environments of photovoltaic materials. In order to demonstrate the utility of the model for production planning, we run operations for a planning horizon of a year for a case study. When the primary results of this mathematical programming are compared with the historical records, the model could have resulted in the considerable increase of the total growth margin by effectively reducing inventory cost if a decision maker had employed the model as a decision support system with perfect information for sales demand.

• 한국컴퓨터정보학회논문지
• /
• 제23권9호
• /
• pp.163-169
• /
• 2018

Problem solving by programming has a lot of influence on computational thinking improvement. Programming learning has been self-directed based on the individual's thoughts and principles. However, the revised informatics curriculum in 2015 puts importance on collaborative learning. Collaborative learning emphasizes results differently from cooperative learning, which emphasizes problem-solving processes. And cooperative learning leads to structured learning, such as role sharing and activity stages, within a small group, while collaborative learning leads to unstructured learning. Therefore, it is becoming more in collaborative learning that peer interaction can be affected by learners' cognitive style. In this paper, we propose the effect of cognitive style on problem solving ability in collaborative learning for problem solving by programming. As a result, collaborative learning was effective in improving problem solving ability and there was no significant difference in cognitive style.

• 한국정보시스템학회지:정보시스템연구
• /
• 제5권
• /
• pp.21-41
• /
• 1996

Linear programming has become an important tool in decision-making of modern business management. This remarkable growth can be traced to the pioneering efforts of many individuals and research organizations. The popular using of personal computers make it very easy to process those complicated linear programming models. Furthermore advanced linear programming software packages assist us to solve L.P. models without any difficult process. Even though the advanced L.P. professional packages, the needs of more detailed deterministic elements for business decisions have forced us to apply dynamic approaches for more resonable solutions. For the purpose of these problems applying to the "Mathematica" packages which is composed of mathematic tools, the simplex processes show us the flexible and dynamic decision elements included to any other professional linear programming tools. Especially we need proper dynamic variables to analyze the shadow prices step by step. And applying SAS(Statistical Analysis System) packages to the L.P. problems, it is also one of the best way to get good solution. On the way trying to the other L.P. packages which are prepared for Spreadsheets i.e., MS-Excel, Lotus-123, Quatro etc. can be applied to linear programming models. But they are not so much useful for the problems. Calculating simplex tableau is an important method to interpret L.P. format for the optimal solution. In this paper we find out that the more detailed and efficient techniques to interpret useful software of mathematica and SAS for business decision making of linear programming. So it needs to apply more dynamic technique of using of Mathematica and SAS multiple software to get more efficient deterministic factors for the sophiscated L.P. solutions.

• 정보교육학회논문지
• /
• 제19권2호
• /
• pp.243-252
• /
• 2015

2019학년도부터 초등학교에서 소프트웨어 교육이 실시될 예정이다. 초등학교 소프트웨어 교육의 주된 내용 중의 하나는 학생들이 프로그래밍을 체험하는 것이다. 프로그래밍에 대하여 관심을 보이는 학생들에게는 보다 높은 수준의 프로그래밍 교육이 필요하며 동아리 활동을 통하여 시행할 수 있다. 그러나 초등학교에서의 동아리 활동을 위한 프로그래밍 교재는 많지 않다. 따라서 본 연구에서는 초등학교의 동아리 활동을 위한 프로그래밍 교재를 개발하였다. 따라 하기 형태의 매뉴얼 방식을 지양하고 학생들이 문제를 이해하고, 문제 분할 및 추상화 과정을 따라 설계하며 이를 프로그램으로 작성할 수 있도록 하여 자연스럽게 Computational Thinking 능력을 배양하도록 하였으며 시범 수업을 통하여 개발한 교재가 초등학생들에게 적절한 내용과 수준임을 입증하였다. 따라서 본 연구에서 제시하는 교재 집필 방법들이 초등학교의 소프트웨어 교육에 기여할 것으로 기대한다.

• 제어로봇시스템학회논문지
• /
• 제5권6호
• /
• pp.714-723
• /
• 1999

This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

• 한국통신학회논문지
• /
• 제31권3B호
• /
• pp.175-182
• /
• 2006

본 논문에서는 Localized Aptive QoS 라우팅을 위해 POMDP(Partially Observable Markov Decision Processes)와 Exploration Bonus 기법을 사용하는 방법을 제안하였다. 또한, POMDP 문제를 해결하기 위해 Dynamic Programming을 사용하여 최적의 행동을 찾는 연산이 매우 복잡하고 어렵기 때문에 CEA(Certainty Equivalency Approximation) 기법을 통한 기댓값 사용으로 문제를 단순하였으며, Exploration Bonus 방식을 사용해 현재 경로보다 나은 경로를 탐색하고자 하였다. 이를 위해 다중 경로 탐색 알고리즘(SEMA)을 제안했다. 더욱이 탐색의 횟수와 간격을 정의하기 위해 $\phi$와 k 성능 파라미터들을 사용하여 이들을 통해 탐색의 횟수 변화를 통한 서비스 성공률과 성공 시 사용된 평균 홉 수에 대한 성능을 살펴보았다. 결과적으로 $\phi$ 값이 증가함에 따라 현재의 경로보다 더 나은 경로를 찾게 되며, k 값이 증가할수록 탐색이 증가함을 볼 수 있다.