A production-transportation problem with stochastic demand and concave production costs

DOI10.1007/s101070050050zbMath0956.90020MaRDI QIDQ1295962

Kaj Holmberg, Hoang Tuy

Publication date: 18 March 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

transportation; branch-and-bound; decomposition methods; d.c. functions

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C15: Stochastic programming

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows, Mean value cross decomposition for nonlinear convex problems, A general purpose exact solution method for mixed integer concave minimization problems, A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels, Global convergence of a proximal linearized algorithm for difference of convex functions, Solving DC programs using the cutting angle method, A transportation planning problem with transfer costs in uncertain environment, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, Service system design with immobile servers, stochastic demand and concave-cost capacity selection, An uncertain programming for the integrated planning of production and transportation, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, Exact solution methods for uncapacitated location problems with convex transportation costs, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, The DTC (difference of tangentially convex functions) programming: optimality conditions, A modified proximal point method for DC functions on Hadamard manifolds, Solving the production transportation problem via a deterministic annealing neural network method, Proximal bundle methods for nonsmooth DC programming, An inertial algorithm for DC programming, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes