Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Korean Management Science Review
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 15, Issue 2 - Nov 1998
Volume 15, Issue 1 - May 1998
Selecting the target year
A Pivot And Probe Algorithm(PARA) for Network Optimization
Moonsig Kang ; Kim, Young-Moon ;
Korean Management Science Review, volume 15, issue 1, 1998, Pages 1~12
This paper discusses a new algorithm, the PAPANET (Pivot And Probe Algorithm for NETwork optimization), for solving linear, capacitated linear network flow problem (NPs), PAPANET is a variation and specialization of the Pivot And Probe Algorithm (PAPA) developed by Sethi and Thompson, published in 1983-1984. PAPANET first solves an initial relaxed NP (RNP) with all the nodes from the original problem and a limited set of arcs (possibly all the artificial and slack arcs). From the arcs not considered in the current relaxation, we PROBE to identify candidate arcs that violate the current solution's dual constraints maximally. Candidate arcs are added to the RNP, and this new RNP is solved to optimality. This candidate pricing procedure and pivoting continue until all the candidate arcs price unfavorably and all of the dual constraints corresponding to the other, so-called noncandidate arcs, are satisfied. The implementation of PAPANET requires significantly fewer arcs and less solution CPU time than is required by the standard network simplex method implementation upon which it is based. Computational tests on randomly generated NPs indicate that our PAPANET implementation requires up to 40-50% fewer pivots and 30-40% less solution CPU time than is required by the comparable standard network simplex implementation from which it is derived.
An Experimental Study on the Relationship between Information Type and New Product Development Process
Korean Management Science Review, volume 15, issue 1, 1998, Pages 13~31
In this paper, we examine the relationship between information type and new product development process. Information that was provided for new product development can be divided into two categories. One was relative information that could be used as a basis for comparison such as patent data. The other was absolute information that must be fulfilled in the new product such as key customers requirements. An experiment was conducted with staffs in an R＆D department in order to analyze the impact of the different information types on the development process of new product. It was found that the group with the absolute information recognized the given information repeatedly, which in turn results in a highly technical idea with good teamwork. The group with the relative information created a superior product with better application, appearance and product efficiency through the frequent refinements of given ideas. This paper concludes with the implications of the results to the new product development process and supporting information systems.
A Study of Facility Location Model Under Uncertain Demand
Korean Management Science Review, volume 15, issue 1, 1998, Pages 33~47
The facility location problem considered here is to determine facility location sites under future's uncertain demand. The objective of this paper is to propose a solution method and algorithm for a two-stage stochastic facility location problem. utilizing the Benders decomposition method. As a two-stage stochastic facility location problem is a large-scale and complex to solve, it is usually attempted to use a mean value problem rather than using a stochastic problem. Thus, the other objective is to study the relative error of objective function values between a stochastic problem and a mean value problem. The simulation result shows that the relative error of objective function values between two problems is relatively small, when a feasibility constraint is added to a facility location model.
Development of LPAKO : Software of Simplex Method for Liner Programming
Korean Management Science Review, volume 15, issue 1, 1998, Pages 49~62
The purpose of this paper is to develope a large-scale simplex method program LPAKO. Various up-to-date techniques are argued and implemented. In LPAKO, basis matrices are stored in a LU factorized form, and Reid's method is used to update LU maintaining high sparsity and numerical stability, and further Markowitz's ordering is used in factorizing a basis matrix into a sparse LU form. As the data structures of basis matrix, Gustavson's data structure and row-column linked list structure are considered. The various criteria for reinversion are also discussed. The dynamic steepest-edge simplex algorithm is used for selection of an entering variable, and a new variation of the MINOS' perturbation technique is suggested for the resolution of degeneracy. Many preprocessing and scaling techniques are implemented. In addition, a new, effective initial basis construction method are suggested, and the criteria for optimality and infeasibility are suggested respectively. Finally, LPAKO is compared with MINOS by test results.
Reliability and Availability Modeling of the MIN (Multistage Interconnection Network) System
Korean Management Science Review, volume 15, issue 1, 1998, Pages 63~76
Reliability evaluation methodologies of the multipath MIN system are reviewed and critically compared. Some guidelines are proposed to select efficient evaluation method for the system designers to use. Considering the switch failure and repair characteristics of the MIN system, three types of Markov models are proposed for the MIN system availability models. These models can be used for the MIN performance analysis. The performance of the MIN system are supposed to vary according to the failure state of the system.
A Face Optimization Algorithm for Optimizing over the Efficient Set
Kim, Dong-Yeop ; Taeho Ahn ;
Korean Management Science Review, volume 15, issue 1, 1998, Pages 77~85
In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations.
Experimental Study on Supernodal Column Choleksy Factorization in Interior-Point Methods
Korean Management Science Review, volume 15, issue 1, 1998, Pages 87~95
The computational speed of interior point method depends on the speed of Cholesky factorization. The supernodal column Cholesky factorization is a fast method that performs Cholesky factorization of sparse matrices with exploiting computer's characteristics. Three steps are necessary to perform the supernodal column Cholesky factorization : symbolic factorization, creation of the elimination tree, ordering by a post-order of the elimination tree and creation of supernodes. We study performing sequences of these three steps and efficient implementation of them.
A Commercial Paper Evaluation Model Based on the AHP
Korean Management Science Review, volume 15, issue 1, 1998, Pages 97~115
This study aims to develop the methodology based on the AHP(Analytic Hierarchy Process) of evaluation for commercial paper. commercial paper is the ma product of merchant banks. commercial paper evaluation is annually performed by the credit-evaluation agency. Credit evaluation is performed by the informal judgemental system, which has potential to induce serious inconsistencies in decision-making. We present an objective scoring model which does not suffer from the weakness of the subjective judgement system. The model used is illustrated by analyzing the commercial paper evaluation for the 3 motor-companies(H, K and S motors).
Applications of Information Technology to the Bodily Injury Liability of Automobile Insurance
Korean Management Science Review, volume 15, issue 1, 1998, Pages 117~135
A Study on the Development of a Case-Based Credit Risk Management System of Korean Commercial Banks-Object-Oriented Approch
Korean Management Science Review, volume 15, issue 1, 1998, Pages 137~148
We proposed a framework for computer-supported credit evaluation systems for the effective management of credit risks in Korean commercial banks. Especially for medium and small sized companies, credit evaluators used to depend much on past experience rather than formalized principles and rules. Therefore, we applied case-based reasoning. The credit grade of a company is roughly determined by searching for alreadygraded similar companies in terms of usually accepted evaluation items. And then the grade is refined and adjusted by considering additional information about exceptional facts or by reflecting other evaluation results from different methods or techniques. Booch's object-oriented analysis and design method, Visual Basic 5.0 and MS Access 97 are used for the development of this prototype system.
A Study on the Evaluation Model of Strategic Information Systems Planning
Korean Management Science Review, volume 15, issue 1, 1998, Pages 149~178
Strategic Information Systems Planning(SISP) has gained considerable interest among researchers and practitioners in recent years Which has instigated various related research. Neverthless, only 24 percent of the projects recommended as a result of SISP are ultimately performed. This statistics raise the questions for the need of SISP. This study provides the framework that may enable SISP to be more effectively utilized by studying factors for consideration from the review of pertinent literature. These factors will then be validated by case studies of domestic companies and by simultaneously inducing key characteristics and solutions of SISP. The result of the study indicate some inconsistency between literal factors and the case study. The factors added through case study were considered to be actual factors of SISP. This study emphasized the role of the senior manager, the quality of the implementation of the state plan, change management and the capability of the planning team. As a key characteristics of domestic companies considered was the general lack of ability to collect and analyze data. In addition, the domestic companies have little consideration of the organizational contingency factors.