• Journal of the Korean Operations Research and Management Science Society
• /
• v.1 no.1
• /
• pp.147-150
• /
• 1976

Optimal stopping problem without recall from a multivariate distribution is solved by using the concept of an equilibrium point which was introduced by J. Nash. The solution is derived for the two cases: 1. The case where the observation cost C is positive and the given upper bound K on the number of observations is infinite. 2. The case where the observation cost C is zero and the given upper bound K on the number of observations is finite.

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

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.81-93
• /
• 2002

We consider the Hausdorff measure for Brownian motion(BM) in ι$_2$. Several path properties of BM in ι$_2$ are used to show the upper bound of Hausdorff measure. We also show the lower bound of it applying a law of iterated logarithm for the occupation time of BM in ι$_2$.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.437-444
• /
• 2018

Let S denote the class of analytic and univalent functions in the open unit disk $D=\{z:{\mid}z{\mid}<1\}$ with the normalization conditions f(0) = 0 and f'(0) = 1. In the present article, an upper bound for third order Hankel determinant $H_3(1)$ is obtained for a certain subclass of univalent functions generated by Ruscheweyh derivative operator.

• Journal of the Korean Mathematical Society
• /
• v.57 no.6
• /
• pp.1389-1406
• /
• 2020

Let Λ be an Artin algebra and mod Λ the category of finitely generated right Λ-modules. We prove that the radical layer length of Λ is an upper bound for the radical layer length of mod Λ. We give an upper bound for the extension dimension of mod Λ in terms of the injective dimension of a certain class of simple right Λ-modules and the radical layer length of DΛ.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.861-873
• /
• 2005

In this paper we approximate a cylindrical helix by bi-conic and bi-quadratic Bezier curves. Each approximation method is $G^1$ end-points interpolation of the helix. We present a sharp upper bound of the Hausdorff distance between the helix and each approximation curve. We also show that the error bound has the approximation order three and monotone increases as the length of the helix increases. As an illustration we give some numerical examples.

• Journal of the Korean Mathematical Society
• /
• v.39 no.4
• /
• pp.495-507
• /
• 2002

In this paper, the characterization results related to Chernoff-type inequalities are applied for exponential-type (continuous and discrete) families. Upper variance bound is obtained here with a slightly different technique used in Alharbi and Shanbhag [1] and Mohtashami Borzadaran and Shanbhag [8]. Some results are shown with assuming measures such as non-atomic measure, atomic measure, Lebesgue measure and counting measure as special cases of Lebesgue-Stieltjes measure. Characterization results on power series distributions via Chernoff-type inequalities are corollaries to our results.

• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1167-1182
• /
• 2010

We study codes meeting a generalized version of the Singleton bound for higher weights. We show that some of the higher weight enumerators of these codes are uniquely determined. We give the higher weight enumerators for MDS codes, the Simplex codes, the Hamming codes, the first order Reed-Muller codes and their dual codes. For the putative [72, 36, 16] code we find the i-th higher weight enumerators for i = 12 to 36. Additionally, we give a version of the generalized Singleton bound for non-linear codes.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.75-85
• /
• 1983

This study is concerned with the problem of routing vehicles stationed at a central depot to supply customers with known demands, in such a way as to minimize the total distance travelled. The problem is referred to as the vehicle routing problem and is a generalization of the multiple traveling salesmen problem that has many practical applications. A branch-and-bound algorithm for the exact solution of the vehicle routing problem is presented. The algorithm finds the optimal number of vehicles as well as the minimum distance routes. A numerical example is given.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.8
• /
• pp.19-26
• /
• 1993

The bit error probability of Reed-Solomon/convolutional concatenated codes can be more exactly calculated by using a more approximate bound of the symbol error probability of the convolutional codes. This paper obtains the unequal symbol error bound of the convolutional codes, and applies to the calculation of the bit error probability of the concatenated codes. Our results are tighter than the earlier studied other bounds.