• 제목/요약/키워드: stochastic problem

검색결과 535건 처리시간 0.026초

Design Centering by Genetic Algorithm and Coarse Simulation

  • Jinkoo Lee
    • 한국CDE학회논문집
    • /
    • 제2권4호
    • /
    • pp.215-221
    • /
    • 1997
  • A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

  • PDF

L-SHAPED ALGORITHM FOR TWO STAGE PROBLEMS OF STOCHASTIC CONVEX PROGRAMMING

  • Tang, Hengyong;Zhao, Yufang
    • Journal of applied mathematics & informatics
    • /
    • 제13권1_2호
    • /
    • pp.261-275
    • /
    • 2003
  • In this paper we study two stage problems of stochastic convex programming. Solving the problems is very hard. A L-shaped method for it is given. The implement of the algorithm is simple, so less computation work is needed. The result of computation shows that the algorithm is effective.

확률 최적 제어문제에서 발생되는 Elliptic Type H-J-B 방정식의 수치해 (Numerical Solution of an Elliptic Type H-J-B Equation Arising from Stochastic Optimal Control Problem)

  • Wan Sik Choi
    • 제어로봇시스템학회논문지
    • /
    • 제4권6호
    • /
    • pp.703-706
    • /
    • 1998
  • 본 논문에서는 확률 최적 제어문제에서 발생되는 Elliptic type H-J-B(Hamilton-Jacobi-Bellman) 방정식에 대한 수치해를 구하였다. 수치해를 구하기 위하여 Contraction 사상 및 유한차분법을 이용하였으며, 시스템은 It/sub ∧/ 형태의 Stochastic 방정식으로 취하였다. 수치해는 수학적인 테스트 케이스를 설정하여 검증하였으며, 최적제어 Map을 방정식의 해를 구하면서 동시에 구하였다.

  • PDF

Single Machine Sequencing With Random Processing Times and Random Deferral Costs

  • Park, Sung H.
    • 한국경영과학회지
    • /
    • 제4권1호
    • /
    • pp.69-77
    • /
    • 1979
  • A single machine stochastic scheduling problem is considered. Associated with each job is its random processing time and random deferral cost. The criterion is to order the jobs so as to minimize the sum of the deferral costs. The expected sum of the deferral costs is theroretically derived under the stochastic situation for each of several scheduling decision rules which are well known for the deterministic environment. It is also shown that certain stochastic problems can be reduced to equivalent deterministic problems. Two examples are illustrated to show the expected total deferral costs.

  • PDF

PERMANENTS OF DOUBLY STOCHASTIC FERRERS MATRICES

  • Hwang, Suk-Geun;Pyo, Sung-Soo
    • 대한수학회지
    • /
    • 제36권5호
    • /
    • pp.1009-1020
    • /
    • 1999
  • The minimum permanent and the set of minimizing matrices over the face of the polytope n of all doubly stochastic matrices of order n determined by any staircase matrix was determined in [4] in terms of some parameter called frame. A staircase matrix can be described very simply as a Ferrers matrix by its row sum vector. In this paper, some simple exposition of the permanent minimization problem over the faces determined by Ferrers matrices of the polytope of n are presented in terms of row sum vectors along with simple proofs.

  • PDF

확률적 이선형시스템의 최적제 (Optimal Control of Stochastic Bilinear Systems)

  • Hwang, Chun-Sik
    • 대한전기학회논문지
    • /
    • 제31권7호
    • /
    • pp.18-24
    • /
    • 1982
  • We derived an optimal control of the Stochastic Bilinear Systems. For that we, firstly, formulated stochastic bilinear system and estimated its state when the system state is not directly observable. Optimal control problem of this system is reviewed on the line of three optimization techniques. An optimal control is derived using Hamilton-Jacobi-Bellman equation via dynamic programming method. It consists of combination of linear and quadratic form in the state. This negative feedback control, also, makes the system stable as far as value function is chosen to be a Lyapunov function. Several other properties of this control are discussed.

  • PDF

시변 지연이 존재하는 불확실 스토캐스틱 시스템의 지연의존 안정성 (New Delay-dependent Stability Criteria for Uncertain Stochastic Systems with Time-varying Delays)

  • 권오민;박주현;이상문
    • 전기학회논문지
    • /
    • 제58권11호
    • /
    • pp.2261-2265
    • /
    • 2009
  • In this paper, the problem of delay-dependent stability of uncertain stochastic systems with time-varying delay is considered. The uncertainties are assumed to be norm-bounded. Based on the Lyapunov stability theory, new delay-dependent stability criteria for the system are derived in terms of LMI(linear matrix inequality). Two numerical examples are given to show the effectiveness of proposed method.

확률 유한요소 이차섭동법을 사용한 구조물 최적설계 (Structural Optimization Using Stochastic Finite Element Second-Order Perturbation Method)

  • 임오강;이병우
    • 대한기계학회논문집
    • /
    • 제19권8호
    • /
    • pp.1822-1831
    • /
    • 1995
  • A general formulation of the design optimization problem with the random parameters is presented here. The formulation is based on the stochastic finite element second-order perturbation method ; it takes into full account of the stress and displacement constraints together with the rates of change of the random variables. A method of direct differentiation for calculating the sensitivity coefficients in regard to the governing equation and the second-order perturbed equation is derived. A gradient-based nonlinear programming technique is used to solve the problem. The numerical results are specifically noted, where the stiffness parameter and external load are treated as random variables.

An Efficient Scheduling Method for Grid Systems Based on a Hierarchical Stochastic Petri Net

  • Shojafar, Mohammad;Pooranian, Zahra;Abawajy, Jemal H.;Meybodi, Mohammad Reza
    • Journal of Computing Science and Engineering
    • /
    • 제7권1호
    • /
    • pp.44-52
    • /
    • 2013
  • This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.

OPTIMAL IMPULSE AND REGULAR CONTROL STRATEGIES FOR PROPORTIONAL REINSURANCE PROBLEM

  • RUI-CHENG YANG;KUN-HUI LIU;BING XIA
    • Journal of applied mathematics & informatics
    • /
    • 제18권1_2호
    • /
    • pp.145-158
    • /
    • 2005
  • We formulate a stochastic control problem on proportional reinsurance that includes impulse and regular control strategies. For the first time we combine impulse control with regular control, and derive the expected total discount pay-out (return function) from present to bankruptcy. By relying on both stochastic calculus and the classical theory of impulse and regular controls, we state a set of sufficient conditions for its solution in terms of optimal return function. Moreover, we also derive its explicit form and corresponding impulse and regular control strategies.