• Title/Summary/Keyword: Two-stage stochastic programming

Search Result 13, Processing Time 0.025 seconds

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

  • Tang, Hengyong;Zhao, Yufang
    • Journal of applied mathematics & informatics
    • /
    • v.13 no.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.

A Two-stage Stochastic Programming Model for Optimal Reactive Power Dispatch with High Penetration Level of Wind Generation

  • Cui, Wei;Yan, Wei;Lee, Wei-Jen;Zhao, Xia;Ren, Zhouyang;Wang, Cong
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.53-63
    • /
    • 2017
  • The increasing of wind power penetration level presents challenges in classical optimal reactive power dispatch (ORPD) which is usually formulated as a deterministic optimization problem. This paper proposes a two-stage stochastic programming model for ORPD by considering the uncertainties of wind speed and load in a specified time interval. To avoid the excessive operation, the schedule of compensators will be determined in the first-stage while accounting for the costs of adjusting the compensators (CACs). Under uncertainty effects, on-load tap changer (OLTC) and generator in the second-stage will compensate the mismatch caused by the first-stage decision. The objective of the proposed model is to minimize the sum of CACs and the expected energy loss. The stochastic behavior is formulated by three-point estimate method (TPEM) to convert the stochastic programming into equivalent deterministic problem. A hybrid Genetic Algorithm-Interior Point Method is utilized to solve this large-scale mixed-integer nonlinear stochastic problem. Two case studies on IEEE 14-bus and IEEE 118-bus system are provided to illustrate the effectiveness of the proposed method.

STABILITY OF THE MULTIPLE OBJECTIVE LINEAR STOCHASTIC PROGRAMMING PROBLEMS

  • Cho, Gyeong-Mi
    • Bulletin of the Korean Mathematical Society
    • /
    • v.32 no.2
    • /
    • pp.287-296
    • /
    • 1995
  • Wets ([4],[5],[6]) considered single objective linear two-stage programming problem under uncertainty with complete recourse. Artstein, Dupacova, Romisch, Schultz and Wets studied stability of this problem id depth. But in many real world problems to make best decision, we need multiple objective functions. So we consider the following multiple objective two-stage programming problems with complete fixed recourse.

  • PDF

A Study on Solution Methods of Two-stage Stochastic LP Problems

  • Lee, Sang-Jin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.1
    • /
    • pp.1-24
    • /
    • 1997
  • In this paper, we have proposed new solution methods to solve TSLP (two-stage stochastic linear programming) problems. One solution method is to combine the analytic center concept with Benders' decomposition strategy to solve TSLP problems. Another method is to apply an idea proposed by Geoffrion and Graves to modify the L-shaped algorithm and the analytic center algorithm. We have compared the numerical performance of the proposed algorithms to that of the existing algorithm, the L-shaped algorithm. To effectively compare those algorithms, we have had computational experiments for seven test problems.

  • PDF

A Two-Stage Stochastic Approach to the Artillery Fire Sequencing Problem (2단계 추계학적 야전 포병 사격 순서 결정 모형에 관한 연구)

  • Jo, Jae-Young
    • Journal of the military operations research society of Korea
    • /
    • v.31 no.2
    • /
    • pp.28-44
    • /
    • 2005
  • The previous studies approach the field artillery fire scheduling problem as deterministic and do not explicitly include information on the potential scenario changes. Unfortunately, the effort used to optimize fire sequences and reduce the total time of engagement is often inefficient as the collected military intelligence changes. Instead of modeling the fire sequencing problem as deterministic model, we consider a stochastic artillery fire scheduling model and devise a solution methodology to integrate possible enemy attack scenarios in the evaluation of artillery fire sequences. The goal is to use that information to find robust solutions that withstand disruptions in a better way, Such an approach is important because we can proactively consider the effects of certain unique scheduling decisions. By identifying more robust schedules, cascading delay effects will be minimized. In this paper we describe our stochastic model for the field artillery fire sequencing problem and offer revised robust stochastic model which considers worst scenario first. The robust stochastic model makes the solution more stable than the general two-stage stochastic model and also reduces the computational cost dramatically. We present computational results demonstrating the effectiveness of our proposed method by EVPI, VSS, and Variances.

Robust investment model for long range capacity expansion of chemical processing networks using two-stage algorithm

  • Bok, Jinkwang;Lee, Heeman;Park, Sunwon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1758-1761
    • /
    • 1997
  • The problem of long range capacity expansion planing for chemical processing network under uncertain demand forecast secnarios is addressed. This optimization problem involves capactiy expansion timing and sizing of each chemical processing unit to maximize the expected net present value considering the deviation of net present values and the excess capacity over a given time horizon. A multiperiod mixed integer nonlinear programming optimization model that is both solution and modle robust for any realization of demand scenarios is developed using the two-stage stochastic programming algorithm. Two example problems are considered to illustrate the effectiveness of the model.

  • PDF

A Decomposition Method for Two stage Stochstic Programming with Block Diagonal Structure (블록 대각 구조를 지닌 2단계 확률계획법의 분해원리)

  • 김태호;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.10 no.1
    • /
    • pp.9-13
    • /
    • 1985
  • This paper develops a decomposition method for stochastic programming with a block diagonal structure. Here we assume that the right-hand side random vector of each subproblem is differente each other. We first, transform this problem into a master problem, and subproblems in a similar way to Dantizig-Wolfe's Decomposition Princeple, and then solve this master problem by solving subproblems. When we solve a subproblem, we first transform this subproblem to a Deterministic Equivalent Programming (DEF). The form of DEF depends on the type of the random vector of the subproblem. We found the subproblem with finite discrete random vector can be transformed into alinear programming, that with continuous random vector into a convex quadratic programming, and that with random vector of unknown distribution and known mean and variance into a convex nonlinear programming, but the master problem is always a linear programming.

  • PDF

A Study on a Stochastic Material Flow Network with Bidirectional and Uncertain Flows (양방향 흐름을 고려한 물류시스템의 최적화 모델에 관한 연구)

  • Hwang, Heung-Suk
    • IE interfaces
    • /
    • v.10 no.3
    • /
    • pp.179-187
    • /
    • 1997
  • The efficiency of material flow systems in terms of optimal network flow and minimum cost flow has always been an important design and operational goal in material handling and distribution system. In this research, an attempt was made to develop a new algorithm and the model to solve a stochastic material flow network with bidirectional and uncertain flows. A stochastic material flow network with bidirectional flows can be considered from a finite set with unknown demand probabilities of each node. This problem can be formulated as a special case of a two-stage linear programming problem which can be converted into an equivalent linear program. To find the optimal solution of proposed stochastic material flow network, some terminologies and algorithms together with theories are developed based on the partitioning and subgradient techniques. A computer program applying the proposed method was developed and was applied to various problems.

  • PDF

Optimization of Water Reuse System under Uncertainty (불확실성을 고려한 하수처리수 재이용 관로의 최적화)

  • Chung, Gun-Hui;Kim, Tae-Woong;Lee, Jeong-Ho;Kim, Joong-Hoon
    • Journal of Korea Water Resources Association
    • /
    • v.43 no.2
    • /
    • pp.131-138
    • /
    • 2010
  • Due to the increased water demand and severe drought as an effect of the global warming, the effluent from wastewater treatment plants becomes considered as an alternative water source to supply agricultural, industrial, and public (gardening) water demand. The effluent from the wastewater treatment plant is a sustainable water source because of its good quality and stable amount of water discharge. In this study, the water reuse system was developed to minimize total construction cost to cope with the uncertain water demand in future using two-stage stochastic linear programming with binary variables. The pipes in the water reuse network were constructed in two stages of which in the first stage, the water demands of users are assumed to be known, while the water demands in the second stage have uncertainty in the predicted value. However, the water reuse system has to be designed now when the future water demands are not known precisely. Therefore, the construction of a pipe parallel with the existing one was allowed to meet the increased water demands in the second stage. As a result, the trade-off of construction costs between a pipe with large diameter and two pipes having small diameters was evaluated and the optimal solution was found. Three scenarios for the future water demand were selected and a hypothetical water reuse network considering the uncertainties was optimized. The results provide the information about the economies of scale in the water reuse network and the long range water supply plan.