A class of nonseparable dynamic programming problems (Q1075255): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stochastic spanning tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial time algorithm for a chance-constrained single machine scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: C-programming problems: A class of non-linear optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of a class of proxy problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: C-programming. An outline / rank | |||
Normal rank | |||
Latest revision as of 13:54, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of nonseparable dynamic programming problems |
scientific article |
Statements
A class of nonseparable dynamic programming problems (English)
0 references
1987
0 references
A solution procedure is proposed for a class of deterministic sequential decision problems whose objective functions are of the form \(\sum f_ n(x_ n)+\Phi (\sum g_ n(x_ n))\), where \(\Phi\) is differentiable and either concave or convex. The procedure calls for the collaboration between dynamic programming and c-programming, and is demonstrated in our treatment for a minimum variance type problem.
0 references
solution procedure
0 references
deterministic sequential decision
0 references
dynamic programming
0 references
c-programming
0 references
minimum variance type problem
0 references
