Math 2.0

Resources / preprint

An Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support T61D8EZH24

URIm2://res/T61D8EZH24
Kindpreprint
CreatorsSoumya Ranjan Pathy, Hamed Rahimian
Date2026-09-27
MSC49-XX, 90-XX, 93-XX
Subjectsarxiv math.OC
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-09-27
IdsarXiv 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.

ItemKindWhereSource
Extended Envelopedefinitiondefinitionarxiv
Submodularity of $f$statementpropositionarxiv
Half-space as an S-free setstatementlemmaarxiv
Intersection Cutstatementtheoremarxiv
Properties of the Extended Envelopestatementpropositionarxiv
Modular Intersection Cutstatementtheoremarxiv
Modularity of \( f_K \statementpropositionarxiv
Ray Exit Distancestatementlemmaarxiv
Probability Coverdefinitiondefinitionarxiv
Cover S-Free Setstatementlemmaarxiv
Closed-Form Exit Distance for Modular Cutstatementlemmaarxiv
Extended Polymatroiddefinitiondefinitionarxiv
S3T17V79YQstatementpropositionarxiv
S-Free Setdefinitiondefinitionarxiv
Submodular Intersection Cutstatementtheoremarxiv
Y6N1RG3GW1definitiondefinitionarxiv

Catalogue records