A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation

We study a chance-constrained optimization problem where the random variable appearing in the chance constraint follows a normal distribution whose mean and variance both depend linearly on the decision variables. Such structure may arise in many applications, including the normal approximation to t...

Celý popis

Podrobná bibliografie

Vydáno v:	Optimization letters Ročník 17; číslo 2; s. 265 - 282
Hlavní autor:	Mildebrath, David
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023
Témata:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Reverse convex programming Chance-constrained programming Polynomial-time algorithms Nonlinear optimization
ISSN:	1862-4472, 1862-4480
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!