A computer-aided simulation model for inventory control was developed using Apple II Plus micro-computer. The model forecasts quarterly demands with Single Exponential Smoothing method and simulates Supply Demand Review and Inventory Level Settings for each items. The simulation is based on the assumption that the demand occurrences have their own probability distributions.

The objective of this study is to develop the Transportation Model of Linear Programming in which optimal transportation pattern by regions (origins and destinations) to minimize the total transportation costs can be obtained for handling government-held grains. As a result of computing the Transportation Model, the total transportation costs of transporting 1,058,507 metric tons from origins to destinations are 7,234 million won. So, the transporation cost is 6,834 won per ton in this model. But actual transportation cost in 1983 is 11,498 won per ton. Therefore when we distribute and transport the government-held grains from production factories to consumption warehouses, using this Transportation Model of Linear Programming is benefitable. Especially excluding the cost of computer, we could save more than two billion won of Government budget per year.

This study develops a scientific method in pilot selection by analysing a divided attention performance between the successful pilots and the failures in a flight training course. To measure the divided attention performance, Dual Task Method is used in which the primary task is a tracking task while the secondary tasks are, 1. short-term memory task 2. choice reaction task 3. judgement task. Result shows that the performance of the pilots is significantly better (p < 0.1) than that of the failures in divided attention performance. In addition, the differences in the divided attention performance between the two groups are increased in proportion to the difficulty of the task and especially in the short term memory, the increment is most dramatic.

In this paper, for the systematic software evaluation and selection objective, we first discussed the systems software which is distinctly different from applications oriented software in source, concept and use. We suggested the systematic procedures for the effective software evaluation and selection by analyzing categories of commercially available proprietary software, sources of information for software selection, request for information, request for proposal, user surveys as an aid to evaluation and evaluation of responses to the RFP.

This thesis provides the implementation of a simulation model for a particular Local Area Network (LAN), employs carrier sense multiple access (CSMA) bus architecture, which implements functions of the Stock Point Logistics Integrated Communication Environment (SPLICE). First, specifications of the model are identified based on the given functional specification and operating system design. Then the approach taken for modeling and programming in GPSS is discussed. Finally, the program and results of the simulation run are provided.

A multi-interchange simplex method is presented. This method tries to cut almost half of the set of convex combinations which generate all decreasing feasible directions. Analysis of this method indicates high possibility of the existence of polynomial-time simplex-type methods.

This paper presents optimum policy of water supply distribution of the Osaka Prefecural Waterworks System located in the midwest of Japanese Islands. Owing to the ever increasing demand for water, the Osaka Prefectural Government endeavors to expand potable and industrial water distribution system to satisfy the growing water demand of the constituents under its jurisdiction. In this regard, the paper discusses a problem of establishing an efficient and effective water distribution system. The criteria to be considered are stability of water level at the reservoirs, stability of flow in the network, and the water treatment and distribution cost. These objective functions may be combined to form a multiple objective optimization problem or may be used independently and formulated into single objective optimization problems.

Markov chains with large transition probability matrices occur in many applications such as manpowr models. Under certain conditions the state space of a stationary discrete parameter finite Markov chain may be partitioned into subsets, each of which may be treated as a single state of a smaller chain that retains the Markov property. Such a chain is said to be 'lumpable' and the resulting lumped chain is a special case of more general functions of Markov chains. There are several reasons why one might wish to lump. First, there may be analytical benefits, including relative simplicity of the reduced model and development of a new model which inherits known or assumed strong properties of the original model (the Markov property). Second, there may be statistical benefits, such as increased robustness of the smaller chain as well as improved estimates of transition probabilities. Finally, the identification of lumps may provide new insights about the process under investigation.