Solving nonlinear mixed integer stochastic problems: a global perspective

MaRDI QIDQ5492522zbMATH OpenFDO

Authors Maria Elena Bruni

Publication date 13 October 2006

zbMATH Keywords

branch-and-boundLagrangian decompositionMINLPstochastic programmingtrim loss

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A solution approach for two-stage stochastic nonlinear mixed integer programs
• SICOpt: Solution approach for nonlinear integer stochastic programming problems
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
• On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
• A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables

Cited in

(4)

• Different transformations for solving non-convex trim-loss problems by MINLP
• On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse.
• Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
• scientific article; zbMATH DE number 2051090 (Why is no real title available?)

This page was built for publication: Solving nonlinear mixed integer stochastic problems: a global perspective

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