• Geomechanics and Engineering
• /
• v.11 no.4
• /
• pp.587-605
• /
• 2016

This study aimed to develop upper and lower bounds to predict the tunnel support pressure under the pile tip during the circular tunnel excavation. Most previous studies on the upper and lower bound methods were carried out for the single ground structures, e.g., retaining wall, foundation, ground anchor and tunnel, in the homogeneous ground conditions, since the pile-soil-tunnel interaction problem is very complicated and sophisticated to solve using those bound methods. Therefore, in the lower bound approach two appropriate stress fields were proposed for single pile and tunnel respectively, and then they were superimposed. In addition, based on the superimposition several failure mechanisms were proposed for the upper bound solution. Finally, these upper bound mechanisms were examined by shear strain data from the laboratory model test and numerical analysis using finite element method.

• Structural Engineering and Mechanics
• /
• v.24 no.6
• /
• pp.727-740
• /
• 2006

A simple plane-strain solution is derived in this paper for the functionally graded multilayered isotropic elastic cylinder under static deformation. The solution is obtained using method of separation of variables and is expressed in terms of the summation of the Fourier series in the circumferential direction. While the solution for order n = 0 corresponds to the axisymmetric deformation, that for n = 2 includes the special deformation frequently utilized in the upper and lower bounds analysis. Numerical results for a three-phase cylinder with a middle functionally graded layer are presented for both axisymmetric (n = 0) and general (n = 2) deformations, under either the traction or displacement boundary conditions on the surface of the layered cylinder. The solution to the general deformation case (n = 2) is further utilized for the first time to find the upper and lower bounds of the effective shear modulus of the layered cylinder with a functionally graded middle layer. These results could be useful in the future study of cylindrical composites where FGMs and/or multilayers are involved.

• Honam Mathematical Journal
• /
• v.43 no.4
• /
• pp.667-678
• /
• 2021

Blow-up phenomena for a nonlocal reaction-diffusion system with time-dependent coefficients are investigated under null Dirichlet boundary conditions. Using Kaplan's method with the comparison principle, we establish new blow-up criteria and obtain the upper bounds for the blow-up time of the solution under suitable measure sense in the whole-dimensional space.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.1-16
• /
• 2006

The classical perturbation theory is extended to the weighted Kronecker product linear systems $W(A{\bigotimes}B)W\chi=h$. Upper bounds are derived for the normwise condition number.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.14-23
• /
• 1992

본 논문은 스케줄링 문제등 정수계획문제에서 흔히 찾아볼 수 있는 변수상한 제약을 갖는 문제의 효율적인 해법을 위한 분석적인 틀을 마련하기 위한 연구이다. 본 연구에서는 이 문제에 관한 기존의 알고리즘적 해법과 달리 분해기법을 이용하여 일반변수상한 문제에 까지 확장 적용될 수 있음을 분석적으로 보였다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.162-172
• /
• 1999

For VBR video traffic, Motion-Picture Experts Group(MPEG) coding algorithm was adopted as the standard coding algorithm by International Telecommunication Union(ITU). In this paper, we propose a traffic model of an MPEG coded video traffic in frame level and cell level, and develop an approximate model for evaluating performance of a ATM multiplexer with homogeneous MPEG video sources by considering burst-level variation of aggregated traffics. For homogeneous MPEG video traffics which are frame-synchronized, the performance of the ATM multiplexer is influenced by source correlation at the multiplexing time. When sources are highly correlated, we decompose the aggregated cell streams by the frame-type and model multiplexing process during a frame time as n*D/D/1/K queueing model and suggest an approximate method for obtaining CLP of the ATM multiplexer. In the case that sources are highly correlated, the solution has the meaning of the upper bounds of performance of the ATM multiplexer. For the verification of our model, we compare the solution of our model with simulation resets. As the number of sources increases. The CLP obtained from our model approaches to simulation results, and gives upper bounds of simulation results.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.107-121
• /
• 2010

In this paper, we present a frequency reassignment problem (FRP) that arises when we install new base stations or reconfigure radio networks to increase the capacity or to expand service area. For this problem, we develop an integer programming (IP) model, and develop cutting planes to enhance the mathematical representation of the model. Also, we devise an effective tabu search algorithm to obtain tight upper bounds within reasonable time bounds. Computational results exhibit that the developed cutting planes are effective for reducing the computing time as well as for increasing lower bounds. Also, the proposed tabu search algorithm finds a feasible solution of good quality within reasonable time bound.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.1-17
• /
• 2004

The famous Newton-Kantorovich hypothesis has been used for a long time as a sufficient condition for the convergence of Newton method to a solution of an equation in connection with the Lipschitz continuity of the Frechet-derivative of the operator involved. Using Lipschitz and center-Lipschitz conditions we show that the Newton-Kantorovich hypothesis is weakened. The error bounds obtained under our semilocal convergence result are finer and the information on the location of the solution more precise than the corresponding ones given by the dominating Newton-Kantorovich theorem, and under the same hypotheses/computational cost, since the evaluation of the Lipschitz also requires the evaluation of the center-Lipschitz constant. In the case of local convergence we obtain a larger convergence radius than before. This observation is important in computational mathematics and can be used in connection to projection methods and in the construction of optimum mesh independence refinement strategies.

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

The purpose of this paper is to formulate the three-dimensional loading problem and to develop an exact algorithm. The three-dimensional loading problem is not only to load as many boxes as possible, but also to ensure load stability. In this Paper, we propose formulation by zero-one integer programming. Further we propose as an algorithm the branch-and-bound enforced by efficient bounding criteria. As an upper bound, we use the solution of the Lagrangean relaxation problem which relaxes constraints of zero-one IP, and as a lower bound, we use a heuristic solution induced by the solution of the Lagrangean relaxation problem. Last, we show computational experiments on convergency of upper and lower bounds.