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 26, Issue 4 - Dec 2001
Volume 26, Issue 3 - Sep 2001
Volume 26, Issue 2 - Jun 2001
Volume 26, Issue 1 - Mar 2001
Selecting the target year
Financial Performance Evaluation using Self-Organizing Maps: The Case of Korean Listed Companies
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 1~20
The amount of financial information in sophisticated large data bases is huge and makes interfirm performance comparisons very difficult or at least very time consuming. The purpose of this paper is to investigate whether neural networks in the form of self-organizing maps (SOM) can be successfully employed to manage the complexity for competitive financial benchmarking. SOM is known to be very effective to visualize results by projecting multi-dimensional financial data into two-dimensional output space. Using the SOM, we overcome the problems of finding an appropriate underlying distribution and the functional form of data when structuring and analyzing a large data base, and show an efficient procedure of competitive financial benchmarking through clustering firms on two-dimensional visual space according to their respective financial competitiveness. For the empirical purpose, we analyze the data base of annual reports of 100 Korean listed companies over the years 1998, 1999, and 2000.
A Study on the Performance Evaluation System of Internet venture Business
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 21~37
Riding on the wave of the information technology revolution, a slow of internet venture businesses (IVB) came into being. Hence, one of the recent developments in Korean capital market has been the proliferation of IVB, which is in accordance with the worldwide trend of ‘new economy’. Although the fair valuation is crucial for the nourishment of IVB, it is difficult to apply traditional valuation methods to these firms without reservation. It is due to the facts that most venture firms have little records of performance, grow unprecedently fast, and have highly uncertain future. The main purpose of this study is to suggest performance evaluation system of IVB and to develop KPE (Key Performance Indicators). Our empirical study is based upon Kaplan & Norton’s Balance Scorecard (BSC) approach. Specifically, our research has been conducted by the following two subsequent procedures: Firstly, seven internet venture firms have been selected and their executives have been interviewed by FGI(Focus Group Interview) method. Based upon these results, performance indicators have been developed. Secondly, by using the above mentioned BSC items (i.e., financial perspective, customer perspective, internal perspective and innovation & learning perspective), questionnaires have been constructed and sent to IVB through e-mail as well as over the Fax. Among the collected 110 samples, reliable 106 samples have been used to build BSC model and to draw our conclusion. In the future study, it would be much better to consider the role of strategy in IVB and the causal relationship among Key Performance Indicators of BSC.
Efficiency Assessment of Bank Branches: An Analysis Process Using DEA Model and Case Analysis
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 39~52
Recently, the assessment of a bank efficiency focusing on its branches has been conceived as important in developing a competitive strategy. DEA (Data Envelopment Analysis) model can be employed as an effective analysis model for such an assessment. Therefore, this paper proposes an analysis process using DEA model to conduct an efficiency assessment of bank branches. The proposed process includes a segmentation of branches considering their competitive environment and strategy for target market : this approach can help to develop effective strategies for each group of branches. The proposed DEA model can analyze efficiency in terms of not only cost but also marketing. Finally, a real case is analyzed, demonstrating the effectiveness of the proposed model and process.
Performance Analysis of Distance-Based Registration and Selective Paging in IMT-2000 Network
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 53~63
An efficient mobility management for mobile stations plays an important role in mobile communication network. This paper studies the mobility management scheme that combines a distance-based registration(DBR) and a selective paging (SP). We introduce an analytical model based on 2-dimensional random walk mobility model and evaluate the performance of the proposed mobility management scheme using the model to determine the optimal size of location area that results in the minimum signaling traffic on radio channels. Numerical results are provided to demonstrate the performance of the proposed mobility management scheme under various circumstances. These results can be used effectively in design and evaluation of registration methods considering the system circumstances.
An Algorithm for Calculating Flow-based Network Survivability
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 65~77
Survivability of a network is one of the most important issues in designing present-day communication networks. the k-edge survivability of a given network is defined as the percentage of total traffic surviving the worst case failure of k edges. Although several researches calculated k-edge survivability on small networks by enumeration, prior research has considered how to calculate k-edge survivability on large networks. In this paper, we develop an efficient procedure to obtain lower and upper bounds on the k-edge survivability of a network.
A New Algorithm for K Shortest Paths Problem
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 79~94
This paper presents a new algorithm for the K shortest paths Problem which develops initial K shortest paths, and repeat to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution comprises K shortest paths among shortest paths to traverse each arc in a Double Shortest Arborescence which is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, there may be some hidden paths which are shorter than present k-th path. To expose a hidden shortest path, one inward arc of this crossing node is chose by means of minimum detouring distance calculated with dual variables, and then the hidden shortest path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. If this exposed path is shorter than the k-th path, the exposed path replaces the k-th path. This algorithm requires worst case time complexity of O(Kn
), and O(n
) in the case k
The Maximin Linear Programming Knapsack Problem With Extended GUB Constraints
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 95~104
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
) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.
Assessing the Effects of Supply Uncertainty on Inventory-Related Costs
Journal of the Korean Operations Research and Management Science Society, volume 26, issue 3, 2001, Pages 105~117
This paper models supply uncertainty in the dynamic Newsboy problem context. The system consists of one supplier and one retailer who places an order to the supplier every period to meet stochastic demand. Supply uncertainty is modeled as the uncertainty in quantities delivered by the supplier. That is, the supplier delivers exactly the amount ordered by the retailer with probability of
and the amount minus K with probability of (1-
). We formulate the problem as a dynamic programming problem and prove that retailer’s optimal replenishment policy is a stationary base-stock policy. Through a numerical study, we found that the cost increase due to supply uncertainty is significant and that the costs increase more rapidly as supply uncertainty increases. We also identified the effects of various system parameters. One of the interesting results is that as retailer’s demand uncertainty, the other uncertainty in our model, increases, the cost increase due to supply uncertainty becomes less significant.