• 한국경영과학회지
• /
• 제20권1호
• /
• pp.1-10
• /
• 1995

The purpose of this paper is to develop a method of the sensitivity analysis that can be applied to a non-tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1a is the well known method applicable to a tree solution. However this method can not be applied to a non-tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds 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 finding the shortest path. Besides we also show that the results of Type 2 and Type 1 are the same in a spanning tree solution. For the right-hand side constant or the capacity, the sensitivity analysis of Type 2 is solved by a simple calculation using arcs with intermediate values.

• 산업공학
• /
• 제7권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.

• 충청수학회지
• /
• 제20권3호
• /
• pp.203-210
• /
• 2007

Let X be a hyperbolic region in the complex plane C such that the hyperbolic metrix ${\lambda}_X(w){\mid}dw{\mid}$ exists. Let $R(X)=sup\{{\delta}_X(w):w{\in}X\}$ where ${\delta}_X(w)$ is the euclidean distance from w to ${\partial}X$. Here ${\partial}X$ is the boundary of X. A hyperbolic region X is called a Bloch region if R(X) < ${\infty}$. In this paper, we obtain lower bounds for the hyperbolic metric on Bloch regions in terms of the distance to the boundary.

• Communications for Statistical Applications and Methods
• /
• 제7권1호
• /
• pp.257-268
• /
• 2000

As one of indirect ways to get an optimal answer for sensitive questions both lower and upper values are sometimes asked and collected. In this paper a statistical method is proposed to analyze this kind of data using graphics. This method could define each sample median and estimate an optimal value between lower and upper bounds. In particular we find that this method has similar explanations of an equilibrium price with demand and supply functions in Economics.

• Management Science and Financial Engineering
• /
• 제8권1호
• /
• pp.1-19
• /
• 2002

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.

• 대한수학회논문집
• /
• 제14권4호
• /
• pp.789-795
• /
• 1999

Let $A_1$,A$_2$…, A\ulcorner and B$_1$,B$_2$…, B\ulcorner be two sequences of events on the same probability space. Let X= X\ulcorner(A) and Y-Y\ulcorner)(B), repectively, by the number of those A\ulcorner and B\ulcorner which oc-cur. We establish bivariate lower bounds on the distribution P(X$\geq$1, Y, $\geq$1)and P(X$\geq$i , $Y\geq$j)by linear combinations of the bino-mial moments S\ulcorner, \ulcorner, 1$\leq$i$\leq$j

• Journal of the Korean Statistical Society
• /
• 제19권1호
• /
• pp.24-44
• /
• 1990

The purpose of this paper is to extend the idea of Tamhane and Bechhofer (1977, 1979) concerning the normal means problem to some general class of distributions. The key idea in Tamhane and Bechhofer is the derivation of the computable lower bounds on the probability of a correct selection. To derive such lower bounds, they used the specific covariance structure of a multivariate normal distribution. It is shown that such lower bounds can be obtained for a class of stochastically increasing distributions under certain conditions, which is sufficiently general so as to include the normal means problem as a special application. As an application of the general theory to the scale parameters problem, a two-stage elimination type procedure for selecting the population associated with the smallest variance from among several normal populations is proposed. The design constants are tabulated and the relative efficiencies are computed.

• Structural Engineering and Mechanics
• /
• 제21권2호
• /
• pp.185-204
• /
• 2005

Variations in system parameters due to uncertainties may result in system performance deterioration. Uncertainties in modeling of structures are often considered to ensure that control system is robust with respect to response errors. Hence, the uncertain concept plays an important role in vibration control of the engineering structures. The paper discusses the robustness of the stability of vibration control systems with uncertain parameters. The vibration control problem of an uncertain system is approximated by a deterministic one. The uncertain parameters are described by interval variables. The uncertain state matrix is constructed directly using system physical parameters and avoided to use bounds in Euclidean norm. The feedback gain matrix is determined based on the deterministic systems, and then it is applied to the actual uncertain systems. A method to calculate the upper and lower bounds of eigenvalues of the close-loop system with uncertain parameters is presented. The lower bounds of eigenvalues can be used to estimate the robustness of the stability the controlled system with uncertain parameters. Two numerical examples are given to illustrate the applications of the present approach.

• 품질경영학회지
• /
• 제21권2호
• /
• pp.93-101
• /
• 1993

The derived expressions and computations of the system reliability in the consecutive k out of n failure structure with sink-source pole are discussed and a decisive lower and upper bounds as well as exact system reliability are presented in this paper. Good bounds of the system reliability can be easily computed and are illustrated in the numerical example.

• 한국경영과학회지
• /
• 제8권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.