A forward convex-simplex method (Q1089264): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0377-2217(87)90246-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031779359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3220089 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A forward algorithm and planning horizon procedure for the production smoothing problem without inventory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5181040 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4143234 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4173179 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A forward convex-simplex method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Convex Simplex Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5591247 / rank | |||
Normal rank |
Latest revision as of 19:53, 17 June 2024
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
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
0 references