Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs (Q828647): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-020-01592-1 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-020-01592-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3028733243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inequalities in Probability Theory: A Convex Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Bounds with Cherry Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality for Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bonferroni-Type Inequalities via Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the probability of the union of events by aggregation and disaggregation in linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for the probability of the occurrence of at least <i>m</i> out of <i>n</i> events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some graph-based bounds on the probability of a union of events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating two-stage chance-constrained programs with classical probability bounds / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-020-01592-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:21, 10 December 2024

scientific article
Language Label Description Also known as
English
Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
scientific article

    Statements

    Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs (English)
    0 references
    0 references
    5 May 2021
    0 references
    chance-constrained optimization
    0 references
    Bonferroni inequalities
    0 references
    union bounds
    0 references
    stochastic optimization
    0 references
    floor function
    0 references
    linearization
    0 references

    Identifiers