An Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support T61D8EZH24
| URI | m2://res/T61D8EZH24 |
|---|---|
| Kind | preprint |
| Creators | Soumya Ranjan Pathy, Hamed Rahimian |
| Date | 2026-09-27 |
| MSC | 49-XX, 90-XX, 93-XX |
| Subjects | arxiv math.OC |
| Scope | in |
Expressions
e1: version, preprint
| Language | en |
|---|---|
| Date | 2026-09-27 |
| Ids | arXiv 2609.33946 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Extended Envelope | definition | definition | arxiv |
| Submodularity of $f$ | statement | proposition | arxiv |
| Half-space as an S-free set | statement | lemma | arxiv |
| Intersection Cut | statement | theorem | arxiv |
| Properties of the Extended Envelope | statement | proposition | arxiv |
| Modular Intersection Cut | statement | theorem | arxiv |
| Modularity of \( f_K \ | statement | proposition | arxiv |
| Ray Exit Distance | statement | lemma | arxiv |
| Probability Cover | definition | definition | arxiv |
| Cover S-Free Set | statement | lemma | arxiv |
| Closed-Form Exit Distance for Modular Cut | statement | lemma | arxiv |
| Extended Polymatroid | definition | definition | arxiv |
| S3T17V79YQ | statement | proposition | arxiv |
| S-Free Set | definition | definition | arxiv |
| Submodular Intersection Cut | statement | theorem | arxiv |
| Y6N1RG3GW1 | definition | definition | arxiv |
Catalogue records
- arxiv: 2609.33946 (work)
- arxiv_text: 2609.33946 (work)