• Title/Summary/Keyword: random sum

Search Result 252, Processing Time 0.026 seconds

Optimum Inventory Level and optimal Selling Price to Realize a Pre-determined Level of Profit

  • Kang, Suk-Ho;Noh, Seung-Jong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.12 no.1
    • /
    • pp.43-48
    • /
    • 1986
  • In this paper, the one period multi-item inventory model is considered in which it is required to determine the production quantity and selling price of each item which maximize the probability of realizing predetermined level of profit. The objective function of this model is the sum of weighted probabilities which represent the possibility of obtaining the predetermined level of profit for each item. Budget constraint, inventory site constraint and constraints of price are considered. Finally this paper shows a numerical example in which random demand of each item has exponential distribution.

  • PDF

Stochastic optimum design criterion of added viscous dampers for buildings seismic protection

  • Marano, Giuseppe Carlo;Trentadue, Francesco;Greco, Rita
    • Structural Engineering and Mechanics
    • /
    • v.25 no.1
    • /
    • pp.21-37
    • /
    • 2007
  • In this study a stochastic approach for linear viscous dampers design adopted for seismic protection of buildings is developed. Devices optimal placement into the main structure and their mechanical parameters are attained by means of a reliability-based optimum design criterion, in which an objective function (O.F.) is minimized, subject to a stochastic constraint. The seismic input is modelled by a non stationary modulated Kanai Tajimi filtered stochastic process. Building is represented by means of a plane shear type frame model. The selected criterion for the optimization searches the minimum of the O.F., here assumed to be the cost of the seismic protection, i.e., assumed proportional to the sum of added dampings of each device. The stochastic constraint limits a suitable approximated measure of the structure failure probability, here associated to the maximum interstorey drift crossing over a given threshold limit, related, according with modern Technical Codes, to the required damage control.

A NEW KIND OF THE LAW OF THE ITERATED LOGARITHM FOR PRODUCT OF A CERTAIN PARTIAL SUMS

  • Zang, Qing-Pei
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.5
    • /
    • pp.1041-1046
    • /
    • 2011
  • Let {X, $X_{i};\;i{\geq}1$} be a sequence of independent and identically distributed positive random variables. Denote $S_n= \sum\array\\_{i=1}^nX_i$ and $S\array\\_n^{(k)}=S_n-X_k$ for n ${\geq}$1, $1{\leq}k{\leq}n$. Under the assumption of the finiteness of the second moments, we derive a type of the law of the iterated logarithm for $S\array\\_n^{(k)}$ and the limit point set for its certain normalization.

A SUPPLEMENT TO PRECISE ASYMPTOTICS IN THE LAW OF THE ITERATED LOGARITHM FOR SELF-NORMALIZED SUMS

  • Hwang, Kyo-Shin
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.6
    • /
    • pp.1601-1611
    • /
    • 2008
  • Let X, $X_1$, $X_2$, ... be i.i.d. random variables with zero means, variance one, and set $S_n\;=\;{\sum}^n_{i=1}\;X_i$, $n\;{\geq}\;1$. Gut and $Sp{\check{a}}taru$ [3] established the precise asymptotics in the law of the iterated logarithm and Li, Nguyen and Rosalsky [7] generalized their result under minimal conditions. If P($|S_n|\;{\geq}\;{\varepsilon}{\sqrt{2n\;{\log}\;{\log}\;n}}$) is replaced by E{$|S_n|/{\sqrt{n}}-{\varepsilon}{\sqrt{2\;{\log}\;{\log}\;n}$}+ in their results, the new one is called the moment version of precise asymptotics in the law of the iterated logarithm. We establish such a result for self-normalized sums, when X belongs to the domain of attraction of the normal law.

THE SEQUENTIAL UNIFORM LAW OF LARGE NUMBERS

  • Bae, Jong-Sig;Kim, Sung-Yeun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.43 no.3
    • /
    • pp.479-486
    • /
    • 2006
  • Let $Z_n(s,\;f)=n^{-1}\;{\sum}^{ns}_{i=1}(f(X_i)-Pf)$ be the sequential empirical process based on the independent and identically distributed random variables. We prove that convergence problems of $sup_{(s,\;f)}|Z_n(s,\;f)|$ to zero boil down to those of $sup_f|Z_n(1,\;f)|$. We employ Ottaviani's inequality and the complete convergence to establish, under bracketing entropy with the second moment, the almost sure convergence of $sup_{(s,\;f)}|Z_n(s,\;f)|$ to zero.

Kernel Regression Estimation for Permutation Fixed Design Additive Models

  • Baek, Jangsun;Wehrly, Thomas E.
    • Journal of the Korean Statistical Society
    • /
    • v.25 no.4
    • /
    • pp.499-514
    • /
    • 1996
  • Consider an additive regression model of Y on X = (X$_1$,X$_2$,. . .,$X_p$), Y = $sum_{j=1}^pf_j(X_j) + $\varepsilon$$, where $f_j$s are smooth functions to be estimated and $\varepsilon$ is a random error. If $X_j$s are fixed design points, we call it the fixed design additive model. Since the response variable Y is observed at fixed p-dimensional design points, the behavior of the nonparametric regression estimator depends on the design. We propose a fixed design called permutation fixed design, and fit the regression function by the kernel method. The estimator in the permutation fixed design achieves the univariate optimal rate of convergence in mean squared error for any p $\geq$ 2.

  • PDF

The Dynamic Allocated Bees Algorithms for Multi-objective Problem

  • Lee, Ji-Young;Oh, Jin-Seok
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.33 no.3
    • /
    • pp.403-410
    • /
    • 2009
  • The aim of this research is to develop the Bees Algorithm named 'the dynamic allocated Bees Algorithm' for multi-objective problem, especially in order to be suit for Pareto optimality. In addition two new neighbourhood search methods have been developed to produce enhanced solutions for a multi-objective problem named 'random selection neighbourhood search' and 'weighted sum neighbourhood search' and they were compared with the basic neighbourhood search in the dynamic allocated Bees Algorithm. They were successfully applied to an Environmental/Economic (electric power) dispatch (EED) problem and simulation results presented for the standard IEEE 30-bus system and they were compared to those obtained using other approaches. The comparison shows the superiority of the proposed dynamic allocated Bees Algorithms and confirms its suitability for solving the multi-objective EED problem.

Source Identification in an Interior Sound Field (반사파가 존재하는 실내 공간에서의 음원 탐지 방법)

  • 최영철;김양한
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2001.05a
    • /
    • pp.1203-1209
    • /
    • 2001
  • Identification of noise sources, their locations and strengths, have been taken great attention. The method that can identify noise sources normally assumes that noise sources are located at a free field. However, the sound in a reverberant field consists of that coming directly from the source plus sound reflected or scattered by the walls or objects in the field. In contrast to the exterior sound field, reflections are added to sound field. Therefore, we have to consider the reverberation effect on the source identification method. The main objective of this paper is to identify noise source in the reverberant field. At fist, we try to identify noise sources in a rigid wall enclosure using the spherical beamforming method. In many case of practical interest, the wall has an admittance so that complex reflection process occurred. In this paper, we assumed the complex reverberant field in the enclosure to be the sum of plane waves with random incidence and magnitude. Then the effects of reverberant field at interior source identification have been studied theoretically as well as experimentally

  • PDF

On the Multi-Stage Group Scheduling with Dependent Setup Time (종속적 준비시간을 갖는 다단계 그룹가공 생산시스템에서의 그룹스케듈링에 관한 연구)

  • 황문영
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.17 no.31
    • /
    • pp.115-123
    • /
    • 1994
  • Group scheduling, which is a kind of operations scheduling based on the GT concept is analyzed in a multi-stage manufacturing system. The purpose of this research is to develop and evaluate a heuristic algorithm for determining gro up sequence and job sequence within each group to minimize a complex cost function, i.e. the sum of the total pe-nalty cost for tardiness and the total holding cost for flow time, in a multi-stage manufacturing system with group setup time dependent upon group sequence. A heuristic algorithm for group sc heduling is developed, and a numerical example is illustrated. For the evaluation of the pro-posed heuristic algorithm, the heuristic solution of each of 63 problems is compared with that of random scheduling. The result shows that the proposed heuristic algorithm provides better solution in light of the proposed cost function.

  • PDF

Quadratic polynomial fitting algorithm for peak point detection of white light scanning interferograms (백색광주사간섭무늬의 정점검출을 위한 이차다항식맞춤 알고리즘)

  • 박민철;김승우
    • Korean Journal of Optics and Photonics
    • /
    • v.9 no.4
    • /
    • pp.245-250
    • /
    • 1998
  • A new computational algorithm is presented for the peak point detection of white light interferograms. Assuming the visibility function of white light interferograms as a quadratic polynomial, the peak point is searched so as to minimize the error sum between the measured intensity data and the analytical intensity. As compared with other existing algorithms, this new algorithm requires less computation since the peak point is simply determined with a single step matrix multiplication. In addition, a good robustness is obtained against external random disturbances on measured intensities since the algorithm is based upon least squares principles.

  • PDF