scientific article; zbMATH DE number 938962

MaRDI QIDQ4897134zbMATH OpenFDO

Authors Heng-Yong Tang

Publication date 12 May 1997

zbMATH Keywords

cutting planedual programmingprobabilistic constrained problem

Mathematics Subject Classification ID

Stochastic programming (90C15)

Recommendations

• A dual algorithm for probabilistic constrained problem of stochastic convex programming
• scientific article; zbMATH DE number 4174668
• A dual method for probabilistic constrained problems
• On properties of the probabilistic contrained linear programming problem and its dual
• A Cutting Plane Approach for Chance Constrained Linear Programs

Cited in

(1)

• A Cutting Plane Approach for Chance Constrained Linear Programs

This page was built for publication:

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