{"paper":{"title":"Numerical schemes for the optimal input flow of a supply-chain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Benedetto Piccoli, Ciro D'Apice, Rosanna Manzo","submitted_at":"2012-08-23T18:28:31Z","abstract_excerpt":"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, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4824","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}