Dual dynamic programming for linear production/inventory systems (Q1813749): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On The Computational Solution of Linear Programming Problems Involving Almost-Block-Diagonal Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A noniterative multiproduct multiperiod production planning method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Production Planning Over Time at Minimum Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Solution of the Warehouse Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming. Sequential scientific management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of linear programs by dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input optimization for infinite-horizon discounted programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual dynamic programming for linear production/inventory systems / rank
 
Normal rank

Latest revision as of 16:07, 14 May 2024

scientific article
Language Label Description Also known as
English
Dual dynamic programming for linear production/inventory systems
scientific article

    Statements

    Dual dynamic programming for linear production/inventory systems (English)
    0 references
    0 references
    25 June 1992
    0 references
    The paper considers the problem of scheduling production of a single product, which is produced in a factory whose technology is described by an LP, and then stored for future use if desired. The method developed solves first an LP for each period parametrically, and then uses a dual dynamic programming algorithm to generate the optimal production- inventory policy for the entire planning horizon. Throughout the modelling procedure, the analysis is illustrated by a small example problem.
    0 references
    duality
    0 references
    single product
    0 references
    dual dynamic programming
    0 references
    optimal production- inventory policy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references