1987
DOI: 10.2307/2581946
|View full text |Cite
|
Sign up to set email alerts
|

A Linear Approximation for Chance-Constrained Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 0 publications
0
10
0
Order By: Relevance
“…In [19] [22] and [23], several uniformly tighter approximations have been developed to replace the non-linear constraint by a set of linear inequalities. However, these methods are only suited to problems with a small number of random coefficients.…”
Section: B Linear Approximation Of Optimization Problemmentioning
confidence: 99%
“…In [19] [22] and [23], several uniformly tighter approximations have been developed to replace the non-linear constraint by a set of linear inequalities. However, these methods are only suited to problems with a small number of random coefficients.…”
Section: B Linear Approximation Of Optimization Problemmentioning
confidence: 99%
“…Assuming resources of the projects are limited and renewable, the aim was maximization of the present value of profits of projects as the objective function. Olson et al [3] presented a linear approximation for chance constrained programming in their article which can be used in either the single or multiple objective cases. The approximation presented will place a bound on the chance constraint at least as tight as the true nonlinear form, thus it overachieves the chance constraint at the expense of other constraints or objectives.…”
Section: Literature Of Past Workmentioning
confidence: 99%
“…Hence, the constraint confidence levels of the linearized chance-constrained model should be recalculated by substituting the solutions of them into the non-linear chance-constrained model. This recalculated confidence levels are called "true probability" (Olson and Swenseth 1987). In this way, it is seen that the true probability values (K p ) are bigger than the confidence levels determined at the beginning of the solution process (K p ) in linearized model.…”
Section: Analyze Of the Constraints Confidence Levelmentioning
confidence: 99%
“…The model of Olson and Swenseth (1987) includes only one chance-constraint and it is a binding constraint. Equation (22) is a valid formulization for binding constraints.…”
Section: Analyze Of the Constraints Confidence Levelmentioning
confidence: 99%