Efficient decomposition and linearization methods for the stochastic transportation problem

DOI10.1007/BF01300860MaRDI QIDQ1908529zbMATH OpenFDO

Authors Kaj Holmberg

Publication date 28 February 1996

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01300860

zbMATH Keywords

subgradient optimizationnonlinear objective functionstochastic transportation problemFrank-Wolfe methodconvex transportation problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Stochastic programming (90C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Cross decomposition applied to the stochastic transportation problem
• A comparison of feasible direction methods for the stochastic transportation problem
• Decomposition methods in stochastic programming
• Stochastic decomposition. A statistical method for large scale stochastic linear programming
• Some advances in decomposition methods for stochastic linear programming

Cites work

• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• scientific article; zbMATH DE number 3529629 (Why is no real title available?)
• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• A Stochastic Transportation Problem
• A convergence proof for linear mean value cross decomposition
• Allocation under uncertainty when the demand has continuous d. f
• An algorithm for nonlinear programs over Cartesian product sets
• Cross decomposition applied to the stochastic transportation problem
• Cross decomposition for mixed integer programming
• Decomposition Principle for Linear Programs
• Forest iteration method for stochastic transportation problem
• Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• Minimization of unsmooth functionals
• Partitioning procedures for solving mixed-variables programming problems
• Stochastic transportation problems and other newtork related convex problems
• Two-Level Planning
• Validation of subgradient optimization

Cited in

(11)

• Forest iteration method for stochastic transportation problem
• Stochastic fractional programming approach to a mean and variance model of a transportation problem
• A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels
• Quasi-linear stochastic programming model based on expectation and variance and its application in transportation problem
• Cross decomposition applied to the stochastic transportation problem
• scientific article; zbMATH DE number 527371 (Why is no real title available?)
• A comparison of feasible direction methods for the stochastic transportation problem
• scientific article; zbMATH DE number 146408 (Why is no real title available?)
• The stochastic transportation problem with single sourcing
• Mean value cross decomposition for nonlinear convex problems
• Optimizing large on-demand transportation systems through stochastic conic programming

This page was built for publication: Efficient decomposition and linearization methods for the stochastic transportation problem

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