pith. sign in

arxiv: 1208.4824 · v1 · pith:IBDDYNVHnew · submitted 2012-08-23 · 🧮 math.NA · cs.NA· math.OC

Numerical schemes for the optimal input flow of a supply-chain

classification 🧮 math.NA cs.NAmath.OC
keywords numericalchaincontroloutflowqueuesupplyachieveadjust
0
0 comments X
read the original abstract

An innovative numerical technique is presented to adjust the inflow to a supply chain in order to achieve a desired outflow, reducing the costs of inventory, or the goods timing in warehouses. The supply chain is modelled by a conservation law for the density of processed parts coupled to an ODE for the queue buffer occupancy. The control problem is stated as the minimization of a cost functional J measuring the queue size and the quadratic difference between the outflow and the expected one. The main novelty is the extensive use of generalized tangent vectors to a piecewise constant control, which represent time shifts of discontinuity points. Such method allows convergence results and error estimates for an Upwind- Euler steepest descent algorithm, which is also tested by numerical simulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.