A forward convex-simplex method (Q1089264)

From MaRDI portal
Revision as of 18:54, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A forward convex-simplex method
scientific article

    Statements

    A forward convex-simplex method (English)
    0 references
    1987
    0 references
    Forward algorithms provide a managerially practical way to solve multiperiod problems by solving progressively longer finite horizon subproblems. Many procedures of this nature already exist for special structures. \textit{J. E. Aronson, T. E. Morton} and \textit{G. L. Thompson} [ibid. 15, 348-365 (1984; Zbl 0527.90041)] have developed a forward simplex method for general staircase-structured linear programs. In this paper this method is extended to the case in which the objective function is convex.
    0 references
    0 references
    inventory
    0 references
    planning
    0 references
    production
    0 references
    Forward algorithms
    0 references
    multiperiod problems
    0 references
    forward simplex method
    0 references
    staircase-structured linear programs
    0 references