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 24, Issue 4 - Dec 1999
Volume 24, Issue 3 - Sep 1999
Volume 24, Issue 2 - Jun 1999
Volume 24, Issue 1 - Mar 1999
Volume 5, Issue 2 - 00 1999
Selecting the target year
An Implementation of Preprocessing for Interior Point Methods for Linear Programming
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 1~11
We classified preprocessing methods into (1) analytic methods, (2) methods for removing implied free variables, (3) methods using pivot or elementary row operations, (4) methods for removing linearly dependent rows and columns and (5) methods for dense columns. We noted some considerations to which should be paid attention when preprocessing methods are applied to interior point methods for linear programming. We proposed an efficient order of preprocessing methods and data structures. We also noted the recovery process for dual solutions. We implemented the proposed preprocessing methods. and tested it with 28 large scale problems of NETLIB. We compared the results of it with those of preprocessing routines of HOPDM, BPDPM and CPLEX.
A Two Stage Model for Product and Price Competition in a Multi-Segmented Market
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 13~25
This paper presents a model of competitive positioning and pricing of new products in a multi-segmented market. The segments in the market are located on a multi-dimensional discrete attribute space with fixed demands. Firms launch products sequentially on the attribute space, incurring fixed and variable costs, and then decide on their product prices. Each firm acts to maximize its profit. Market share of a firm is determined by the position and price of Its product. We provide sufficient conditions for the existence and uniqueness of Nash equilibrium Another equilibrium concept is Introduced and related to the Nash equilibrium. A heuristic algorithm based on genetic algorithms is designed to obtain the Nash equilibrium.
Primal-Interior Dual-Simplex Method and Dual-Interior Primal-Simplex Method In the General bounded Linear Programming
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 27~38
In this paper, Primal-Interior Dual-Simplex method(PIDS) and Dual-Interior Primal-Simplex method(DIPS) are developed for the general bounded linear programming. Two methods were implemented and compared with other pricing techniques for the Netlib. linear programming problems. For the PIDS, it shows superior performance to both most nagative rule and dual steepest-edge method since it practically reduces degenerate iterations and has property to reduce the problem. For the DIPS, pt requires less iterations and computational time than least reduced cost method. but it shows inferior performance to the dynamic primal steepest-edge method.
An Economic Selective Assembly Procedure for Two Mating Components
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 39~48
An economic procedure of selective assembly is proposed when a product is composed of two mating components. The major qualify characteristic of the product is the clearance between the two components. The components are divided into several classes prior to assembly. The component characteristics are assumed to be independently and normally distributed with equal variance. The procedure is designed so that the proportions of both components in their corresponding classes are the same. A cost model is developed based on a quadratic loss function and methods of obtaining the optimal class limits as well as the optimal number of classes are provided. Formulas for obtaining the proportion of rejection and the unavailability of mating components are also provided. The proposed model is compared with the equal width and the equal area partitioning methods using a numerical example.
Performance Enhancement of the Joint CDMA/PRMA Protocol Using Pseudo Bayesian Approach
Kim, Kyungsoo ; Kwangho Kook ; Lee, Kangwon ; Jiwhan Ahn ; Park, Jeongrak ;
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 49~58
A new channel access function is proposed to enhance the performance of the Joint CDMA/PRMA. It is obtained in consideration of the number of terminals in reservation mode and the number of terminals in contention mode whose probability distribution is estimated by applying pseudo Bayesian approach. Simulation results show that the performance of the Joint CDMA/PRMA can be improved by applying new channel access function under voice-only traffic and mixed voice/random-data traffic.
Effect of Fitness Between Implementation Variables and IT Innovation Types on Implementation Outcome
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 59~77
Since information technologies have become critical to business success as a tool for organizational Innovation, successful implementation of IT Innovation is viewed as one of the most crucial tasks for many organizations. This paper examines the fit between the relevant variables and the implementation types and its impact on the success of implementation. We clarify the concept of IT innovation by distinguishing between IT innovation object and IT innovation process. Four types of IT innovation implementation were classified according to the dimensions of implementation scope and implementation pace. We developed a set of relevant prepositions and examined them through multiple case studios following the Yin's case study methodology.
Interactive Judgemental Adjustment of Initial Forecasts with forecasting Support Systems
Lim, Joa-Sang ; Park, Hung-Kook ;
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 79~98
There have been a number of empirical studios on the effectiveness of Judgmental adjustment to statistical forecasts Generally the results have been mixed. This study examined the impact of the reliability and the source of the additionally presented reference forecast upon the revision process in a longitudinal time series forecasting task with forecast support systems. A 2-between(reliability ＆ source). 2-within(seasonality ＆ block) factorial experiment was conducted with post-graduate students using real time series. Judgmental adjustment was found to improve the accuracy of initial eyeballing irrespective of the reliability of an additionally presented forecast. But it did not outperform the dampened reference forecast. No effect was found of the way the source of the reference forecast was framed. Overall the subjects anchored heavily on their Initial forecast and relied too little on the reference forecast irrespective of its reliability. Moreover they did not improve at the task over time, despite immediate outcome feedback.
Cooperative Query Answering Based on Abstraction Database
Journal of the Korean Operations Research and Management Science Society, volume 24, issue 1, 1999, Pages 99~117
Since query language is used as a handy tool to obtain information from a database, a more intelligent query answering system is needed to provide user-friendly and fault-tolerant human-machine Interface. Frequently, database users prefer less rigid querying structure, one which allows for vagueness in composing queries, and want the system to understand the intent behind a query. When there is no matching data available, users would rather receive approximate answers than a null information response. This paper presents a knowledge abstraction database that facilitates the development of such a fault-tolerant and intelligent database system. The proposed knowledge abstraction database adepts a multilevel knowledge representation scheme called the knowledge abstraction hierarchy(KAH), extracts semantic data relationships from the underlying database, and provides query transformation mechanisms using query generalization and specialization steps. In cooperation with the underlying database, the knowledge abstraction database accepts vague queries and allows users to pose approximate queries as well as conceptually abstract queries. Specifically. four types of vague queries are discussed, including approximate selection, approximate join, conceptual selection, and conceptual Join. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database application systems.