Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korean Operations Research and Management Science Society
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 11, Issue 2 - Oct 1986
Volume 11, Issue 1 - Apr 1986
Selecting the target year
New challenge of OR/MS in Asia and Pacific area
Rha, Woong-Bae ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 1, 1986, Pages 1~6
On the Output of Two-Stage Cyclic Queue
Han, Han-Soo ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 1, 1986, Pages 7~11
Throughout this paper we analyze the system at output point t of two stage cyclic queueing model. Our main result characterize the stochastic process (X
), the system at output point, as a Markov renewal process. The subsequent lemma exhibits the semi-Markov kernel of (X
) with state dependent feedback, the possibility of a reducible state space arises. A simple necessary and sufficient condition for the irreducibility of (X
was determinded. This irreducibility implied that (X
) was aperiodic.
An Investigation of the Comparative Rate of Return
Park, Young-Hyun ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 1, 1986, Pages 12~23
The minimum attractive rate of return (MARR) has been used for many years as a decision criterion in engineering economic analysis. Typically, inflation has been either ignored in such studies or considered by adjusting each of the individual cash flows associated with a project for inflation, frequently a lengthy process. This research investigates a new decision criterion for economic analysis, the comparative rate of return (CRR). The CRR is defined to be the minimum rate of return earned on uninflated cash flows of proposed expenditures is simplified, since the analysis can be performed on the uninflated cash flows. The research presents a derivation of the CRR and investigates its relationships to the MARR, inflation rate project cash flows and project life.
Computational Study on the Simple Plant Location Problem : Variations of the Benders Decomposition Method
Kim, Yangyul ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 1, 1986, Pages 24~35
We investigate various methods of the Benders decoposition algorithm in its application to the simple plant location problem. We developed six variants. The master problem may be relaxed as an LP problem up to an appropriate point in time, or need not be solved to the optimality before a cut is added. Furthermore, since the subproblem is highly degenerated, we can generate more than one cuts at a time. The efficiency of the methods are examined using a sample problem. The result showed that the adding two-cut method was superior to the standard method. The LP relaxation and the non-optimization of the master program greatly improved the efficiency. Applying the LP relaxation method, we were able to reduce the computing time by two thirds of the time required by the standard method.
A Study on the Extension of Fuzzy Programming Solution Method
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 1, 1986, Pages 36~43
In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.
A Study on the (Q, r) Inventory Model under the Lead Time Uncertainty and its Application to the Multi-level Distribution System
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 1, 1986, Pages 44~50
In this paper, we find optimal policy for the (Q, r) inventory model under the lead time uncertainty. The (Q, r) inventory model is such that the fixed order quantity Q is placed whenever the level of on hand stock reaches the reorder point r. We first develop the single level inventory model as the basis for the analysis multi-level distribution systems. The functional problem is to determine when and how much to order in order to minimize the expected total cost per unit time, which includes the set up, inventory holding and inventory shortage cost. The model, then, is extended to the multi-level distribution system consisting of the factory, warehouses and retailers. In this case, we also find an optimal policy which minimizes the total cost of the contralized multi-level distribution system.
Software Development of Generalized Linear/Goal Programming for Microcomputer
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 1, 1986, Pages 51~58
The propose of this study is to presnet a generalized linear/goal programming software, which has been developed to run on mickrocomputers with at least 512 K bytes of memory. The main characteristics of our algorithm for solving LP/GP problems are outlined as follows ; First, it uses the revised simplex algorithm, which is the most efficient computational procedure for computers. Second, it employs the sparse matrix technique to overcome the limited memory of microcomputers. Last, it uses the modified product form of invers (MPFI) to reduce round-off errors. The test runs with our code written in FORTRAN show that it can be used as an effective tool for solving linear/goal programming problems of considerable size.