A stochastic geometric programming problem with multiplicative recourse (Q916566): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(90)90048-a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051169620 / rank | |||
Normal rank | |||
Latest revision as of 10:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A stochastic geometric programming problem with multiplicative recourse |
scientific article |
Statements
A stochastic geometric programming problem with multiplicative recourse (English)
0 references
1990
0 references
A stochastic geometric programming problem is formulated as a multiplicative recourse model. As a general result it is shown that the deterministic equivalent model is convex. Some computational considerations refer to the case of normally distributed coefficients.
0 references
stochastic geometric programming
0 references
multiplicative recourse model
0 references
0 references
0 references
