• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.105-111
• /
• 2017

Vendor Managed Inventory is a well-known vendor-retailer coordination approach in supply chain management where the vendor manages inventory of the retailer and determines the order interval and order quantity for the retailer. To consider practical situation, the upper limit of inventory for the retailer is set. If the inventory level for the retailer exceeds the upper limit, then the penalty cost is charged to the retailer. Furthermore, maximum allowable inventory level is set for the vendor to prevent the vendor from keeping much inventory. Single-vendor multi-retailer supply chain model with upper limit of inventory for vendor and retailers is studied. All the retailers' are assumed to have the common cycle time, and a vendor manages retailers' inventory and replenishes products. The mathematical formulation is introduced to minimize the total cost including the penalty cost violating the upper limit of inventory for retailers with the constraint of maximum allowable inventory level. The solution procedure based on Karush-Kuhn-Tucker (KKT) conditions is derived. KKT conditions are often applied to find an optimal solution of nonlinear programming problem with constraints. An illustrative example is used to show the application of the proposed solution procedure. Furthermore, sensitivity analysis is done to find out the relationship between maximum allowable inventory level and other values such as order quantity, the number of shipment, vendor's cost, retailer's cost, and total cost. As maximum allowable inventory level decreases, the number of shipment decreases but total cost increases. Order quantity has the trend of decline and is affected by the number of shipment.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1549-1559
• /
• 2008

In this paper, the existence and multiplicity of solution of periodic solutions of p-Laplacian boundary value problem are studied by using degree theory and upper and lower solutions method. Some known results are improved.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.68-72
• /
• 1986

Upper bounds of the perturbed Co-semigroups of the infinite dimensional systems are investigated by using the algebraic Riccati equation(ARE). In the case that the solution P of the ARE is strictly positive, the perturbed semigroups are uniformly bounded. A sufficient condition for the solution P to be strictly positive is provided. The uniform boundedness plays an important role in extending approximately weak stability to weak stability on th whole space. Exponential Stability of the perturbed semigroups is studied by using the Young's inequlity. Some further discussions on the uniform boundedness of the perturbed semigroups are given.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.776-784
• /
• 2008

In this paper, new upper matrix bounds for the solution of the continuous algebraic Riccati equation (CARE) are derived. Following the derivation of each bound, iterative algorithms are developed for obtaining sharper solution estimates. These bounds improve the restriction of the results proposed in a previous paper, and are more general. The proposed bounds are always calculated if the stabilizing solution of the CARE exists. Finally, numerical examples are given to demonstrate the effectiveness of the present schemes.

• Ocean Systems Engineering
• /
• v.3 no.1
• /
• pp.55-70
• /
• 2013

A composite breakwater with an upper horizontal porous plate and a lower rubble mound is proposed and studied in this work. By means of matched eigenfunction expansions, a semi-analytical solution is developed for analyzing the hydrodynamic performance of the breakwater. The semi-analytical solution is verified by known solutions for special cases and an independently developed multi-domain boundary element method solution. Numerical examples are given to examine the reflection, transmission and energy loss coefficients of the breakwater and the wave force acting on the horizontal porous plate. Some useful results are presented for engineering applications.

• IE interfaces
• /
• v.7 no.3
• /
• pp.193-199
• /
• 1994

The purpose of this paper is to develop a method of the sensitivity analysis that can be applicable to a degenerate tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1 is the well known method applicable to a spanning tree solution. However, this method have some difficulties in case of being applied to a degenerate tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds remaining at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient, we present a method that the sensitivity analysis of Type 2 is solved by using the method of a sensitivity analysis of Type 1. Besides we also show that the results of sensitivity analysis of Type 2 are union set of those of Type 1 sensitivity analysis. For the right-hand side constant or the capacity, we present a simple method for the sensitivity analysis of Type 2 which uses arcs with intermediate values.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.659-662
• /
• 1998

In this paper, lower and upper possibility distributions are identified to reflect two extreme opinions in portfolio selection problems based on upper and lower possibility distributions are formalized as quadratic programming problems. Portfolios for compromising two extreme opinions from upper and lower possibility distributions and balancing the opinions of a group of experts can be obtained by quadratic optimization problems, respectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.8 no.1
• /
• pp.19-26
• /
• 1983

This paper deals with the problem of locating facilities with upper and lower capacity bounds in a single level physical distribution system at minimum total costs. Several known schemes for location problems with upper capacity bounds only are successfully extended to our case and then implemented into our branch ana bound solution procedure. Computational experiments with twelve test problems suggest the effectiveness of our approach by showing that only a small amount of additional computation is required for our problem as compared to that for the problems with upper capacity bounds.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.4
• /
• pp.113-128
• /
• 2016

This paper proposes a Bi-level Genetic Algorithm for the Fixed Charge Transportation Problem with Non-linear Unit Cost. The problem has the property of mixed integer program with non-linear objective function and linear constraints. The bi-level procedure consists of the upper-GA and the lower-GA. While the upper-GA optimize the connectivity between each supply and demand pair, the lower-GA optimize the amount of transportation between the pairs set to be connected by the upper-GA. In the upper-GA, the feasibility of the connectivity are verified, and if a connectivity is not feasible, it is modified so as to be feasible. In the lower-GA, a simple method is used to obtain a pivot feasible solution under the restriction of the connectivity determined by the upper-GA. The obtained pivot feasible solution is utilized to generate the initial generation of chromosomes. The computational experiment is performed on the selected problems with several non-linear objective functions. The performance of the proposed procedure is analyzed with the result of experiment.

• Korean Journal of Mathematics
• /
• v.4 no.1
• /
• pp.39-43
• /
• 1996

Large-time asymptotic behavior of the solutions of interacting population reaction-diffusion systems are considered. Polynomial stability was proved.