1959
DOI: 10.1287/mnsc.6.1.73
|View full text |Cite
|
Sign up to set email alerts
|

Chance-Constrained Programming

Abstract: A new conceptual and analytical vehicle for problems of temporal planning under uncertainty, involving determination of optimal (sequential) stochastic decision rules is defined and illustrated by means of a typical industrial example. The paper presents a method of attack which splits the problem into two non-linear (or linear) programming parts, (i) determining optimal probability distributions, (ii) approximating the optimal distributions as closely as possible by decision rules of prescribed form.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
945
0
12

Year Published

1990
1990
2017
2017

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 2,286 publications
(958 citation statements)
references
References 3 publications
1
945
0
12
Order By: Relevance
“…The concept of chance-constrained programming (CCP), which was introduced by Charnes and Cooper [5], is adopted to solve the FIR model (4). CCP deals with uncertainty by specifying the desired levels of confidence for which the constraints hold.…”
Section: Input Relaxation Congestion Model In Fuzzy Deamentioning
confidence: 99%
“…The concept of chance-constrained programming (CCP), which was introduced by Charnes and Cooper [5], is adopted to solve the FIR model (4). CCP deals with uncertainty by specifying the desired levels of confidence for which the constraints hold.…”
Section: Input Relaxation Congestion Model In Fuzzy Deamentioning
confidence: 99%
“…25 The main idea of chance constrained programming is to optimize the critical value of the fuzzy objective with certain confidence level subject to some chance constraints. Let D be the given integral upper bound of the spanning trees.…”
Section: Chance-constrained Programming Models Of Dcfmstmentioning
confidence: 99%
“…It was shown that the objective function increases, if the specified Introduction 3 constraints have to be satisfied with a higher probability. Examples of application of the CCP technique can also be found in [18][19][20].…”
Section: Acknowledgementsmentioning
confidence: 99%
“…It was shown that the objective function increases, if the specified Introduction 3 constraints have to be satisfied with a higher probability. Examples of application of the CCP technique can also be found in [18][19][20].An alternative approach to the above optimization technique, using an Advanced First Order Second Moment Method, was presented by Nikolaidis and Burdisso in [7]. It was called Safety Index Optimization (SIO), because the , constraints were expressed in terms of the safety index that corresponded to the physical constraints.…”
mentioning
confidence: 99%