• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.310-310
• /
• 2000

The main problem in stereo vision is to find corresponding points in left and right image known as correspondence problem. Once correspondences determined, the depth information of those points are easily computed form the pairs of points in both image. In this paper, dynamic programming considering half-occluded region is used fer solving correspondence problem.

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

• Journal of Korean Institute of Industrial Engineers
• /
• v.4 no.2
• /
• pp.77-81
• /
• 1978

The assortment problem with deterministic demand has been formulated so that a dynamic programming can be applied to find optimal production lengths that will minimize the sum of cutting losses. The original minimization problem can be reformulated as the maximization problem with a different objective function. This problem can be solved by the dynamic programming technique. A numerical example illustrates this approach. The ratio of computation amount of emumeration method to that of this dynamic programming is approximately n to 1.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.194-200
• /
• 2005

A stochastic dynamic lot sizing problem for multi-item is suggested in the case that the distribution of the cumulative demand is known over finite planning horizons and all unsatisfied demand is fully backlogged. Each item is produced simultaneously at a variable ratio of input resources employed whenever setup is incurred. A dynamic programming algorithm is proposed to find the optimal production policy, which resembles the Wagner-Whitin algorithm for the deterministic case problem but with some additional feasibility constraints.

• Coupled systems mechanics
• /
• v.9 no.6
• /
• pp.563-573
• /
• 2020

Dynamic responses of a laminated composite cantilever beam under a harmonic are investigated in this study. The governing equations of problem are derived by using the Lagrange procedure. The Timoshenko beam theory is considered and the Ritz method is implemented in the solution of the problem. The algebraic polynomials are used with the trivial functions for the Ritz method. In the solution of dynamic problem, the Newmark average acceleration method is used in the time history. In the numerical examples, the effects of load parameter, the fiber orientation angles and stacking sequence of laminas on the dynamic responses of the laminated beam are investigated.

• Journal of Korean Institute of Industrial Engineers
• /
• v.43 no.1
• /
• pp.1-11
• /
• 2017

Stochastic resource-constrained project scheduling problem is an extension of resource-constrained project scheduling problem such that activity duration has stochastic nature. In real situation where activity duration is not known until the activity is finished, open-loop based static policies such as activity-based policy and priority-based policy will not well cope with duration variability. Then, a dynamic policy based on closed-loop decision making will be regarded as an alternative toward achievement of minimal makespan. In this study, a dynamic policy designed to select activities to start at each decision time point is illustrated. The performance of static and dynamic policies based on variable neighborhood search is evaluated under the discrete-event simulation environment. Experiments with J120 sets in PSPLIB and several probability distributions of activity duration show that the dynamic policy is superior to static policies. Even when the variability is high, the dynamic policy provides stable and good solutions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.47-56
• /
• 1994

The dynamic feedback is well-known to be much more powerful tool in control than the static one. This paper deals with the dynamic feedback linearization of the nonlinear systems which are not (static) feedback linearizable. The dynamic feedback linearization problem is however too difficult to solve at momemt. Thus we introduce a restricted class of the dynamic feedback (pure integrators followed by the static feedback) which is often used to study the problems using dynamic feedback and obtain the necessary and sufficient conditions of the linearization problem using this class of the dynamic feedback.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2000.06a
• /
• pp.1945-1950
• /
• 2000

When one build a building that posses Precison production process to be sensitive to vibration and SMD to procuce a large dynamic force, how do one predict & answer vibration control problem at building structure design at first stage, That is a question. It has tried to predict dynamic response and establish answering about global or local dynamic problem in building using experimental and analysis method. One of such a try, it be proposed Semi-Empirial Method that reduce error element of input information about dynamic analysis using dynamic experimental study and measurement data in the basis of real-structure. In this paper, the dynamic response problem about RC-structure building that will be set-up SMD produce large transient dynamic force using Semi-Empirical Method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.1
• /
• pp.19-30
• /
• 2013

Recently, the constrained index tracking problem, in which the task of trading a set of stocks is performed so as to closely follow an index value under some constraints, has often been considered as an important application domain for control theory. Because this problem can be conveniently viewed and formulated as an optimal decision-making problem in a highly uncertain and stochastic environment, approaches based on stochastic optimal control methods are particularly pertinent. Since stochastic optimal control problems cannot be solved exactly except in very simple cases, approximations are required in most practical problems to obtain good suboptimal policies. In this paper, we present a procedure for finding a suboptimal solution to the constrained index tracking problem based on approximate dynamic programming. Illustrative simulation results show that this procedure works well when applied to a set of real financial market data.