• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.2
• /
• pp.375-383
• /
• 2016

This paper investigates an optimal consumption, portfolio, and life insurance strategies of a family when there is a borrowing constraint and risk aversion change at the time of death of the breadwinner. A CRRA utility is employed and by using the dynamic programming method, we obtain analytic expressions for the optimal strategies.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.2
• /
• pp.88-100
• /
• 1986

The focus of this paper is to develop the optimization procedures and analyze the complexities of the nonserial diverging branch systems in Dynamic Programming. The optimization procedure of the system is developed such that it helps to reduce the computational demands of the system. The complexity of the network is analyzed with the increasing number of nodes, branches and their connectedness to the main serial system. Determination of the optimal set of nodes for the main serial chain is also investigated.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.34
• /
• pp.129-137
• /
• 1995

Recently the recognition of Logistics becomes important to enterprises as a means for improving their competition, but the Korea enterpries falls for far behind in management techniques for analyzing realities and problems in the logistic compare to the advanced countries. In describing a distribution network, we have stated that it is basically a system or a set of locations that ship, receive or store material plus the routes that connect these locations. Using a Dynamic Programming on logistics, we can decrease the inventory level and increase the service level on logistics and the management performance.

• 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.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.463-465
• /
• 2003

This paper adopts the methods of dynamic programming based on priority and the objective function is to maximize the amount of priority. The Purpose of this work is to schedule the direct load control with approciate constrints. To demonstrate the effectiveness of the study, sample data is used about 54 load. And the results of sample are described in this.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.282-285
• /
• 2002

의료영상에서 윤곽선의 추출은 관심영역 대한 객관적인 수치 즉 면적, 부피, 장단축의 길이 등을 분석하고 3차원 재구성을 위해 선행되어야 하는 중요한 과정이다. 현재 윤곽선 추출에 대한 않은 방법들이 개발 중에 있으나 이 방법들은 한계를 지니고 있어 더 높은 수준의 처리가 요구된다. 본 논문에서는 active contour model(snake)을 이용하여 MR뇌 영상에서 종양을 추출하였다. Snake의 에너지 최적화 문제를 dynamic programming을 사용하여 개선하였으며 canny edge detection을 이용하여 잡음에 덜 민감하도록 하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.326-329
• /
• 2004

Content adaptation is an effective solution to support the quality of service over multimedia services over heterogeneous environments. This paper deals with the accuracy and the real-time requirement, two important issues in making decision on content adaptation. From our previous problem formulation, we propose an optimal algorithm and a fast approximation based on the Viterbi algorithm of dynamic programming. Through extensive experiments, we show that the proposed algorithms can enable accurate adaptation decisions, and especially they can support the real-time processing.

• The Pure and Applied Mathematics
• /
• v.28 no.1
• /
• pp.1-13
• /
• 2021

In this note we use a generalization of coincidence point(a property which was defined by [1] in symmetric spaces) to prove common fixed point theorem on S-metric spaces for weakly compatible maps. Also the results are used to achieve the solution of an integral equation and the bounded solution of a functional equation in dynamic programming.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.29 no.12
• /
• pp.638-644
• /
• 2017

Optimal cooling operation algorithm was developed based on a simulation case of a single family house model equipped with renewable energy facility. EnergyPlus simulation results were used as virtual test data. The model contained three energy storage elements: thermal heat capacity of the living room, chilled water storage tank, and battery. Their charging and discharging schedules were optimized so that daily electricity bill became minimal. As an optimization tool, linear programming was considered because it was possible to obtain results in real time. For its adoption, EnergyPlus-based house model had to be linearly approximated. Results of this study revealed that dynamic cooling load of the living room could be approximated by a linear RC model. Scheduling based on the linear programming was then compared to that by a nonlinear optimization algorithm which was made using GenOpt developed by a national lab in USA. They showed quite similar performances. Therefore, linear programming can be a practical solution to optimal operation scheduling if linear dynamic models are tuned to simulate their real equivalents with reasonable accuracy.

• Journal of Korean Port Research
• /
• v.14 no.1
• /
• pp.37-45
• /
• 2000

Centralized safety stock in a periodic replenishment system which consists of one central warehouse and m regional warehouse can reduce backorders allocating the centralized safety stocks to regional warehouse in a certain instant of each replenishment cycle. If the central warehouse can not monitoring inventories in the regional warehouse, then we have to predetermine the instant of allocation according to demand distribution and this instant must be same for all different replenishment cycle. However, transition of inventory level in each cycle need not to be same, and therefore different instant of the allocation may results reduced shortage compare to the predetermined instant of allocation. In this research, we construct a dynamic model based on the assumption of monitoring inventories in the regional warehouse everyday, and develop an algorithm minimize shortage in each replenishment cycle using dynamic programming approach.