• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.35-47
• /
• 1996

The tolerance approach to the sensitivity analysis in linear programming considers simultaneous and independent variations in the coefficients of the objective function or of the right-hand side terms and gives a region in which the coefficients and terms can be changed and still keeps the current optimal basis B for the original problem as an optimal basis for the perturbed problem. In this paper we describe a procedure that expands the region S obtained by the tolerance approach into a larger region R, so that more variations in the objective function coefficients or the right-hand side terms are permissible.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.27-35
• /
• 2009

Integer programming is a very effective technique for searching optimal solution of combinatorial optimization problems. However, its applicability is limited to linear models. In this paper, I propose an effective method for solving a nonlinear optimization problem by integrating the powerful search performance of integer programming and the flexibility of neighborhood search algorithms. In the first phase, integer programming is executed with subproblem which can be represented as a linear form from the given problem. In the second phase, a neighborhood search algorithm is executed with the whole problem by taking the result of the first phase as the initial solution. Through the experimental results using a nonlinear maximal covering problem, I confirmed that such a simple integration method can produce far better solutions than a neighborhood search algorithm alone. It is estimated that the success is primarily due to the powerful performance of integer programming.

• Geomechanics and Engineering
• /
• v.8 no.1
• /
• pp.97-111
• /
• 2015

The kinematical approach of limit analysis is used to estimate the three dimensional stability analysis of rock slopes with nonlinear Hoek-Brown criterion under earthquake forces. The generalized tangential technique is introduced, which makes limit analysis apply to rock slope problem possible. This technique formulates the three dimensional stability problem as a classical nonlinear programming problem. A nonlinear programming algorithm is coded to search for the least upper bound solution. To prove the validity of the present approach, static stability factors are compared with the previous solutions, using a linear failure criterion. Three dimensional seismic and static stability factors are calculated for rock slopes. Numerical results of indicate that the factors increase with the ratio of slope width and height, and are presented for practical use in rock engineering.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.2
• /
• pp.318-323
• /
• 2013

For fast and accurate motion of 6-axis articulated robot, more noble motion control strategy is needed. In general, the movement strategy of industrial robots can be divided into two kinds, PTP (Point to Point) and CP (Continuous Path). Recently, industrial robots which should be co-worked with machine tools are increasingly needed for performing various jobs, as well as simple handling or welding. Therefore, in order to cope with high-speed handling of the cooperation of industrial robots with machine tools or other devices, CP should be implemented so as to reduce vibration and noise, as well as decreasing operation time. This paper will realize CP motion (especially joint-linear) blending in 3-dimensional space for a 6-axis articulated (lab-manufactured) robot (called as "RS2") by using LabVIEW$^{(R)}$ (6) programming, based on a parametric interpolation. Another small contribution of this paper is the proposal of motion blending simulation technique based on Recurdyn$^{(R)}$ V7 and Solidworks$^{(R)}$, in order to figure out whether the joint-linear blending motion can generate the stable motion of robot in the sense of velocity magnitude at the end-effector of robot or not. In order to evaluate the performance of joint-linear motion blending, simple PTP (i.e., linear-linear) is also physically implemented on RS2. The implementation results of joint-linear motion blending and PTP are compared in terms of vibration magnitude and travel time by using the vibration testing equipment of Medallion of Zonic$^{(R)}$. It can be confirmed verified that the vibration peak of joint-linear motion blending has been reduced to 1/10, compared to that of PTP.

• Journal of the Korea Society for Simulation
• /
• v.13 no.1
• /
• pp.11-23
• /
• 2004

The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.31 no.2
• /
• pp.55-65
• /
• 2023

Due to extreme urbanization, ground transportation in the city center is saturated, and problems such as the lack of expansion infrastructure and traffic congestion increase social costs. To solve this problem, a 3D mobility platform, Urban Air Mobility (UAM), has emerged as a new alternative. A vertiport is a physical space that conducts a similar role to an airport terminal. Vertiport consists of take-off and landing facilities (TLOF, Touchdown and Lift-Off area), space for boarding and disembarking from UAM aircraft (gates), taxiways, and passenger terminals. The type of vertiport (structure, number of facilities) and concept of operations are key variables that determine the number of UAM aircraft that can be accommodated per hour. In this study, a capacity calculation method was presented using an optimization technique (Deterministic Integer Linear Programming). The absolute capacity of the vertiport was calculated using an optimization technique, and a sensitivity analysis was also performed.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.29 no.3
• /
• pp.125-137
• /
• 1987

The purpose of this paper is to examine some difficulties in water management of agricultural reservoirs in Korea, for there are approximately more than 15,000 reservoirs which are now being utilized for the purpose of irrigation, along with the much amount of expenses and labors to be invested against droughts and floods periodically occurred. Recently, the effective use of water resources in the agricultural reservoirs with a single purpose, is becomming multiple according to the alterable environment of water use. Therefore, the task to allocate agricultural water rationally and economically must be solved for the multiple use of agricultural reservoirs. On the basis of the above statement, this study aims at suggesting the rational method of water management by introducing an optimal technique to allocate the water in an existing agricultural reservoir rationally, for the sake of maximizing the economic effect. To achieve this objective, a reservoir, called "0-Bongje" as a sample of the case study, is selected for an agricultural water development proiect of medium scale. As a model for the optimum allocation of water in the multi-purpose use of reservoirs a linear programming model is developed and analyzed. As a result, findings of the study are as follows : First, a linear programing model is developed for the optimum allocation of water in the multi-purpose use of agricultural reservoirs. By adopting the model in the case of reservoir called "O-Bongje," the optimum solution for such various objects as irrigation area, the amount of domestic water supply, the size of power generation, and the size of reservoir storage, etc., can be obtained. Second, by comparing the net benefits in each object under the changing condition of inflow into the reservoir, the factors which can most affect the yearly total net benefit can be drawn, and they are in the order of the amount of domestic water supply, irrigation area, and power generation. Third, the sensitivity analysis for the decision variable of irrigation which may have a first priority among the objects indicate that the effective method of water management can be rapidly suggested in accordance with a condition under the decreasing area of irrigation. Fourth, in the case of decision making on the water allocation policy in an existing multi-purpose reservoir, the rapid comparison of numerous alternatives can be possible by adopting the linear programming model. Besides, as the resources can be analyed in connection with various activities, it can be concluded that the linear programing model developed in this study is more quantitative than the traditional methods of analysis. Fifth, all the possible constraint equations, in using a linear programming model for adopting a water allocation problem in the agricultural reservoirs, are presented, and the method of analysis is also suggested in this study. Finally, as the linear programming model in this study is found comprehensive, the model can be adopted in any different kind of conditions of agricultural reservoirs for the purpose of analyzing optimum water allocation, if the economic and technical coefficients are known, and the decision variable is changed in accordance with the changing condition of irrigation area.

• Journal of Korea Water Resources Association
• /
• v.32 no.5
• /
• pp.525-535
• /
• 1999

An optimal unit commitment model for efficient management of water and energy resources in a basin using combined mixed integer programming is developed. The combined mixed integer programming model is able to solve the inconsistency problem that may occur from mixed integer programming models. The technique which enables the use of conditional constraints and either-or constraints in the linear programming is also suggested. As a result of applying the combined mixed integer programming model to Lower Colorado River Basin in United States. the basin efficiency is decreased by 1.53% from the results of the mixed integer programming, while it is increased by 0.67% from the results of the historical operation. It is found that the decreased allowable error between power supplies and demands in the combined mixed integer programming causes the decreased basin efficiency.

• Korean Security Journal
• /
• no.5
• /
• pp.109-130
• /
• 2002

As proceeding Munmin and Kukmin's government, it is to bring in regionalism of genernal public administration and police administration, specialization, efficiency issue, demand inventing of audit technique to meet this trends. Especially, according to supporting qualitative improvement of the audit, its environment faced that orienting performance audit emphasis on not the legality but the efficiency more systematic and scientific theory or technique. In order to attain police audit's efficiency through performance audit, this study discussed that scientific management techniques should be applied police audit. Accordingly, the primary purpose of this study is to apply public audit to scientific management technique, bring to light limits in public sector(especially, police sector). To be efficiency audit(namely, performance audit), 1) OR techniques are explained linear programming, network modeling, PERT/CPM, queuing matrix model, simulation, 2) Statistical analysis methods are argued delphi technique, data envelopment analysis(DEA), analytic hierarchical process(AHP), time series analysis models etc.