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
A Comparative Study On Optimization Algorithms for Capacited Facility Location
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 1~6
Capacitated facility location problems have received a great deal of attention in the past decade, resulting in a proliferation of algorithms for solving them. As is the case with mixed 1-1 integer programming problems, the computational success of such algorithms depends greatly on how to obtain lower bounds in good quality within a resonable time. The objective of this paper is to provide a comparative analysis of those algorithms in terms of lower bounds they produce. Analyses of the strategies for generating lower bounds as well as the quality of generated lower bounds are provided.
A Dynamic Game of R & D Investment Under Technology Transfer
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 7~12
The problem of strategic R & D investment is formulate as a differential game model and solved explicity for a special case. It is shown that, at equilibrium, an increase in the intensity of market competition or a decrease in the role of technology transfer results in an increase in the initial rate of investment by competing tfirms. The increased initial investment rate may enhance the rate of technology development. This dynamic model can be used to propose non cooperative R & D investment policies in technologically competitive situation.
A Hheuristic for Non-bifurcated Routing in Communication Networks
Chang, Suk-Gwon ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 13~26
This paper considers the routing problem in session-based communication network, particularly where the pattern of message transmission is characterized by non-bifurcated traffic flows. Due to the discreteness property of its solution space, the problem is formulated as normalized mlticommodity network flows with integer restrictions and an effective penalty system is suggested to solve it. To show its effectiveness, a simple example and a preliminary computational experience are provided. Finally, numerous application areas of the algorithm are suggested.
Equilibrium Bidding Strategy and Expected Profit in the Multiple Unit Simultaneous Auctions
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 27~36
This paper deals with four types of multiple unit simultaneous auctions such as the discriminating. uniform-price, lowest accepted-price, and progressive auctions. These auctions have been studied by Vickrey, Ortega-Reichert, Herris and Raviv and so forth. In this paper, their studies are extended to the case with a reserve price and an entry fee, and then the equilibrium bidding strategy are presented. Further, those are analyzed with respect to the change of a reserve price, an entry fee, and the number of bidders and objects.
Flexible Mixed decomposition Method for Large Scale Linear Programs: -Integration of a Network of Process Models-
Ahn, Byong-Hun ; Rhee, Seung-Kyu ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 37~50
In combining dispersed optimization models, either primal or dual(or both) decomposition method widely used as an organizing device. Interpreting the methods economically, the concepts of price and resource-directive coordination are generally well accepted. Most of deomposition/ integration methods utilize either primal information of dual information, not both, from subsystems, while some authors have developed mixed decomposition approaches employing two master problems dealing primal and dual proposals separately. In this paper a hybrid decomposition method is introduced, where one hybrid master problem utilizes the underlying relationships between primal and dual information from each subsystem. The suggested method is well justified with respect to the flexibility in information flow pattern choice (some prices and other quantities) and to the compatibility of subdivision's optimum to the systemwide optimum, that is often lacking in conventional decomposition methods such as Dantzig-Wolfe's. A numerical example is also presented to illustrate the suggested approach.
Goal Setting in Multiple Criteria Decision Making
Lee, Jae-Kyu ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 51~68
The effects of goal setting in the context of Multiple Criteria Making (MCDM) are classified into two types : internal and external. In the internal models, the impact of the changed goal is limited only to the other goals in MCDM model. By contrast, in the external models, the impact is limited to the factors not included in the MCDM model. In fact, most real world examples of goal setting have the nature of mixed models. To assist in the goal setting process, the framework named Goal Setting Support (GSS) is developed. The GSS helps decision-makers for mixed models to 1) make internal trade-offs in a way that guarantees non-dominancy after the trade-ofs, and 2) evaluate achieved goals systematically. The GSS can be used in creating Decision Support Systems that will allow interactive goal setting.
Linear Programming Model and Forecasting for Financing Operation of civil Service Pension Fund
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 69~78
The outlook for the Civil Service Pension (CSP) program in Korea indicates several problems. First, the balance of the benefit among the pension recipients is not well maintained. Second, the program is running out of funds as benefit increases exceed the growth in revenues. In this article, we analyze these problems by using linear programming model and discuss the alternatives. We propose an addition of the age limit to the benefit eligibility and a reconsideration of the government subsidy's level.
On Solving the Fuzzy Goal Programming and Its Extension
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 79~87
This paper illustrates a new method to solve the fuzzy goal programming (FGP) problem. It is proved that the FGP proposed by Narasimhan can be solved on the basis of linear programming(LP) model. Narasimhan formulated the FGP problem as a set of
LP problems, each containing 3K constraints, where K is the number of fuzzy goals/constraints. Whereas Hanna formulated the FGP problem as a single LP problem with only 2K constraints and 2K + 1 additional variables. This paper presents that the FGP problem can be transformed with easy into a single LP model with 2K constraints and only one additional variables. And we propose extended FGP :(1) FGP with weights associated with individual goals, (2) FGP with preemptive prioities. The extended FGP has a framework that is identical to that of conventional goal programming (GP), such that the extended FGP can be applied with fuzzy concept to the all areas where GP can be applied.d.
Optimization and Analysis of Nonserial Diverging Branch Systems in Dynamic Programming
Lee, Chae Y. ;
Journal of the Korean Operations Research and Management Science Society, volume 11, issue 2, 1986, Pages 88~100
The focus of this paper is to develop the optimization procedures and analyze the complexities of the nonserial diverging branch systems in Dynamic Programming. The optimization procedure of the system is developed such that it helps to reduce the computational demands of the system. The complexity of the network is analyzed with the increasing number of nodes, branches and their connectedness to the main serial system. Determination of the optimal set of nodes for the main serial chain is also investigated.