Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility

Cited in

(37)

Valuation of electricity swing options by multistage stochastic programming
Convergent bounds for stochastic programs with expected value constraints
On the use of purely finitely additive multipliers in mathematical programming
Lagrange multipliers in infinite horizon discrete time optimal control models
Stochastic convex programming: Kuhn-Tucker conditions
Measures as Lagrange multipliers in multistage stochastic programming
Containing groundwater contamination: Planning models using stochastic programming with recourse
Duality and statistical tests of optimality for two stage stochastic programs
Two-stage stochastic variational inequalities: an ERM-solution procedure
Incorporating statistical model error into the calculation of acceptability prices of contingent claims
Projection and discretization methods in stochastic programming
Executing join queries in an uncertain distributed environment
Challenges in optimization with complex PDE-systems. Abstracts from the workshop held February 14--20, 2021 (hybrid meeting)
Subregular recourse in nonlinear multistage stochastic optimization
Strategic growth with recursive preferences: decreasing marginal impatience
Optimal order strategy in uncertain demands with free shipping option
Quadratic two-stage stochastic optimization with coherent measures of risk
Solving a class of stochastic mixed-integer programs with branch and price
Robust process control by dynamic stochastic programming
The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
On duality theory of convex semi-infinite programming
Extremum conditions for a multistep stochastic programming problem with smooth constraints
On stochastic programming ii: dynamic problems under risk^∗
On the interchange of subdifferentiation and conditional expectation for convex functionals
Duality relations and optimality conditions in linear stochastic programming
Optimality Conditions and Moreau–Yosida Regularization for Almost Sure State Constraints
Optimal power flow in distribution networks under N- 1 disruptions: a multistage stochastic programming approach
Exact converging bounds for stochastic dual dynamic programming via Fenchel duality
On feasibility of sample average approximation solutions
Optimality conditions for convex stochastic optimization problems in Banach spaces with almost sure state constraints
Notes on free lunch in the limit and pricing by conjugate duality theory
Cooperative game theory and inventory management
scientific article; zbMATH DE number 958363 (Why is no real title available?)
A prediction-correction ADMM for multistage stochastic variational inequalities
Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers
Decomposition methods for monotone two-time-scale stochastic optimization problems
Lagrangian dual for integer optimization with zero duality gap that admits decomposition

This page was built for publication: Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4116274)