• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.409-413
• /
• 2005

The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.91-103
• /
• 2012

Revenue management problems originated in the 1970's in the context of the airline industry have been successfully introduced in airline industries. It has started on the capacity control by booking classes for available seats, and has been recognized as a powerful tool to maximize the total revenue. Changing customer behavior and airline market environments, however, has required a new mechanism for improving the revenue. Dynamic pricing is one of innovative tools which is to adjust prices according to the market status. In this paper, we consider a dynamic pricing and seat control problem for discrete time horizon. The problem can be modeled as a stochastic programming problem. Applying the linear approximation technique and given the price set for each time, we suggest a mixed Integer Programming model to solve our problem efficiently. From the simulation results, we can find our model makes good performance and can be expanded to other comprehensive problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.299-319
• /
• 1997

Since a convergence strategy in interactive procedure is the origin of a lot of the restrictions and inconvenience of many methods, a new flexible convergence strategy is necessary for developing that is applicable for interactive MOLP as well as interactive multiple objective integer programming(MOIP). A method for computing the volume of the interval defined subsets of weighting vector space is developed using Sobol's LP$_{i}$, Generator. Since the interactive procedure requires a number of iterations, with a fixed number of solutions presented per iteration, a convergence strategy is needed to control the rate at which the interactive procedure converges to a final solution. Thus, in this paper, a new convergency strategy is developed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.1
• /
• pp.17-25
• /
• 1990

Most of the least cost transportation network design problems are frequently formulated as the minimum spanning arborescence problems in directed networks with bitype are costs. These costs are classified whether the arc is included in the path from the root to a specified node over a given spanning arborescence. We prove that this problem is NP-hard, and develop a polynomial time algorithm for acyclic networks. The probelm in acyclic networks is initially formulated as 0-1 integer programming. Next, we prove that the 0-1 relaxed linear programming has an integral optimum solution by complementary slackness conditions. In this paper, we present an $O(n^2)$ algorithm based on a shortest path algorithm.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.41-51
• /
• 2016

Smart metering systems have become widespread around the world. RF mesh communication systems have contributed to the creation of smarter and more reliable power systems. This paper presents an algorithm for positioning GPRS concentrators to attain delay constraints for a ZigBee-based mesh network. The proposed algorithm determines the number and placement of concentrators using integer linear programming and a queueing model for the given mesh network. The solutions given by the proposed algorithm are validated by verifying the communication network performance through simulations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.47-65
• /
• 1998

We consider a multiperiod capacity planning problem for determining a mix of flexible and dedicated capacities under budget restriction. These capacities are controlled by purchasing flexible machines and/or new dedicated machines and disposing old dedicated machines. Acquisition and replacement schedules are determined and operations are assigned to the flexible or dedicated machines for the objective of minimizing the sum of discounted costs of acquisition and operation of flexible machines, new dedicated machines, and old dedicated machines. In this research, the Problem is formulated as a mixed integer linear Program and solved by a Lagrangian relaxation approach. A subgradient optimization method is employed to obtain lower bounds and a multiplier adjustment method is devised to improve the bounds. We develop a linear programming based Lagrangian heuristic algorithm to find a good feasible solution of the original problem. Results of tests on randomly generated test problems show that the algorithm gives relatively good solutions in a reasonable amount of computation time.

• 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 Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.18-24
• /
• 1990

The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.30-35
• /
• 1993

Simple recurrence relations for calculating completion times of various storage polices (unlimited, intermediate storages(FIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had been developed as a mixed integer linear programniing(MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming(MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computation times.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.17 no.4
• /
• pp.323-329
• /
• 2011

This study is to determine an optimal yacht mooring location candidate among many alternative candidates in order to obtain the maximized efficiency under the natural conditions using integer programming. To deal with marina's construction location, the optimal construction location is selected using 21 important factors analysis for 4 candidates in the Mokpo city. The development period and the initial investment cost weight are one and half times more than the others among 21 factors. The optimal spiral analysis of weighted linear model shows that the Peace Square sea area is selected as the most optimal place among 4 candidates. This proposed model has not been applied in the optimal marina's facility candidate selection problem yet. This paper will contribute to determine the most reasonable alternative. Also, this proposal model can be applied to other marina's facility candidate selection problem in other regions.