A production-transportation problem with stochastic demand and concave production costs
DOI10.1007/S101070050050zbMATH Open0956.90020OpenAlexW1995577535MaRDI QIDQ1295962FDOQ1295962
Authors: 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
Recommendations
- A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost
- A Transportation Problem in Which Costs Depend on the Order of Arrival
- An algorithm for a concave production cost network flow problem
- scientific article; zbMATH DE number 5056702
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (31)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- A general purpose exact solution method for mixed integer concave minimization problems
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- On some approaches to investigation random demand in production-transport model
- Optimal transportation policies for production/inventory systems with an unreliable and a reliable carrier
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Total cost measures with probabilistic cost function under varying supply and demand in transportation problem
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- 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 bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- Service system design with immobile servers, stochastic demand and concave-cost capacity selection
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- Exact solution methods for uncapacitated location problems with convex transportation costs
- A production-transportation problem with piecewise linear cost structures
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Solving DC programs using the cutting angle method
- Title not available (Why is that?)
- Mean value cross decomposition for nonlinear convex problems
- A transportation planning problem with transfer costs in uncertain environment
- A modified proximal point method for DC functions on Hadamard manifolds
- The concave cost supply problem.
- A continuous approach for the concave cost supply problem via DC programming and DCA
- A Transportation Problem in Which Costs Depend on the Order of Arrival
- An uncertain programming for the integrated planning of production and transportation
This page was built for publication: A production-transportation problem with stochastic demand and concave production costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295962)
