A stochastic geometric programming problem with multiplicative recourse (Q916566): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design modifications by geometric programming and constrained stochastic network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Under Uncertainty: The Equivalent Convex Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Engineering Design Under Uncertainty by Geometric Programming / rank
 
Normal rank
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 09: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

    Identifiers