skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Stochastic Programming with One Chance Constraint: Parametric Analysis.

Abstract

Abstract not provided.

Authors:
; ;
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1079144
Report Number(s):
SAND2013-3867J
452729
DOE Contract Number:
AC04-94AL85000
Resource Type:
Journal Article
Resource Relation:
Journal Name: Operations Research; Related Information: Proposed for publication in Operations Research.
Country of Publication:
United States
Language:
English

Citation Formats

Watson, Jean-Paul, Greenberg, Harvey J., and Woodruff, David L. Stochastic Programming with One Chance Constraint: Parametric Analysis.. United States: N. p., 2013. Web.
Watson, Jean-Paul, Greenberg, Harvey J., & Woodruff, David L. Stochastic Programming with One Chance Constraint: Parametric Analysis.. United States.
Watson, Jean-Paul, Greenberg, Harvey J., and Woodruff, David L. Wed . "Stochastic Programming with One Chance Constraint: Parametric Analysis.". United States. doi:.
@article{osti_1079144,
title = {Stochastic Programming with One Chance Constraint: Parametric Analysis.},
author = {Watson, Jean-Paul and Greenberg, Harvey J. and Woodruff, David L.},
abstractNote = {Abstract not provided.},
doi = {},
journal = {Operations Research},
number = ,
volume = ,
place = {United States},
year = {Wed May 01 00:00:00 EDT 2013},
month = {Wed May 01 00:00:00 EDT 2013}
}
  • In this study, an inexact fuzzy-stochastic constraint-softened programming method is developed for municipal solid waste (MSW) management under uncertainty. The developed method can deal with multiple uncertainties presented in terms of fuzzy sets, interval values and random variables. Moreover, a number of violation levels for the system constraints are allowed. This is realized through introduction of violation variables to soften system constraints, such that the model's decision space can be expanded under demanding conditions. This can help generate a range of decision alternatives under various conditions, allowing in-depth analyses of tradeoffs among economic objective, satisfaction degree, and constraint-violation risk. Themore » developed method is applied to a case study of planning a MSW management system. The uncertain and dynamic information can be incorporated within a multi-layer scenario tree; revised decisions are permitted in each time period based on the realized values of uncertain events. Solutions associated with different satisfaction degree levels have been generated, corresponding to different constraint-violation risks. They are useful for supporting decisions of waste flow allocation and system-capacity expansion within a multistage context.« less
  • This paper develops a model to aid Coast Guard managers in formulating appropriate policies with respect to planning for various types of equipment required to contain major pollution incidents. The model is elaborated in terms of three primary stages of response: offloading, containment, and removal. The zero order rule of chance constrained programming is used to obtain a deterministic equivalent of the original chance-constrained model. This is then replaced by a goal-programming formulation to allow for plans that come as close as possible to desired quality and risk levels for each pertinent region and type of incident. Numerical examples illustratemore » potential uses of the model with special emphasis on its value for budgetary (equipment) planning by central management that extends to evaluation of risk and performance quality levels, as well as the usual dual-evaluator approaches for evaluating initially prescribed levels for equipment and their efficiency coefficients. 23 references, 4 figures, 5 tables.« less
  • A new technique, called the mixed-integer-chance-constrained programming (MICCP) method is developed in this research. This technique considers uncertainty in all linear programming constraint coefficients and does not require a priori knowledge of the distribution. A groundwater remediation problem serves as an example. The method is developed to find the globally optimal trade-off curve for maximum reliability versus a minimum pumping objective. As the fields became more heterogeneous, the pumping rate of a reliable solution increases. Four simple [open quotes]rule of thumb[close quotes] methods are compared to the MICCP technique. In general, the performance of such methods decreases as the heterogeneitymore » of the hydraulic conductivity field increases. 31 refs., 8 figs., 2 tabs.« less
  • Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as amore » foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.« less